./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label44.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3542ad3d447b947690b49c5fc158285b42adda78f0fdce0b42f6bfc41ea9f09f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:59:54,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:59:54,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:59:54,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:59:54,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:59:54,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:59:54,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:59:54,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:59:54,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:59:54,890 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:59:54,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:59:54,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:59:54,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:59:54,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:59:54,893 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:59:54,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:59:54,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:59:54,894 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:59:54,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:59:54,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:59:54,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:59:54,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:59:54,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:59:54,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:59:54,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:59:54,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:59:54,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:59:54,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:59:54,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:59:54,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:59:54,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:59:54,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:59:54,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:59:54,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:59:54,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:59:54,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:59:54,903 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:59:54,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:59:54,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:59:54,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:59:54,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:59:54,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:59:54,904 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3542ad3d447b947690b49c5fc158285b42adda78f0fdce0b42f6bfc41ea9f09f [2024-10-10 23:59:55,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:59:55,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:59:55,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:59:55,167 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:59:55,167 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:59:55,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label44.c [2024-10-10 23:59:56,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:59:56,959 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:59:56,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label44.c [2024-10-10 23:59:56,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1b1c5bdba/9f524532aa7b4e6396b32889df29ed93/FLAG891b6cfcb [2024-10-10 23:59:57,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1b1c5bdba/9f524532aa7b4e6396b32889df29ed93 [2024-10-10 23:59:57,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:59:57,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:59:57,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:59:57,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:59:57,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:59:57,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:59:57" (1/1) ... [2024-10-10 23:59:57,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27cc49e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:57, skipping insertion in model container [2024-10-10 23:59:57,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:59:57" (1/1) ... [2024-10-10 23:59:57,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:59:57,365 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label44.c[4684,4697] [2024-10-10 23:59:58,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:59:58,281 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:59:58,300 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label44.c[4684,4697] [2024-10-10 23:59:58,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:59:58,862 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:59:58,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:58 WrapperNode [2024-10-10 23:59:58,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:59:58,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:59:58,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:59:58,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:59:58,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:58" (1/1) ... [2024-10-10 23:59:58,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:58" (1/1) ... [2024-10-10 23:59:59,472 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9431 [2024-10-10 23:59:59,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:59:59,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:59:59,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:59:59,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:59:59,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:58" (1/1) ... [2024-10-10 23:59:59,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:58" (1/1) ... [2024-10-10 23:59:59,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:58" (1/1) ... [2024-10-11 00:00:00,162 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 00:00:00,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:58" (1/1) ... [2024-10-11 00:00:00,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:58" (1/1) ... [2024-10-11 00:00:00,520 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:58" (1/1) ... [2024-10-11 00:00:00,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:58" (1/1) ... [2024-10-11 00:00:00,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:58" (1/1) ... [2024-10-11 00:00:00,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:58" (1/1) ... [2024-10-11 00:00:00,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:00:00,845 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:00:00,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:00:00,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:00:00,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:58" (1/1) ... [2024-10-11 00:00:00,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:00:00,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:00:00,901 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 00:00:00,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 00:00:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:00:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 00:00:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:00:00,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:00:01,024 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:00:01,027 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:00:08,646 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2024-10-11 00:00:08,646 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:00:08,750 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:00:08,750 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 00:00:08,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:00:08 BoogieIcfgContainer [2024-10-11 00:00:08,752 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:00:08,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:00:08,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:00:08,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:00:08,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:59:57" (1/3) ... [2024-10-11 00:00:08,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fe2b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:00:08, skipping insertion in model container [2024-10-11 00:00:08,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:58" (2/3) ... [2024-10-11 00:00:08,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fe2b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:00:08, skipping insertion in model container [2024-10-11 00:00:08,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:00:08" (3/3) ... [2024-10-11 00:00:08,764 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label44.c [2024-10-11 00:00:08,782 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:00:08,783 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:00:08,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:00:08,913 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1153bb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:00:08,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:00:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:08,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 00:00:08,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:08,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:08,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:08,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:08,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1732168025, now seen corresponding path program 1 times [2024-10-11 00:00:08,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:08,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463070375] [2024-10-11 00:00:08,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:08,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:00:09,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:09,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463070375] [2024-10-11 00:00:09,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463070375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:09,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:09,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:00:09,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472433688] [2024-10-11 00:00:09,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:09,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 00:00:09,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:09,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 00:00:09,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 00:00:09,226 INFO L87 Difference]: Start difference. First operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:09,345 INFO L93 Difference]: Finished difference Result 3371 states and 6405 transitions. [2024-10-11 00:00:09,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 00:00:09,349 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 00:00:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:09,380 INFO L225 Difference]: With dead ends: 3371 [2024-10-11 00:00:09,381 INFO L226 Difference]: Without dead ends: 1684 [2024-10-11 00:00:09,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 00:00:09,392 INFO L432 NwaCegarLoop]: 3138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:09,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3138 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:00:09,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2024-10-11 00:00:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2024-10-11 00:00:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2024-10-11 00:00:09,506 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 33 [2024-10-11 00:00:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:09,506 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2024-10-11 00:00:09,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2024-10-11 00:00:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 00:00:09,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:09,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:09,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 00:00:09,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:09,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:09,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1175487875, now seen corresponding path program 1 times [2024-10-11 00:00:09,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:09,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880609446] [2024-10-11 00:00:09,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:09,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:00:10,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:10,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880609446] [2024-10-11 00:00:10,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880609446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:10,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:10,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:00:10,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642144873] [2024-10-11 00:00:10,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:10,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:00:10,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:10,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:00:10,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:00:10,029 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:23,113 INFO L93 Difference]: Finished difference Result 6202 states and 11756 transitions. [2024-10-11 00:00:23,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:00:23,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 00:00:23,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:23,140 INFO L225 Difference]: With dead ends: 6202 [2024-10-11 00:00:23,140 INFO L226 Difference]: Without dead ends: 4519 [2024-10-11 00:00:23,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:00:23,145 INFO L432 NwaCegarLoop]: 1846 mSDtfsCounter, 4276 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 11128 mSolverCounterSat, 2129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4276 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 13257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2129 IncrementalHoareTripleChecker+Valid, 11128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:23,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4276 Valid, 2111 Invalid, 13257 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2129 Valid, 11128 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2024-10-11 00:00:23,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2024-10-11 00:00:23,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4468. [2024-10-11 00:00:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4468 states, 4467 states have (on average 1.5981643160958137) internal successors, (7139), 4467 states have internal predecessors, (7139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4468 states to 4468 states and 7139 transitions. [2024-10-11 00:00:23,282 INFO L78 Accepts]: Start accepts. Automaton has 4468 states and 7139 transitions. Word has length 33 [2024-10-11 00:00:23,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:23,283 INFO L471 AbstractCegarLoop]: Abstraction has 4468 states and 7139 transitions. [2024-10-11 00:00:23,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:23,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4468 states and 7139 transitions. [2024-10-11 00:00:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-10-11 00:00:23,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:23,296 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:23,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 00:00:23,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:23,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:23,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1382168362, now seen corresponding path program 1 times [2024-10-11 00:00:23,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:23,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87669299] [2024-10-11 00:00:23,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:24,309 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:00:24,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:24,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87669299] [2024-10-11 00:00:24,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87669299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:24,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:24,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:00:24,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310925844] [2024-10-11 00:00:24,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:24,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:00:24,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:24,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:00:24,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:00:24,320 INFO L87 Difference]: Start difference. First operand 4468 states and 7139 transitions. Second operand has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:30,342 INFO L93 Difference]: Finished difference Result 7601 states and 12931 transitions. [2024-10-11 00:00:30,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:00:30,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2024-10-11 00:00:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:30,357 INFO L225 Difference]: With dead ends: 7601 [2024-10-11 00:00:30,357 INFO L226 Difference]: Without dead ends: 4468 [2024-10-11 00:00:30,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:00:30,362 INFO L432 NwaCegarLoop]: 1769 mSDtfsCounter, 1151 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5717 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 5725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:30,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1947 Invalid, 5725 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 5717 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-11 00:00:30,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2024-10-11 00:00:30,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 4468. [2024-10-11 00:00:30,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4468 states, 4467 states have (on average 1.5961495410790238) internal successors, (7130), 4467 states have internal predecessors, (7130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4468 states to 4468 states and 7130 transitions. [2024-10-11 00:00:30,431 INFO L78 Accepts]: Start accepts. Automaton has 4468 states and 7130 transitions. Word has length 268 [2024-10-11 00:00:30,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:30,432 INFO L471 AbstractCegarLoop]: Abstraction has 4468 states and 7130 transitions. [2024-10-11 00:00:30,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand 4468 states and 7130 transitions. [2024-10-11 00:00:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2024-10-11 00:00:30,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:30,441 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:30,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 00:00:30,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:30,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:30,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2019829987, now seen corresponding path program 1 times [2024-10-11 00:00:30,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:30,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149858179] [2024-10-11 00:00:30,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:30,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:00:31,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:31,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149858179] [2024-10-11 00:00:31,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149858179] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 00:00:31,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742305547] [2024-10-11 00:00:31,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:31,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:00:31,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:00:31,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 00:00:31,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 00:00:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:31,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 00:00:31,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:00:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 00:00:32,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:00:32,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742305547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:32,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 00:00:32,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-11 00:00:32,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107423741] [2024-10-11 00:00:32,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:32,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:00:32,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:32,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:00:32,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:00:32,305 INFO L87 Difference]: Start difference. First operand 4468 states and 7130 transitions. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 2 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:37,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:37,646 INFO L93 Difference]: Finished difference Result 10338 states and 18163 transitions. [2024-10-11 00:00:37,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:00:37,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 2 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 520 [2024-10-11 00:00:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:37,671 INFO L225 Difference]: With dead ends: 10338 [2024-10-11 00:00:37,672 INFO L226 Difference]: Without dead ends: 7236 [2024-10-11 00:00:37,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:00:37,680 INFO L432 NwaCegarLoop]: 1207 mSDtfsCounter, 1058 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4578 mSolverCounterSat, 1050 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 5628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1050 IncrementalHoareTripleChecker+Valid, 4578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:37,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 1385 Invalid, 5628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1050 Valid, 4578 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-10-11 00:00:37,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7236 states. [2024-10-11 00:00:37,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7236 to 7235. [2024-10-11 00:00:37,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7235 states, 7234 states have (on average 1.520182471661598) internal successors, (10997), 7234 states have internal predecessors, (10997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7235 states to 7235 states and 10997 transitions. [2024-10-11 00:00:37,824 INFO L78 Accepts]: Start accepts. Automaton has 7235 states and 10997 transitions. Word has length 520 [2024-10-11 00:00:37,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:37,826 INFO L471 AbstractCegarLoop]: Abstraction has 7235 states and 10997 transitions. [2024-10-11 00:00:37,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 2 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 7235 states and 10997 transitions. [2024-10-11 00:00:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2024-10-11 00:00:37,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:37,838 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:37,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 00:00:38,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:00:38,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:38,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:38,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1350752466, now seen corresponding path program 1 times [2024-10-11 00:00:38,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:38,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169129757] [2024-10-11 00:00:38,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:38,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-11 00:00:38,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:38,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169129757] [2024-10-11 00:00:38,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169129757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:38,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:38,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:00:38,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622350060] [2024-10-11 00:00:38,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:38,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:00:38,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:38,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:00:38,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:38,669 INFO L87 Difference]: Start difference. First operand 7235 states and 10997 transitions. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 2 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:43,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:43,942 INFO L93 Difference]: Finished difference Result 15841 states and 24469 transitions. [2024-10-11 00:00:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:00:43,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 2 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 585 [2024-10-11 00:00:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:43,972 INFO L225 Difference]: With dead ends: 15841 [2024-10-11 00:00:43,973 INFO L226 Difference]: Without dead ends: 9972 [2024-10-11 00:00:43,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:43,984 INFO L432 NwaCegarLoop]: 702 mSDtfsCounter, 1396 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3928 mSolverCounterSat, 1671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 5599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1671 IncrementalHoareTripleChecker+Valid, 3928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:43,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 752 Invalid, 5599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1671 Valid, 3928 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-11 00:00:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9972 states. [2024-10-11 00:00:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9972 to 9968. [2024-10-11 00:00:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9968 states, 9967 states have (on average 1.3900872880505668) internal successors, (13855), 9967 states have internal predecessors, (13855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 13855 transitions. [2024-10-11 00:00:44,210 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 13855 transitions. Word has length 585 [2024-10-11 00:00:44,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:44,212 INFO L471 AbstractCegarLoop]: Abstraction has 9968 states and 13855 transitions. [2024-10-11 00:00:44,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 2 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 13855 transitions. [2024-10-11 00:00:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2024-10-11 00:00:44,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:44,220 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:44,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 00:00:44,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:44,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:44,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1356554280, now seen corresponding path program 1 times [2024-10-11 00:00:44,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:44,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025421244] [2024-10-11 00:00:44,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:44,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-10-11 00:00:44,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:44,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025421244] [2024-10-11 00:00:44,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025421244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:44,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:44,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:00:44,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898403737] [2024-10-11 00:00:44,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:44,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:00:44,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:44,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:00:44,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:44,805 INFO L87 Difference]: Start difference. First operand 9968 states and 13855 transitions. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 2 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:50,770 INFO L93 Difference]: Finished difference Result 26950 states and 38549 transitions. [2024-10-11 00:00:50,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:00:50,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 2 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 609 [2024-10-11 00:00:50,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:50,816 INFO L225 Difference]: With dead ends: 26950 [2024-10-11 00:00:50,817 INFO L226 Difference]: Without dead ends: 18348 [2024-10-11 00:00:50,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:50,835 INFO L432 NwaCegarLoop]: 1328 mSDtfsCounter, 1361 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 4186 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 5616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:50,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 1598 Invalid, 5616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4186 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-11 00:00:50,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18348 states. [2024-10-11 00:00:51,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18348 to 18333. [2024-10-11 00:00:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18333 states, 18332 states have (on average 1.2809840715688414) internal successors, (23483), 18332 states have internal predecessors, (23483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:51,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18333 states to 18333 states and 23483 transitions. [2024-10-11 00:00:51,359 INFO L78 Accepts]: Start accepts. Automaton has 18333 states and 23483 transitions. Word has length 609 [2024-10-11 00:00:51,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:51,360 INFO L471 AbstractCegarLoop]: Abstraction has 18333 states and 23483 transitions. [2024-10-11 00:00:51,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 2 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 18333 states and 23483 transitions. [2024-10-11 00:00:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2024-10-11 00:00:51,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:51,365 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:51,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 00:00:51,366 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:51,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1936261687, now seen corresponding path program 1 times [2024-10-11 00:00:51,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:51,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932950480] [2024-10-11 00:00:51,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:51,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:00:52,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:52,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932950480] [2024-10-11 00:00:52,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932950480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:52,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:52,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:00:52,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024505700] [2024-10-11 00:00:52,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:52,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 00:00:52,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:52,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 00:00:52,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:00:52,400 INFO L87 Difference]: Start difference. First operand 18333 states and 23483 transitions. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:01:01,027 INFO L93 Difference]: Finished difference Result 42163 states and 53382 transitions. [2024-10-11 00:01:01,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 00:01:01,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 624 [2024-10-11 00:01:01,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:01:01,079 INFO L225 Difference]: With dead ends: 42163 [2024-10-11 00:01:01,079 INFO L226 Difference]: Without dead ends: 25170 [2024-10-11 00:01:01,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:01:01,101 INFO L432 NwaCegarLoop]: 1656 mSDtfsCounter, 2256 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 11572 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2256 SdHoareTripleChecker+Valid, 2029 SdHoareTripleChecker+Invalid, 11984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 11572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-10-11 00:01:01,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2256 Valid, 2029 Invalid, 11984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 11572 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-10-11 00:01:01,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25170 states. [2024-10-11 00:01:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25170 to 25165. [2024-10-11 00:01:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25165 states, 25164 states have (on average 1.2144333174376092) internal successors, (30560), 25164 states have internal predecessors, (30560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25165 states to 25165 states and 30560 transitions. [2024-10-11 00:01:01,485 INFO L78 Accepts]: Start accepts. Automaton has 25165 states and 30560 transitions. Word has length 624 [2024-10-11 00:01:01,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:01:01,487 INFO L471 AbstractCegarLoop]: Abstraction has 25165 states and 30560 transitions. [2024-10-11 00:01:01,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:01,488 INFO L276 IsEmpty]: Start isEmpty. Operand 25165 states and 30560 transitions. [2024-10-11 00:01:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2024-10-11 00:01:01,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:01:01,493 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:01:01,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 00:01:01,494 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:01:01,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:01:01,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1269686493, now seen corresponding path program 1 times [2024-10-11 00:01:01,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:01:01,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194358071] [2024-10-11 00:01:01,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:01:01,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:01:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:01:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-11 00:01:02,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:01:02,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194358071] [2024-10-11 00:01:02,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194358071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:01:02,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:01:02,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:01:02,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588960955] [2024-10-11 00:01:02,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:01:02,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:01:02,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:01:02,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:01:02,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:01:02,932 INFO L87 Difference]: Start difference. First operand 25165 states and 30560 transitions. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:01:08,502 INFO L93 Difference]: Finished difference Result 47619 states and 60783 transitions. [2024-10-11 00:01:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:01:08,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 669 [2024-10-11 00:01:08,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:01:08,553 INFO L225 Difference]: With dead ends: 47619 [2024-10-11 00:01:08,553 INFO L226 Difference]: Without dead ends: 30652 [2024-10-11 00:01:08,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:01:08,569 INFO L432 NwaCegarLoop]: 686 mSDtfsCounter, 1824 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4018 mSolverCounterSat, 2017 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1824 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 6035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2017 IncrementalHoareTripleChecker+Valid, 4018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-11 00:01:08,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1824 Valid, 770 Invalid, 6035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2017 Valid, 4018 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-11 00:01:08,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30652 states. [2024-10-11 00:01:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30652 to 29280. [2024-10-11 00:01:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29280 states, 29279 states have (on average 1.2541070391748352) internal successors, (36719), 29279 states have internal predecessors, (36719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29280 states to 29280 states and 36719 transitions. [2024-10-11 00:01:08,951 INFO L78 Accepts]: Start accepts. Automaton has 29280 states and 36719 transitions. Word has length 669 [2024-10-11 00:01:08,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:01:08,952 INFO L471 AbstractCegarLoop]: Abstraction has 29280 states and 36719 transitions. [2024-10-11 00:01:08,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:01:08,952 INFO L276 IsEmpty]: Start isEmpty. Operand 29280 states and 36719 transitions. [2024-10-11 00:01:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 885 [2024-10-11 00:01:08,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:01:08,962 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:01:08,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 00:01:08,962 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:01:08,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:01:08,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1238021691, now seen corresponding path program 1 times [2024-10-11 00:01:08,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:01:08,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839670864] [2024-10-11 00:01:08,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:01:08,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:01:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:01:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-10-11 00:01:09,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:01:09,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839670864] [2024-10-11 00:01:09,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839670864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:01:09,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:01:09,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:01:09,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81463241] [2024-10-11 00:01:09,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:01:09,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:01:09,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:01:09,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:01:09,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:01:09,619 INFO L87 Difference]: Start difference. First operand 29280 states and 36719 transitions. Second operand has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)