./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d4091e99c6c703f11d6d31e8eaec6c84e6dd277464e5b390742bbd7adf0ea708 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:49:13,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:49:13,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:49:13,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:49:13,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:49:13,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:49:13,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:49:13,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:49:13,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:49:13,905 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:49:13,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:49:13,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:49:13,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:49:13,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:49:13,907 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:49:13,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:49:13,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:49:13,911 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:49:13,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:49:13,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:49:13,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:49:13,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:49:13,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:49:13,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:49:13,913 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:49:13,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:49:13,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:49:13,914 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:49:13,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:49:13,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:49:13,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:49:13,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:49:13,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:49:13,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:49:13,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:49:13,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:49:13,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:49:13,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:49:13,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:49:13,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:49:13,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:49:13,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:49:13,917 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/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/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 -> d4091e99c6c703f11d6d31e8eaec6c84e6dd277464e5b390742bbd7adf0ea708 [2024-11-08 15:49:14,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:49:14,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:49:14,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:49:14,135 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:49:14,135 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:49:14,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-11-08 15:49:15,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:49:15,620 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:49:15,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-11-08 15:49:15,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7023786e6/4a5d0fbbbdcd4a0ebcf895d4d428c8d8/FLAG7b4e163a6 [2024-11-08 15:49:15,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7023786e6/4a5d0fbbbdcd4a0ebcf895d4d428c8d8 [2024-11-08 15:49:15,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:49:15,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:49:15,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:49:15,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:49:15,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:49:15,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:49:15" (1/1) ... [2024-11-08 15:49:15,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bca1f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:15, skipping insertion in model container [2024-11-08 15:49:15,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:49:15" (1/1) ... [2024-11-08 15:49:16,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:49:16,306 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[14145,14158] [2024-11-08 15:49:16,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:49:16,371 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:49:16,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[14145,14158] [2024-11-08 15:49:16,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:49:16,496 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:49:16,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:16 WrapperNode [2024-11-08 15:49:16,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:49:16,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:49:16,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:49:16,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:49:16,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:16" (1/1) ... [2024-11-08 15:49:16,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:16" (1/1) ... [2024-11-08 15:49:16,563 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1222 [2024-11-08 15:49:16,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:49:16,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:49:16,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:49:16,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:49:16,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:16" (1/1) ... [2024-11-08 15:49:16,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:16" (1/1) ... [2024-11-08 15:49:16,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:16" (1/1) ... [2024-11-08 15:49:16,624 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-11-08 15:49:16,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:16" (1/1) ... [2024-11-08 15:49:16,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:16" (1/1) ... [2024-11-08 15:49:16,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:16" (1/1) ... [2024-11-08 15:49:16,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:16" (1/1) ... [2024-11-08 15:49:16,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:16" (1/1) ... [2024-11-08 15:49:16,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:16" (1/1) ... [2024-11-08 15:49:16,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:49:16,692 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:49:16,692 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:49:16,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:49:16,694 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:16" (1/1) ... [2024-11-08 15:49:16,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:49:16,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:49:16,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:49:16,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:49:16,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:49:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:49:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:49:16,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:49:16,918 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:49:16,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:49:17,871 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-11-08 15:49:17,871 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:49:17,898 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:49:17,898 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:49:17,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:49:17 BoogieIcfgContainer [2024-11-08 15:49:17,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:49:17,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:49:17,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:49:17,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:49:17,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:49:15" (1/3) ... [2024-11-08 15:49:17,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476a3ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:49:17, skipping insertion in model container [2024-11-08 15:49:17,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:49:16" (2/3) ... [2024-11-08 15:49:17,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476a3ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:49:17, skipping insertion in model container [2024-11-08 15:49:17,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:49:17" (3/3) ... [2024-11-08 15:49:17,908 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-11-08 15:49:17,925 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:49:17,925 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:49:17,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:49:18,003 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;@48a50a07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:49:18,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:49:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 294 states, 292 states have (on average 1.7945205479452055) internal successors, (524), 293 states have internal predecessors, (524), 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-11-08 15:49:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 15:49:18,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:18,024 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:18,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:18,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:18,030 INFO L85 PathProgramCache]: Analyzing trace with hash -37487086, now seen corresponding path program 1 times [2024-11-08 15:49:18,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:18,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385331620] [2024-11-08 15:49:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:18,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:18,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:18,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385331620] [2024-11-08 15:49:18,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385331620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:18,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:18,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:49:18,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351133923] [2024-11-08 15:49:18,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:18,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:49:18,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:18,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:49:18,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:18,633 INFO L87 Difference]: Start difference. First operand has 294 states, 292 states have (on average 1.7945205479452055) internal successors, (524), 293 states have internal predecessors, (524), 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 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-11-08 15:49:18,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:18,763 INFO L93 Difference]: Finished difference Result 590 states and 1044 transitions. [2024-11-08 15:49:18,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:49:18,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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 141 [2024-11-08 15:49:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:18,781 INFO L225 Difference]: With dead ends: 590 [2024-11-08 15:49:18,781 INFO L226 Difference]: Without dead ends: 473 [2024-11-08 15:49:18,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-08 15:49:18,787 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 347 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:18,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 873 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:49:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-08 15:49:18,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 471. [2024-11-08 15:49:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.4936170212765958) internal successors, (702), 470 states have internal predecessors, (702), 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-11-08 15:49:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 702 transitions. [2024-11-08 15:49:18,842 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 702 transitions. Word has length 141 [2024-11-08 15:49:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:18,843 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 702 transitions. [2024-11-08 15:49:18,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-11-08 15:49:18,847 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 702 transitions. [2024-11-08 15:49:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 15:49:18,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:18,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:18,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:49:18,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:18,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:18,852 INFO L85 PathProgramCache]: Analyzing trace with hash -106858572, now seen corresponding path program 1 times [2024-11-08 15:49:18,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:18,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330704781] [2024-11-08 15:49:18,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:18,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:19,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:19,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330704781] [2024-11-08 15:49:19,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330704781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:19,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:19,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:49:19,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709490698] [2024-11-08 15:49:19,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:19,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:49:19,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:19,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:49:19,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:19,389 INFO L87 Difference]: Start difference. First operand 471 states and 702 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-11-08 15:49:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:19,478 INFO L93 Difference]: Finished difference Result 1808 states and 2680 transitions. [2024-11-08 15:49:19,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:49:19,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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 141 [2024-11-08 15:49:19,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:19,485 INFO L225 Difference]: With dead ends: 1808 [2024-11-08 15:49:19,485 INFO L226 Difference]: Without dead ends: 1362 [2024-11-08 15:49:19,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-08 15:49:19,490 INFO L432 NwaCegarLoop]: 735 mSDtfsCounter, 761 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:19,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1504 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:49:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2024-11-08 15:49:19,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 916. [2024-11-08 15:49:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 915 states have (on average 1.478688524590164) internal successors, (1353), 915 states have internal predecessors, (1353), 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-11-08 15:49:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1353 transitions. [2024-11-08 15:49:19,533 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1353 transitions. Word has length 141 [2024-11-08 15:49:19,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:19,533 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1353 transitions. [2024-11-08 15:49:19,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-11-08 15:49:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1353 transitions. [2024-11-08 15:49:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 15:49:19,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:19,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:19,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:49:19,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:19,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:19,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1746789024, now seen corresponding path program 1 times [2024-11-08 15:49:19,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:19,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25069549] [2024-11-08 15:49:19,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:19,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:19,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25069549] [2024-11-08 15:49:19,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25069549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:19,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:19,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:49:19,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953951133] [2024-11-08 15:49:19,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:19,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:49:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:19,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:49:19,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:19,649 INFO L87 Difference]: Start difference. First operand 916 states and 1353 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-11-08 15:49:19,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:19,666 INFO L93 Difference]: Finished difference Result 1806 states and 2662 transitions. [2024-11-08 15:49:19,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:49:19,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 142 [2024-11-08 15:49:19,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:19,669 INFO L225 Difference]: With dead ends: 1806 [2024-11-08 15:49:19,670 INFO L226 Difference]: Without dead ends: 918 [2024-11-08 15:49:19,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-08 15:49:19,672 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 0 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:19,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 848 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:19,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-08 15:49:19,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2024-11-08 15:49:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 917 states have (on average 1.4776444929116686) internal successors, (1355), 917 states have internal predecessors, (1355), 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-11-08 15:49:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1355 transitions. [2024-11-08 15:49:19,696 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1355 transitions. Word has length 142 [2024-11-08 15:49:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:19,696 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1355 transitions. [2024-11-08 15:49:19,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-11-08 15:49:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1355 transitions. [2024-11-08 15:49:19,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 15:49:19,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:19,699 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:19,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:49:19,699 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:19,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:19,700 INFO L85 PathProgramCache]: Analyzing trace with hash 463094692, now seen corresponding path program 1 times [2024-11-08 15:49:19,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:19,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780325112] [2024-11-08 15:49:19,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:19,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:19,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:19,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780325112] [2024-11-08 15:49:19,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780325112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:19,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:19,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:49:19,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044897050] [2024-11-08 15:49:19,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:19,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:49:19,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:19,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:49:19,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:19,821 INFO L87 Difference]: Start difference. First operand 918 states and 1355 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-11-08 15:49:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:19,864 INFO L93 Difference]: Finished difference Result 2514 states and 3724 transitions. [2024-11-08 15:49:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:49:19,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 143 [2024-11-08 15:49:19,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:19,870 INFO L225 Difference]: With dead ends: 2514 [2024-11-08 15:49:19,871 INFO L226 Difference]: Without dead ends: 1774 [2024-11-08 15:49:19,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-08 15:49:19,875 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 354 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:19,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1153 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:19,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2024-11-08 15:49:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1772. [2024-11-08 15:49:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1771 states have (on average 1.461321287408244) internal successors, (2588), 1771 states have internal predecessors, (2588), 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-11-08 15:49:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2588 transitions. [2024-11-08 15:49:19,913 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2588 transitions. Word has length 143 [2024-11-08 15:49:19,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:19,913 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2588 transitions. [2024-11-08 15:49:19,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-11-08 15:49:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2588 transitions. [2024-11-08 15:49:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 15:49:19,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:19,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:19,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:49:19,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:19,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:19,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2076257255, now seen corresponding path program 1 times [2024-11-08 15:49:19,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:19,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300276560] [2024-11-08 15:49:19,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:19,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:20,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:20,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300276560] [2024-11-08 15:49:20,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300276560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:20,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:20,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:49:20,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617928713] [2024-11-08 15:49:20,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:20,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:49:20,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:20,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:49:20,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:20,354 INFO L87 Difference]: Start difference. First operand 1772 states and 2588 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-11-08 15:49:20,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:20,379 INFO L93 Difference]: Finished difference Result 2955 states and 4329 transitions. [2024-11-08 15:49:20,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:49:20,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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 143 [2024-11-08 15:49:20,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:20,384 INFO L225 Difference]: With dead ends: 2955 [2024-11-08 15:49:20,385 INFO L226 Difference]: Without dead ends: 1351 [2024-11-08 15:49:20,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:20,388 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 25 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:20,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1357 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:20,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2024-11-08 15:49:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1351. [2024-11-08 15:49:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1350 states have (on average 1.4555555555555555) internal successors, (1965), 1350 states have internal predecessors, (1965), 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-11-08 15:49:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1965 transitions. [2024-11-08 15:49:20,411 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1965 transitions. Word has length 143 [2024-11-08 15:49:20,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:20,412 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 1965 transitions. [2024-11-08 15:49:20,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-11-08 15:49:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1965 transitions. [2024-11-08 15:49:20,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 15:49:20,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:20,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:20,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:49:20,415 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:20,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:20,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1549951936, now seen corresponding path program 1 times [2024-11-08 15:49:20,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:20,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410254928] [2024-11-08 15:49:20,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:20,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:20,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:20,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410254928] [2024-11-08 15:49:20,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410254928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:20,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:20,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:49:20,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897717003] [2024-11-08 15:49:20,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:20,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:49:20,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:20,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:49:20,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:49:20,589 INFO L87 Difference]: Start difference. First operand 1351 states and 1965 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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-11-08 15:49:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:20,731 INFO L93 Difference]: Finished difference Result 2535 states and 3714 transitions. [2024-11-08 15:49:20,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:49:20,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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 146 [2024-11-08 15:49:20,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:20,737 INFO L225 Difference]: With dead ends: 2535 [2024-11-08 15:49:20,737 INFO L226 Difference]: Without dead ends: 1351 [2024-11-08 15:49:20,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:49:20,740 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 1106 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:20,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 415 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:49:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2024-11-08 15:49:20,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1351. [2024-11-08 15:49:20,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1350 states have (on average 1.4444444444444444) internal successors, (1950), 1350 states have internal predecessors, (1950), 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-11-08 15:49:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1950 transitions. [2024-11-08 15:49:20,768 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1950 transitions. Word has length 146 [2024-11-08 15:49:20,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:20,769 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 1950 transitions. [2024-11-08 15:49:20,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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-11-08 15:49:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1950 transitions. [2024-11-08 15:49:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 15:49:20,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:20,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:20,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:49:20,772 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:20,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:20,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1026467579, now seen corresponding path program 1 times [2024-11-08 15:49:20,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:20,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897726226] [2024-11-08 15:49:20,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:20,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:21,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:21,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:21,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897726226] [2024-11-08 15:49:21,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897726226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:21,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:21,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:49:21,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567108280] [2024-11-08 15:49:21,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:21,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:49:21,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:21,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:49:21,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:21,117 INFO L87 Difference]: Start difference. First operand 1351 states and 1950 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-11-08 15:49:21,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:21,209 INFO L93 Difference]: Finished difference Result 2929 states and 4373 transitions. [2024-11-08 15:49:21,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:49:21,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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 146 [2024-11-08 15:49:21,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:21,217 INFO L225 Difference]: With dead ends: 2929 [2024-11-08 15:49:21,217 INFO L226 Difference]: Without dead ends: 2359 [2024-11-08 15:49:21,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-08 15:49:21,222 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 721 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:21,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 766 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:49:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2024-11-08 15:49:21,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2357. [2024-11-08 15:49:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2356 states have (on average 1.4584040747028864) internal successors, (3436), 2356 states have internal predecessors, (3436), 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-11-08 15:49:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3436 transitions. [2024-11-08 15:49:21,269 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3436 transitions. Word has length 146 [2024-11-08 15:49:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:21,270 INFO L471 AbstractCegarLoop]: Abstraction has 2357 states and 3436 transitions. [2024-11-08 15:49:21,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-11-08 15:49:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3436 transitions. [2024-11-08 15:49:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 15:49:21,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:21,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:21,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:49:21,274 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:21,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:21,274 INFO L85 PathProgramCache]: Analyzing trace with hash -981368772, now seen corresponding path program 1 times [2024-11-08 15:49:21,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:21,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666208163] [2024-11-08 15:49:21,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:21,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:21,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:21,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666208163] [2024-11-08 15:49:21,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666208163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:21,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:21,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:49:21,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306432152] [2024-11-08 15:49:21,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:21,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:49:21,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:21,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:49:21,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:21,561 INFO L87 Difference]: Start difference. First operand 2357 states and 3436 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-11-08 15:49:21,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:21,645 INFO L93 Difference]: Finished difference Result 6107 states and 8896 transitions. [2024-11-08 15:49:21,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:49:21,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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 146 [2024-11-08 15:49:21,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:21,656 INFO L225 Difference]: With dead ends: 6107 [2024-11-08 15:49:21,656 INFO L226 Difference]: Without dead ends: 3787 [2024-11-08 15:49:21,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-08 15:49:21,660 INFO L432 NwaCegarLoop]: 732 mSDtfsCounter, 721 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:21,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1112 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:49:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2024-11-08 15:49:21,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3785. [2024-11-08 15:49:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 3784 states have (on average 1.444767441860465) internal successors, (5467), 3784 states have internal predecessors, (5467), 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-11-08 15:49:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 5467 transitions. [2024-11-08 15:49:21,731 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 5467 transitions. Word has length 146 [2024-11-08 15:49:21,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:21,731 INFO L471 AbstractCegarLoop]: Abstraction has 3785 states and 5467 transitions. [2024-11-08 15:49:21,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-11-08 15:49:21,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 5467 transitions. [2024-11-08 15:49:21,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 15:49:21,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:21,735 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:21,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:49:21,736 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:21,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:21,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2132081647, now seen corresponding path program 1 times [2024-11-08 15:49:21,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:21,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849305678] [2024-11-08 15:49:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:21,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:21,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:21,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849305678] [2024-11-08 15:49:21,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849305678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:21,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:21,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:49:21,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697004347] [2024-11-08 15:49:21,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:21,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:49:21,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:21,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:49:21,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:21,800 INFO L87 Difference]: Start difference. First operand 3785 states and 5467 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-11-08 15:49:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:21,830 INFO L93 Difference]: Finished difference Result 8177 states and 11816 transitions. [2024-11-08 15:49:21,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:49:21,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 147 [2024-11-08 15:49:21,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:21,847 INFO L225 Difference]: With dead ends: 8177 [2024-11-08 15:49:21,848 INFO L226 Difference]: Without dead ends: 5267 [2024-11-08 15:49:21,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-08 15:49:21,853 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 396 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:21,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1165 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:21,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2024-11-08 15:49:21,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 3785. [2024-11-08 15:49:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 3784 states have (on average 1.4445031712473573) internal successors, (5466), 3784 states have internal predecessors, (5466), 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-11-08 15:49:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 5466 transitions. [2024-11-08 15:49:21,930 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 5466 transitions. Word has length 147 [2024-11-08 15:49:21,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:21,931 INFO L471 AbstractCegarLoop]: Abstraction has 3785 states and 5466 transitions. [2024-11-08 15:49:21,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-11-08 15:49:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 5466 transitions. [2024-11-08 15:49:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 15:49:21,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:21,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:21,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:49:21,936 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:21,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:21,940 INFO L85 PathProgramCache]: Analyzing trace with hash -850172162, now seen corresponding path program 1 times [2024-11-08 15:49:21,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:21,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579561518] [2024-11-08 15:49:21,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:21,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:22,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:22,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579561518] [2024-11-08 15:49:22,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579561518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:22,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:22,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:49:22,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687459991] [2024-11-08 15:49:22,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:22,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:49:22,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:22,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:49:22,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:22,020 INFO L87 Difference]: Start difference. First operand 3785 states and 5466 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-11-08 15:49:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:22,115 INFO L93 Difference]: Finished difference Result 10679 states and 15439 transitions. [2024-11-08 15:49:22,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:49:22,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 148 [2024-11-08 15:49:22,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:22,135 INFO L225 Difference]: With dead ends: 10679 [2024-11-08 15:49:22,135 INFO L226 Difference]: Without dead ends: 7250 [2024-11-08 15:49:22,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-08 15:49:22,141 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 344 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:22,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1167 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:22,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7250 states. [2024-11-08 15:49:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7250 to 7248. [2024-11-08 15:49:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7248 states, 7247 states have (on average 1.4256933903684283) internal successors, (10332), 7247 states have internal predecessors, (10332), 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-11-08 15:49:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7248 states to 7248 states and 10332 transitions. [2024-11-08 15:49:22,286 INFO L78 Accepts]: Start accepts. Automaton has 7248 states and 10332 transitions. Word has length 148 [2024-11-08 15:49:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:22,286 INFO L471 AbstractCegarLoop]: Abstraction has 7248 states and 10332 transitions. [2024-11-08 15:49:22,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-11-08 15:49:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 7248 states and 10332 transitions. [2024-11-08 15:49:22,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 15:49:22,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:22,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:22,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:49:22,294 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:22,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:22,294 INFO L85 PathProgramCache]: Analyzing trace with hash 486667227, now seen corresponding path program 1 times [2024-11-08 15:49:22,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:22,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384180345] [2024-11-08 15:49:22,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:22,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:22,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:22,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384180345] [2024-11-08 15:49:22,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384180345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:22,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:22,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:49:22,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080960332] [2024-11-08 15:49:22,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:22,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:49:22,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:22,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:49:22,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:22,669 INFO L87 Difference]: Start difference. First operand 7248 states and 10332 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-11-08 15:49:22,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:22,716 INFO L93 Difference]: Finished difference Result 12934 states and 18441 transitions. [2024-11-08 15:49:22,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:49:22,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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 148 [2024-11-08 15:49:22,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:22,733 INFO L225 Difference]: With dead ends: 12934 [2024-11-08 15:49:22,733 INFO L226 Difference]: Without dead ends: 5896 [2024-11-08 15:49:22,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:22,742 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 20 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:22,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1327 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5896 states. [2024-11-08 15:49:22,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5896 to 5896. [2024-11-08 15:49:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5896 states, 5895 states have (on average 1.4195080576759966) internal successors, (8368), 5895 states have internal predecessors, (8368), 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-11-08 15:49:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5896 states to 5896 states and 8368 transitions. [2024-11-08 15:49:22,846 INFO L78 Accepts]: Start accepts. Automaton has 5896 states and 8368 transitions. Word has length 148 [2024-11-08 15:49:22,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:22,846 INFO L471 AbstractCegarLoop]: Abstraction has 5896 states and 8368 transitions. [2024-11-08 15:49:22,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-11-08 15:49:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 5896 states and 8368 transitions. [2024-11-08 15:49:22,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 15:49:22,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:22,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:22,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:49:22,857 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:22,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:22,857 INFO L85 PathProgramCache]: Analyzing trace with hash -236565050, now seen corresponding path program 1 times [2024-11-08 15:49:22,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:22,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48117634] [2024-11-08 15:49:22,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:22,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:23,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:23,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:23,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48117634] [2024-11-08 15:49:23,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48117634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:23,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:23,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:49:23,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394297691] [2024-11-08 15:49:23,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:23,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:49:23,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:23,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:49:23,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:49:23,105 INFO L87 Difference]: Start difference. First operand 5896 states and 8368 transitions. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 7 states have internal predecessors, (151), 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-11-08 15:49:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:23,553 INFO L93 Difference]: Finished difference Result 19473 states and 28946 transitions. [2024-11-08 15:49:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:49:23,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 7 states have internal predecessors, (151), 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 151 [2024-11-08 15:49:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:23,577 INFO L225 Difference]: With dead ends: 19473 [2024-11-08 15:49:23,577 INFO L226 Difference]: Without dead ends: 14018 [2024-11-08 15:49:23,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:49:23,588 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 4531 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4531 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:23,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4531 Valid, 1131 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:49:23,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14018 states. [2024-11-08 15:49:23,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14018 to 8636. [2024-11-08 15:49:23,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8636 states, 8635 states have (on average 1.446670526925304) internal successors, (12492), 8635 states have internal predecessors, (12492), 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-11-08 15:49:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8636 states to 8636 states and 12492 transitions. [2024-11-08 15:49:23,788 INFO L78 Accepts]: Start accepts. Automaton has 8636 states and 12492 transitions. Word has length 151 [2024-11-08 15:49:23,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:23,789 INFO L471 AbstractCegarLoop]: Abstraction has 8636 states and 12492 transitions. [2024-11-08 15:49:23,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 7 states have internal predecessors, (151), 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-11-08 15:49:23,789 INFO L276 IsEmpty]: Start isEmpty. Operand 8636 states and 12492 transitions. [2024-11-08 15:49:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 15:49:23,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:23,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:23,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:49:23,795 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:23,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:23,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1560885536, now seen corresponding path program 1 times [2024-11-08 15:49:23,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:23,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946645096] [2024-11-08 15:49:23,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:23,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:24,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:24,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946645096] [2024-11-08 15:49:24,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946645096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:24,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:24,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:49:24,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354332304] [2024-11-08 15:49:24,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:24,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:49:24,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:24,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:49:24,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:24,084 INFO L87 Difference]: Start difference. First operand 8636 states and 12492 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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-11-08 15:49:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:24,212 INFO L93 Difference]: Finished difference Result 32949 states and 47490 transitions. [2024-11-08 15:49:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:49:24,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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 151 [2024-11-08 15:49:24,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:24,253 INFO L225 Difference]: With dead ends: 32949 [2024-11-08 15:49:24,254 INFO L226 Difference]: Without dead ends: 24378 [2024-11-08 15:49:24,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-08 15:49:24,272 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 753 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:24,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1395 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:49:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24378 states. [2024-11-08 15:49:24,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24378 to 16511. [2024-11-08 15:49:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16511 states, 16510 states have (on average 1.4271956390066627) internal successors, (23563), 16510 states have internal predecessors, (23563), 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-11-08 15:49:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16511 states to 16511 states and 23563 transitions. [2024-11-08 15:49:24,661 INFO L78 Accepts]: Start accepts. Automaton has 16511 states and 23563 transitions. Word has length 151 [2024-11-08 15:49:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:24,661 INFO L471 AbstractCegarLoop]: Abstraction has 16511 states and 23563 transitions. [2024-11-08 15:49:24,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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-11-08 15:49:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 16511 states and 23563 transitions. [2024-11-08 15:49:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 15:49:24,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:24,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:24,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:49:24,673 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:24,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:24,673 INFO L85 PathProgramCache]: Analyzing trace with hash 633734794, now seen corresponding path program 1 times [2024-11-08 15:49:24,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:24,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201706823] [2024-11-08 15:49:24,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:24,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:24,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:24,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201706823] [2024-11-08 15:49:24,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201706823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:24,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:24,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:49:24,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806095011] [2024-11-08 15:49:24,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:24,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:49:24,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:24,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:49:24,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:24,737 INFO L87 Difference]: Start difference. First operand 16511 states and 23563 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-11-08 15:49:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:24,820 INFO L93 Difference]: Finished difference Result 32911 states and 46974 transitions. [2024-11-08 15:49:24,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:49:24,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 152 [2024-11-08 15:49:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:24,850 INFO L225 Difference]: With dead ends: 32911 [2024-11-08 15:49:24,850 INFO L226 Difference]: Without dead ends: 16519 [2024-11-08 15:49:24,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-08 15:49:24,872 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 0 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:24,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 818 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:24,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16519 states. [2024-11-08 15:49:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16519 to 16519. [2024-11-08 15:49:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16519 states, 16518 states have (on average 1.426988739556847) internal successors, (23571), 16518 states have internal predecessors, (23571), 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-11-08 15:49:25,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16519 states to 16519 states and 23571 transitions. [2024-11-08 15:49:25,355 INFO L78 Accepts]: Start accepts. Automaton has 16519 states and 23571 transitions. Word has length 152 [2024-11-08 15:49:25,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:25,355 INFO L471 AbstractCegarLoop]: Abstraction has 16519 states and 23571 transitions. [2024-11-08 15:49:25,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-11-08 15:49:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 16519 states and 23571 transitions. [2024-11-08 15:49:25,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 15:49:25,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:25,365 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:25,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:49:25,365 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:25,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:25,365 INFO L85 PathProgramCache]: Analyzing trace with hash 76406335, now seen corresponding path program 1 times [2024-11-08 15:49:25,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:25,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934172060] [2024-11-08 15:49:25,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:25,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:25,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:25,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934172060] [2024-11-08 15:49:25,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934172060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:25,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:25,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:49:25,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154908263] [2024-11-08 15:49:25,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:25,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:49:25,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:25,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:49:25,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:25,714 INFO L87 Difference]: Start difference. First operand 16519 states and 23571 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-11-08 15:49:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:25,829 INFO L93 Difference]: Finished difference Result 32989 states and 47070 transitions. [2024-11-08 15:49:25,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:49:25,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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 153 [2024-11-08 15:49:25,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:25,855 INFO L225 Difference]: With dead ends: 32989 [2024-11-08 15:49:25,855 INFO L226 Difference]: Without dead ends: 16511 [2024-11-08 15:49:25,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:25,874 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 14 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:25,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1286 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:25,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16511 states. [2024-11-08 15:49:26,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16511 to 16511. [2024-11-08 15:49:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16511 states, 16510 states have (on average 1.4267110841913992) internal successors, (23555), 16510 states have internal predecessors, (23555), 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-11-08 15:49:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16511 states to 16511 states and 23555 transitions. [2024-11-08 15:49:26,087 INFO L78 Accepts]: Start accepts. Automaton has 16511 states and 23555 transitions. Word has length 153 [2024-11-08 15:49:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:26,087 INFO L471 AbstractCegarLoop]: Abstraction has 16511 states and 23555 transitions. [2024-11-08 15:49:26,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-11-08 15:49:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 16511 states and 23555 transitions. [2024-11-08 15:49:26,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 15:49:26,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:26,097 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:26,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 15:49:26,097 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:26,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:26,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1107932436, now seen corresponding path program 1 times [2024-11-08 15:49:26,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:26,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209597357] [2024-11-08 15:49:26,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:26,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:26,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:26,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209597357] [2024-11-08 15:49:26,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209597357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:26,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:26,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:49:26,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280355759] [2024-11-08 15:49:26,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:26,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:49:26,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:26,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:49:26,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:26,189 INFO L87 Difference]: Start difference. First operand 16511 states and 23555 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-11-08 15:49:26,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:26,383 INFO L93 Difference]: Finished difference Result 40326 states and 57648 transitions. [2024-11-08 15:49:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:49:26,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 153 [2024-11-08 15:49:26,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:26,423 INFO L225 Difference]: With dead ends: 40326 [2024-11-08 15:49:26,423 INFO L226 Difference]: Without dead ends: 24622 [2024-11-08 15:49:26,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-08 15:49:26,437 INFO L432 NwaCegarLoop]: 730 mSDtfsCounter, 329 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:26,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1096 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:49:26,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24622 states. [2024-11-08 15:49:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24622 to 24620. [2024-11-08 15:49:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24620 states, 24619 states have (on average 1.4080994353954264) internal successors, (34666), 24619 states have internal predecessors, (34666), 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-11-08 15:49:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24620 states to 24620 states and 34666 transitions. [2024-11-08 15:49:26,736 INFO L78 Accepts]: Start accepts. Automaton has 24620 states and 34666 transitions. Word has length 153 [2024-11-08 15:49:26,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:26,736 INFO L471 AbstractCegarLoop]: Abstraction has 24620 states and 34666 transitions. [2024-11-08 15:49:26,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-11-08 15:49:26,737 INFO L276 IsEmpty]: Start isEmpty. Operand 24620 states and 34666 transitions. [2024-11-08 15:49:26,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 15:49:26,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:26,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:26,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:49:26,751 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:26,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:26,751 INFO L85 PathProgramCache]: Analyzing trace with hash -95330796, now seen corresponding path program 1 times [2024-11-08 15:49:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:26,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164874452] [2024-11-08 15:49:26,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:26,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:27,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:27,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164874452] [2024-11-08 15:49:27,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164874452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:27,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:27,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:49:27,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249233842] [2024-11-08 15:49:27,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:27,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:49:27,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:27,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:49:27,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:27,162 INFO L87 Difference]: Start difference. First operand 24620 states and 34666 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-11-08 15:49:27,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:27,296 INFO L93 Difference]: Finished difference Result 40853 states and 57847 transitions. [2024-11-08 15:49:27,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:49:27,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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 159 [2024-11-08 15:49:27,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:27,331 INFO L225 Difference]: With dead ends: 40853 [2024-11-08 15:49:27,332 INFO L226 Difference]: Without dead ends: 21771 [2024-11-08 15:49:27,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-08 15:49:27,351 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 676 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:27,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1035 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21771 states. [2024-11-08 15:49:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21771 to 21493. [2024-11-08 15:49:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21493 states, 21492 states have (on average 1.4052205471803463) internal successors, (30201), 21492 states have internal predecessors, (30201), 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-11-08 15:49:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21493 states to 21493 states and 30201 transitions. [2024-11-08 15:49:27,713 INFO L78 Accepts]: Start accepts. Automaton has 21493 states and 30201 transitions. Word has length 159 [2024-11-08 15:49:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:27,713 INFO L471 AbstractCegarLoop]: Abstraction has 21493 states and 30201 transitions. [2024-11-08 15:49:27,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-11-08 15:49:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 21493 states and 30201 transitions. [2024-11-08 15:49:27,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 15:49:27,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:27,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:27,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 15:49:27,728 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:27,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:27,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2124015325, now seen corresponding path program 1 times [2024-11-08 15:49:27,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:27,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017231114] [2024-11-08 15:49:27,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:27,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:27,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:27,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:27,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017231114] [2024-11-08 15:49:27,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017231114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:27,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:27,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:49:27,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189853948] [2024-11-08 15:49:27,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:27,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:49:27,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:27,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:49:27,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:27,819 INFO L87 Difference]: Start difference. First operand 21493 states and 30201 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-11-08 15:49:27,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:27,941 INFO L93 Difference]: Finished difference Result 47542 states and 66897 transitions. [2024-11-08 15:49:27,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:49:27,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 160 [2024-11-08 15:49:27,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:27,993 INFO L225 Difference]: With dead ends: 47542 [2024-11-08 15:49:27,994 INFO L226 Difference]: Without dead ends: 31274 [2024-11-08 15:49:28,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-08 15:49:28,014 INFO L432 NwaCegarLoop]: 646 mSDtfsCounter, 374 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:28,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1050 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31274 states. [2024-11-08 15:49:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31274 to 21493. [2024-11-08 15:49:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21493 states, 21492 states have (on average 1.405034431416341) internal successors, (30197), 21492 states have internal predecessors, (30197), 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-11-08 15:49:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21493 states to 21493 states and 30197 transitions. [2024-11-08 15:49:28,511 INFO L78 Accepts]: Start accepts. Automaton has 21493 states and 30197 transitions. Word has length 160 [2024-11-08 15:49:28,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:28,511 INFO L471 AbstractCegarLoop]: Abstraction has 21493 states and 30197 transitions. [2024-11-08 15:49:28,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-11-08 15:49:28,512 INFO L276 IsEmpty]: Start isEmpty. Operand 21493 states and 30197 transitions. [2024-11-08 15:49:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 15:49:28,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:28,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:28,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 15:49:28,526 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:28,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:28,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1413355346, now seen corresponding path program 1 times [2024-11-08 15:49:28,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:28,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619190147] [2024-11-08 15:49:28,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:28,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:28,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:28,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619190147] [2024-11-08 15:49:28,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619190147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:28,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:28,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:49:28,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921002651] [2024-11-08 15:49:28,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:28,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:49:28,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:28,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:49:28,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:28,839 INFO L87 Difference]: Start difference. First operand 21493 states and 30197 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-11-08 15:49:28,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:29,000 INFO L93 Difference]: Finished difference Result 45683 states and 64456 transitions. [2024-11-08 15:49:29,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:49:29,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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 161 [2024-11-08 15:49:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:29,046 INFO L225 Difference]: With dead ends: 45683 [2024-11-08 15:49:29,046 INFO L226 Difference]: Without dead ends: 29950 [2024-11-08 15:49:29,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-08 15:49:29,064 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 751 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:29,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1357 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29950 states. [2024-11-08 15:49:29,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29950 to 21623. [2024-11-08 15:49:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21623 states, 21622 states have (on average 1.403431689945426) internal successors, (30345), 21622 states have internal predecessors, (30345), 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-11-08 15:49:29,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21623 states to 21623 states and 30345 transitions. [2024-11-08 15:49:29,445 INFO L78 Accepts]: Start accepts. Automaton has 21623 states and 30345 transitions. Word has length 161 [2024-11-08 15:49:29,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:29,445 INFO L471 AbstractCegarLoop]: Abstraction has 21623 states and 30345 transitions. [2024-11-08 15:49:29,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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-11-08 15:49:29,445 INFO L276 IsEmpty]: Start isEmpty. Operand 21623 states and 30345 transitions. [2024-11-08 15:49:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 15:49:29,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:29,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:29,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 15:49:29,453 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:29,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:29,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1608117858, now seen corresponding path program 1 times [2024-11-08 15:49:29,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:29,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177270190] [2024-11-08 15:49:29,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:29,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:29,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:29,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177270190] [2024-11-08 15:49:29,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177270190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:29,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:29,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:49:29,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806710696] [2024-11-08 15:49:29,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:29,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:49:29,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:29,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:49:29,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:29,516 INFO L87 Difference]: Start difference. First operand 21623 states and 30345 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-11-08 15:49:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:29,594 INFO L93 Difference]: Finished difference Result 42938 states and 60293 transitions. [2024-11-08 15:49:29,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:49:29,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 162 [2024-11-08 15:49:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:29,624 INFO L225 Difference]: With dead ends: 42938 [2024-11-08 15:49:29,624 INFO L226 Difference]: Without dead ends: 21651 [2024-11-08 15:49:29,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-08 15:49:29,642 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 0 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:29,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 814 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21651 states. [2024-11-08 15:49:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21651 to 21651. [2024-11-08 15:49:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21651 states, 21650 states have (on average 1.4029099307159354) internal successors, (30373), 21650 states have internal predecessors, (30373), 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-11-08 15:49:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21651 states to 21651 states and 30373 transitions. [2024-11-08 15:49:29,919 INFO L78 Accepts]: Start accepts. Automaton has 21651 states and 30373 transitions. Word has length 162 [2024-11-08 15:49:29,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:29,919 INFO L471 AbstractCegarLoop]: Abstraction has 21651 states and 30373 transitions. [2024-11-08 15:49:29,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-11-08 15:49:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 21651 states and 30373 transitions. [2024-11-08 15:49:29,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 15:49:29,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:29,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:29,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 15:49:29,929 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:29,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1976932778, now seen corresponding path program 1 times [2024-11-08 15:49:29,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:29,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588910883] [2024-11-08 15:49:29,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:29,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:30,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:30,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:30,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588910883] [2024-11-08 15:49:30,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588910883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:30,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:30,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:49:30,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769436297] [2024-11-08 15:49:30,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:30,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:49:30,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:30,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:49:30,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:49:30,220 INFO L87 Difference]: Start difference. First operand 21651 states and 30373 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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-11-08 15:49:30,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:30,354 INFO L93 Difference]: Finished difference Result 43560 states and 60986 transitions. [2024-11-08 15:49:30,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:49:30,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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 163 [2024-11-08 15:49:30,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:30,381 INFO L225 Difference]: With dead ends: 43560 [2024-11-08 15:49:30,381 INFO L226 Difference]: Without dead ends: 22073 [2024-11-08 15:49:30,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:49:30,399 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 343 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 2313 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:30,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 2313 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:49:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22073 states. [2024-11-08 15:49:30,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22073 to 21828. [2024-11-08 15:49:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21828 states, 21827 states have (on average 1.3991844962660924) internal successors, (30540), 21827 states have internal predecessors, (30540), 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-11-08 15:49:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21828 states to 21828 states and 30540 transitions. [2024-11-08 15:49:30,690 INFO L78 Accepts]: Start accepts. Automaton has 21828 states and 30540 transitions. Word has length 163 [2024-11-08 15:49:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:30,690 INFO L471 AbstractCegarLoop]: Abstraction has 21828 states and 30540 transitions. [2024-11-08 15:49:30,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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-11-08 15:49:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 21828 states and 30540 transitions. [2024-11-08 15:49:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 15:49:30,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:30,699 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:30,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 15:49:30,699 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:30,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:30,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1801353677, now seen corresponding path program 1 times [2024-11-08 15:49:30,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:30,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801589396] [2024-11-08 15:49:30,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:30,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:31,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:31,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801589396] [2024-11-08 15:49:31,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801589396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:31,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:31,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:49:31,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265763302] [2024-11-08 15:49:31,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:31,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:49:31,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:31,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:49:31,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:31,072 INFO L87 Difference]: Start difference. First operand 21828 states and 30540 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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-11-08 15:49:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:31,151 INFO L93 Difference]: Finished difference Result 36904 states and 51609 transitions. [2024-11-08 15:49:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:49:31,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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 163 [2024-11-08 15:49:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:31,174 INFO L225 Difference]: With dead ends: 36904 [2024-11-08 15:49:31,175 INFO L226 Difference]: Without dead ends: 18939 [2024-11-08 15:49:31,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:31,193 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 3 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:31,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1253 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18939 states. [2024-11-08 15:49:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18939 to 18930. [2024-11-08 15:49:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18930 states, 18929 states have (on average 1.3954778382376247) internal successors, (26415), 18929 states have internal predecessors, (26415), 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-11-08 15:49:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18930 states to 18930 states and 26415 transitions. [2024-11-08 15:49:31,433 INFO L78 Accepts]: Start accepts. Automaton has 18930 states and 26415 transitions. Word has length 163 [2024-11-08 15:49:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:31,433 INFO L471 AbstractCegarLoop]: Abstraction has 18930 states and 26415 transitions. [2024-11-08 15:49:31,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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-11-08 15:49:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 18930 states and 26415 transitions. [2024-11-08 15:49:31,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 15:49:31,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:31,441 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:31,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 15:49:31,441 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:31,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:31,442 INFO L85 PathProgramCache]: Analyzing trace with hash -570891857, now seen corresponding path program 1 times [2024-11-08 15:49:31,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:31,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396253138] [2024-11-08 15:49:31,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:31,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:31,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:31,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396253138] [2024-11-08 15:49:31,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396253138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:31,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:31,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:49:31,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272525782] [2024-11-08 15:49:31,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:31,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:49:31,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:31,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:49:31,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:31,504 INFO L87 Difference]: Start difference. First operand 18930 states and 26415 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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-11-08 15:49:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:31,578 INFO L93 Difference]: Finished difference Result 35926 states and 50092 transitions. [2024-11-08 15:49:31,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:49:31,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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 167 [2024-11-08 15:49:31,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:31,612 INFO L225 Difference]: With dead ends: 35926 [2024-11-08 15:49:31,612 INFO L226 Difference]: Without dead ends: 26232 [2024-11-08 15:49:31,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-08 15:49:31,627 INFO L432 NwaCegarLoop]: 690 mSDtfsCounter, 361 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:31,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1090 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:31,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26232 states. [2024-11-08 15:49:31,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26232 to 18930. [2024-11-08 15:49:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18930 states, 18929 states have (on average 1.3952136932748693) internal successors, (26410), 18929 states have internal predecessors, (26410), 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-11-08 15:49:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18930 states to 18930 states and 26410 transitions. [2024-11-08 15:49:31,902 INFO L78 Accepts]: Start accepts. Automaton has 18930 states and 26410 transitions. Word has length 167 [2024-11-08 15:49:31,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:31,903 INFO L471 AbstractCegarLoop]: Abstraction has 18930 states and 26410 transitions. [2024-11-08 15:49:31,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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-11-08 15:49:31,903 INFO L276 IsEmpty]: Start isEmpty. Operand 18930 states and 26410 transitions. [2024-11-08 15:49:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 15:49:31,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:31,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:31,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 15:49:31,910 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:31,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:31,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1487758919, now seen corresponding path program 1 times [2024-11-08 15:49:31,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:31,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034872235] [2024-11-08 15:49:31,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:31,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:33,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:33,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034872235] [2024-11-08 15:49:33,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034872235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:33,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:33,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-08 15:49:33,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183706452] [2024-11-08 15:49:33,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:33,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 15:49:33,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:33,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 15:49:33,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-11-08 15:49:33,603 INFO L87 Difference]: Start difference. First operand 18930 states and 26410 transitions. Second operand has 22 states, 22 states have (on average 7.636363636363637) internal successors, (168), 22 states have internal predecessors, (168), 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-11-08 15:49:38,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:38,532 INFO L93 Difference]: Finished difference Result 47932 states and 68037 transitions. [2024-11-08 15:49:38,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-08 15:49:38,533 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.636363636363637) internal successors, (168), 22 states have internal predecessors, (168), 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 168 [2024-11-08 15:49:38,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:38,585 INFO L225 Difference]: With dead ends: 47932 [2024-11-08 15:49:38,585 INFO L226 Difference]: Without dead ends: 44646 [2024-11-08 15:49:38,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=824, Invalid=3598, Unknown=0, NotChecked=0, Total=4422 [2024-11-08 15:49:38,602 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 8468 mSDsluCounter, 7914 mSDsCounter, 0 mSdLazyCounter, 3052 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8468 SdHoareTripleChecker+Valid, 8538 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 3052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:38,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8468 Valid, 8538 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 3052 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 15:49:38,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44646 states. [2024-11-08 15:49:39,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44646 to 19950. [2024-11-08 15:49:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19950 states, 19949 states have (on average 1.3840794024763146) internal successors, (27611), 19949 states have internal predecessors, (27611), 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-11-08 15:49:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19950 states to 19950 states and 27611 transitions. [2024-11-08 15:49:39,128 INFO L78 Accepts]: Start accepts. Automaton has 19950 states and 27611 transitions. Word has length 168 [2024-11-08 15:49:39,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:39,129 INFO L471 AbstractCegarLoop]: Abstraction has 19950 states and 27611 transitions. [2024-11-08 15:49:39,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.636363636363637) internal successors, (168), 22 states have internal predecessors, (168), 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-11-08 15:49:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 19950 states and 27611 transitions. [2024-11-08 15:49:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 15:49:39,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:39,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:39,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 15:49:39,139 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:39,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:39,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1422081639, now seen corresponding path program 1 times [2024-11-08 15:49:39,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:39,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048759859] [2024-11-08 15:49:39,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:39,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:39,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:39,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048759859] [2024-11-08 15:49:39,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048759859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:39,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:39,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:49:39,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95734885] [2024-11-08 15:49:39,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:39,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:49:39,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:39,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:49:39,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:49:39,315 INFO L87 Difference]: Start difference. First operand 19950 states and 27611 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-11-08 15:49:39,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:39,552 INFO L93 Difference]: Finished difference Result 36296 states and 52511 transitions. [2024-11-08 15:49:39,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:49:39,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 168 [2024-11-08 15:49:39,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:39,594 INFO L225 Difference]: With dead ends: 36296 [2024-11-08 15:49:39,594 INFO L226 Difference]: Without dead ends: 30914 [2024-11-08 15:49:39,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:49:39,610 INFO L432 NwaCegarLoop]: 495 mSDtfsCounter, 908 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:39,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 1360 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:49:39,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30914 states. [2024-11-08 15:49:40,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30914 to 25546. [2024-11-08 15:49:40,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25546 states, 25545 states have (on average 1.4121745938539831) internal successors, (36074), 25545 states have internal predecessors, (36074), 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-11-08 15:49:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25546 states to 25546 states and 36074 transitions. [2024-11-08 15:49:40,101 INFO L78 Accepts]: Start accepts. Automaton has 25546 states and 36074 transitions. Word has length 168 [2024-11-08 15:49:40,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:40,101 INFO L471 AbstractCegarLoop]: Abstraction has 25546 states and 36074 transitions. [2024-11-08 15:49:40,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-11-08 15:49:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 25546 states and 36074 transitions. [2024-11-08 15:49:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 15:49:40,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:40,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:40,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 15:49:40,109 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:40,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:40,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1392072489, now seen corresponding path program 1 times [2024-11-08 15:49:40,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:40,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763882134] [2024-11-08 15:49:40,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:40,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:40,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:40,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763882134] [2024-11-08 15:49:40,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763882134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:40,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:40,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:49:40,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269981065] [2024-11-08 15:49:40,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:40,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:49:40,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:40,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:49:40,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:49:40,182 INFO L87 Difference]: Start difference. First operand 25546 states and 36074 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-11-08 15:49:40,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:40,334 INFO L93 Difference]: Finished difference Result 62043 states and 89805 transitions. [2024-11-08 15:49:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:49:40,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 168 [2024-11-08 15:49:40,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:40,390 INFO L225 Difference]: With dead ends: 62043 [2024-11-08 15:49:40,391 INFO L226 Difference]: Without dead ends: 45019 [2024-11-08 15:49:40,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-08 15:49:40,416 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 223 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:40,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 694 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:49:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45019 states. [2024-11-08 15:49:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45019 to 45017. [2024-11-08 15:49:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45017 states, 45016 states have (on average 1.414541496356851) internal successors, (63677), 45016 states have internal predecessors, (63677), 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-11-08 15:49:40,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45017 states to 45017 states and 63677 transitions. [2024-11-08 15:49:40,927 INFO L78 Accepts]: Start accepts. Automaton has 45017 states and 63677 transitions. Word has length 168 [2024-11-08 15:49:40,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:40,927 INFO L471 AbstractCegarLoop]: Abstraction has 45017 states and 63677 transitions. [2024-11-08 15:49:40,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-11-08 15:49:40,928 INFO L276 IsEmpty]: Start isEmpty. Operand 45017 states and 63677 transitions. [2024-11-08 15:49:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 15:49:40,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:40,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:40,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 15:49:40,940 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:40,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash 631397051, now seen corresponding path program 1 times [2024-11-08 15:49:40,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:40,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435259036] [2024-11-08 15:49:40,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:40,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:41,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:41,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435259036] [2024-11-08 15:49:41,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435259036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:41,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:41,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:49:41,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988990856] [2024-11-08 15:49:41,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:41,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:49:41,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:41,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:49:41,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:49:41,187 INFO L87 Difference]: Start difference. First operand 45017 states and 63677 transitions. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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-11-08 15:49:41,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:41,404 INFO L93 Difference]: Finished difference Result 68477 states and 99087 transitions. [2024-11-08 15:49:41,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:49:41,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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 168 [2024-11-08 15:49:41,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:41,464 INFO L225 Difference]: With dead ends: 68477 [2024-11-08 15:49:41,465 INFO L226 Difference]: Without dead ends: 45019 [2024-11-08 15:49:41,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:49:41,491 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 1283 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:41,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 1107 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:49:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45019 states. [2024-11-08 15:49:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45019 to 45017. [2024-11-08 15:49:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45017 states, 45016 states have (on average 1.4081215567798115) internal successors, (63388), 45016 states have internal predecessors, (63388), 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-11-08 15:49:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45017 states to 45017 states and 63388 transitions. [2024-11-08 15:49:42,159 INFO L78 Accepts]: Start accepts. Automaton has 45017 states and 63388 transitions. Word has length 168 [2024-11-08 15:49:42,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:42,159 INFO L471 AbstractCegarLoop]: Abstraction has 45017 states and 63388 transitions. [2024-11-08 15:49:42,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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-11-08 15:49:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 45017 states and 63388 transitions. [2024-11-08 15:49:42,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 15:49:42,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:42,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:42,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 15:49:42,176 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:42,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:42,176 INFO L85 PathProgramCache]: Analyzing trace with hash 751294860, now seen corresponding path program 1 times [2024-11-08 15:49:42,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:42,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692007103] [2024-11-08 15:49:42,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:42,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:42,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:42,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692007103] [2024-11-08 15:49:42,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692007103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:42,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:42,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 15:49:42,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873678518] [2024-11-08 15:49:42,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:42,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 15:49:42,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:42,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 15:49:42,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:49:42,538 INFO L87 Difference]: Start difference. First operand 45017 states and 63388 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 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-11-08 15:49:42,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:42,819 INFO L93 Difference]: Finished difference Result 88964 states and 125560 transitions. [2024-11-08 15:49:42,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:49:42,819 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 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 168 [2024-11-08 15:49:42,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:42,871 INFO L225 Difference]: With dead ends: 88964 [2024-11-08 15:49:42,871 INFO L226 Difference]: Without dead ends: 45017 [2024-11-08 15:49:42,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:49:42,905 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 2224 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2224 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:42,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2224 Valid, 584 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:49:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45017 states. [2024-11-08 15:49:43,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45017 to 45017. [2024-11-08 15:49:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45017 states, 45016 states have (on average 1.3825306557668384) internal successors, (62236), 45016 states have internal predecessors, (62236), 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-11-08 15:49:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45017 states to 45017 states and 62236 transitions. [2024-11-08 15:49:43,564 INFO L78 Accepts]: Start accepts. Automaton has 45017 states and 62236 transitions. Word has length 168 [2024-11-08 15:49:43,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:43,564 INFO L471 AbstractCegarLoop]: Abstraction has 45017 states and 62236 transitions. [2024-11-08 15:49:43,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 9 states have internal predecessors, (168), 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-11-08 15:49:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 45017 states and 62236 transitions. [2024-11-08 15:49:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 15:49:43,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:43,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:43,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 15:49:43,577 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:43,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:43,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1648521291, now seen corresponding path program 1 times [2024-11-08 15:49:43,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:43,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747118050] [2024-11-08 15:49:43,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:43,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:43,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:43,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747118050] [2024-11-08 15:49:43,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747118050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:43,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:43,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:49:43,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935690803] [2024-11-08 15:49:43,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:43,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:49:43,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:43,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:49:43,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:49:43,790 INFO L87 Difference]: Start difference. First operand 45017 states and 62236 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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-11-08 15:49:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:44,011 INFO L93 Difference]: Finished difference Result 72767 states and 103339 transitions. [2024-11-08 15:49:44,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:49:44,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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 168 [2024-11-08 15:49:44,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:44,063 INFO L225 Difference]: With dead ends: 72767 [2024-11-08 15:49:44,063 INFO L226 Difference]: Without dead ends: 45019 [2024-11-08 15:49:44,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-08 15:49:44,090 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 602 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:44,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 830 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:49:44,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45019 states. [2024-11-08 15:49:44,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45019 to 42336. [2024-11-08 15:49:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42336 states, 42335 states have (on average 1.3708515412779025) internal successors, (58035), 42335 states have internal predecessors, (58035), 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-11-08 15:49:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42336 states to 42336 states and 58035 transitions. [2024-11-08 15:49:44,683 INFO L78 Accepts]: Start accepts. Automaton has 42336 states and 58035 transitions. Word has length 168 [2024-11-08 15:49:44,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:44,684 INFO L471 AbstractCegarLoop]: Abstraction has 42336 states and 58035 transitions. [2024-11-08 15:49:44,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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-11-08 15:49:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 42336 states and 58035 transitions. [2024-11-08 15:49:44,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 15:49:44,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:44,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:44,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 15:49:44,696 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:44,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:44,696 INFO L85 PathProgramCache]: Analyzing trace with hash 167708123, now seen corresponding path program 1 times [2024-11-08 15:49:44,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:44,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034628746] [2024-11-08 15:49:44,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:44,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:44,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:44,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034628746] [2024-11-08 15:49:44,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034628746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:44,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:44,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:49:44,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879791623] [2024-11-08 15:49:44,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:44,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:49:44,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:44,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:49:44,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:49:44,844 INFO L87 Difference]: Start difference. First operand 42336 states and 58035 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-11-08 15:49:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:45,082 INFO L93 Difference]: Finished difference Result 66491 states and 93544 transitions. [2024-11-08 15:49:45,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:49:45,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 168 [2024-11-08 15:49:45,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:45,158 INFO L225 Difference]: With dead ends: 66491 [2024-11-08 15:49:45,159 INFO L226 Difference]: Without dead ends: 61109 [2024-11-08 15:49:45,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:49:45,182 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 851 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:45,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1388 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:49:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61109 states. [2024-11-08 15:49:45,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61109 to 45017. [2024-11-08 15:49:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45017 states, 45016 states have (on average 1.3757108583614714) internal successors, (61929), 45016 states have internal predecessors, (61929), 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-11-08 15:49:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45017 states to 45017 states and 61929 transitions. [2024-11-08 15:49:45,843 INFO L78 Accepts]: Start accepts. Automaton has 45017 states and 61929 transitions. Word has length 168 [2024-11-08 15:49:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:45,843 INFO L471 AbstractCegarLoop]: Abstraction has 45017 states and 61929 transitions. [2024-11-08 15:49:45,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-11-08 15:49:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 45017 states and 61929 transitions. [2024-11-08 15:49:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 15:49:45,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:45,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:45,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 15:49:45,855 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:45,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:45,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1552834861, now seen corresponding path program 1 times [2024-11-08 15:49:45,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:45,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624427895] [2024-11-08 15:49:45,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:45,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:45,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:45,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624427895] [2024-11-08 15:49:45,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624427895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:45,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:45,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:49:45,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084891693] [2024-11-08 15:49:45,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:45,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:49:45,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:45,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:49:45,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:49:45,969 INFO L87 Difference]: Start difference. First operand 45017 states and 61929 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-11-08 15:49:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:46,574 INFO L93 Difference]: Finished difference Result 133520 states and 192508 transitions. [2024-11-08 15:49:46,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:49:46,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 168 [2024-11-08 15:49:46,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:46,736 INFO L225 Difference]: With dead ends: 133520 [2024-11-08 15:49:46,736 INFO L226 Difference]: Without dead ends: 103937 [2024-11-08 15:49:46,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:49:46,754 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 1062 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:46,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 1982 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:49:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103937 states. [2024-11-08 15:49:47,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103937 to 71445. [2024-11-08 15:49:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71445 states, 71444 states have (on average 1.4063742231677958) internal successors, (100477), 71444 states have internal predecessors, (100477), 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-11-08 15:49:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71445 states to 71445 states and 100477 transitions. [2024-11-08 15:49:48,070 INFO L78 Accepts]: Start accepts. Automaton has 71445 states and 100477 transitions. Word has length 168 [2024-11-08 15:49:48,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:48,071 INFO L471 AbstractCegarLoop]: Abstraction has 71445 states and 100477 transitions. [2024-11-08 15:49:48,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-11-08 15:49:48,071 INFO L276 IsEmpty]: Start isEmpty. Operand 71445 states and 100477 transitions. [2024-11-08 15:49:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 15:49:48,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:48,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:48,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 15:49:48,087 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:48,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2120859759, now seen corresponding path program 1 times [2024-11-08 15:49:48,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:48,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798138178] [2024-11-08 15:49:48,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:48,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:49,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:49,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798138178] [2024-11-08 15:49:49,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798138178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:49,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:49,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-08 15:49:49,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274878803] [2024-11-08 15:49:49,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:49,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 15:49:49,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:49,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 15:49:49,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:49:49,794 INFO L87 Difference]: Start difference. First operand 71445 states and 100477 transitions. Second operand has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 23 states have internal predecessors, (168), 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-11-08 15:49:52,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:52,990 INFO L93 Difference]: Finished difference Result 135512 states and 193253 transitions. [2024-11-08 15:49:52,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 15:49:52,991 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 23 states have internal predecessors, (168), 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 168 [2024-11-08 15:49:52,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:53,144 INFO L225 Difference]: With dead ends: 135512 [2024-11-08 15:49:53,144 INFO L226 Difference]: Without dead ends: 107235 [2024-11-08 15:49:53,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=396, Invalid=1410, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 15:49:53,183 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 3152 mSDsluCounter, 12482 mSDsCounter, 0 mSdLazyCounter, 4186 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3152 SdHoareTripleChecker+Valid, 13363 SdHoareTripleChecker+Invalid, 4201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:53,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3152 Valid, 13363 Invalid, 4201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4186 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 15:49:53,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107235 states. [2024-11-08 15:49:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107235 to 72193. [2024-11-08 15:49:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72193 states, 72192 states have (on average 1.403161015070922) internal successors, (101297), 72192 states have internal predecessors, (101297), 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-11-08 15:49:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72193 states to 72193 states and 101297 transitions. [2024-11-08 15:49:54,452 INFO L78 Accepts]: Start accepts. Automaton has 72193 states and 101297 transitions. Word has length 168 [2024-11-08 15:49:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:54,452 INFO L471 AbstractCegarLoop]: Abstraction has 72193 states and 101297 transitions. [2024-11-08 15:49:54,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 23 states have internal predecessors, (168), 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-11-08 15:49:54,452 INFO L276 IsEmpty]: Start isEmpty. Operand 72193 states and 101297 transitions. [2024-11-08 15:49:54,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 15:49:54,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:54,464 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:54,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 15:49:54,465 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:54,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:54,465 INFO L85 PathProgramCache]: Analyzing trace with hash -788980799, now seen corresponding path program 1 times [2024-11-08 15:49:54,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:54,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146265779] [2024-11-08 15:49:54,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:54,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:49:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:49:55,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:49:55,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146265779] [2024-11-08 15:49:55,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146265779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:49:55,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:49:55,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 15:49:55,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303024401] [2024-11-08 15:49:55,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:49:55,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 15:49:55,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:49:55,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 15:49:55,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:49:55,479 INFO L87 Difference]: Start difference. First operand 72193 states and 101297 transitions. Second operand has 16 states, 16 states have (on average 10.5) internal successors, (168), 16 states have internal predecessors, (168), 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-11-08 15:49:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:49:56,743 INFO L93 Difference]: Finished difference Result 207941 states and 295702 transitions. [2024-11-08 15:49:56,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 15:49:56,744 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.5) internal successors, (168), 16 states have internal predecessors, (168), 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 168 [2024-11-08 15:49:56,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:49:57,017 INFO L225 Difference]: With dead ends: 207941 [2024-11-08 15:49:57,018 INFO L226 Difference]: Without dead ends: 183842 [2024-11-08 15:49:57,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=838, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 15:49:57,047 INFO L432 NwaCegarLoop]: 636 mSDtfsCounter, 3538 mSDsluCounter, 5044 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3538 SdHoareTripleChecker+Valid, 5680 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:49:57,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3538 Valid, 5680 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:49:57,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183842 states. [2024-11-08 15:49:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183842 to 76214. [2024-11-08 15:49:58,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76214 states, 76213 states have (on average 1.3882933357826093) internal successors, (105806), 76213 states have internal predecessors, (105806), 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-11-08 15:49:59,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76214 states to 76214 states and 105806 transitions. [2024-11-08 15:49:59,251 INFO L78 Accepts]: Start accepts. Automaton has 76214 states and 105806 transitions. Word has length 168 [2024-11-08 15:49:59,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:49:59,252 INFO L471 AbstractCegarLoop]: Abstraction has 76214 states and 105806 transitions. [2024-11-08 15:49:59,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.5) internal successors, (168), 16 states have internal predecessors, (168), 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-11-08 15:49:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 76214 states and 105806 transitions. [2024-11-08 15:49:59,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 15:49:59,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:49:59,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:49:59,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 15:49:59,281 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:49:59,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:49:59,282 INFO L85 PathProgramCache]: Analyzing trace with hash 800808963, now seen corresponding path program 1 times [2024-11-08 15:49:59,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:49:59,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915282630] [2024-11-08 15:49:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:49:59,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:49:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:50:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:50:00,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:50:00,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915282630] [2024-11-08 15:50:00,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915282630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:50:00,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:50:00,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-08 15:50:00,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468536916] [2024-11-08 15:50:00,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:50:00,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 15:50:00,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:50:00,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 15:50:00,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:50:00,688 INFO L87 Difference]: Start difference. First operand 76214 states and 105806 transitions. Second operand has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 23 states have internal predecessors, (168), 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-11-08 15:50:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:50:04,852 INFO L93 Difference]: Finished difference Result 144107 states and 202416 transitions. [2024-11-08 15:50:04,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-08 15:50:04,852 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 23 states have internal predecessors, (168), 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 168 [2024-11-08 15:50:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:50:05,020 INFO L225 Difference]: With dead ends: 144107 [2024-11-08 15:50:05,020 INFO L226 Difference]: Without dead ends: 127481 [2024-11-08 15:50:05,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=487, Invalid=2375, Unknown=0, NotChecked=0, Total=2862 [2024-11-08 15:50:05,047 INFO L432 NwaCegarLoop]: 1088 mSDtfsCounter, 3552 mSDsluCounter, 16742 mSDsCounter, 0 mSdLazyCounter, 5410 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3552 SdHoareTripleChecker+Valid, 17830 SdHoareTripleChecker+Invalid, 5473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 5410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:50:05,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3552 Valid, 17830 Invalid, 5473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 5410 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 15:50:05,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127481 states. [2024-11-08 15:50:06,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127481 to 77900. [2024-11-08 15:50:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77900 states, 77899 states have (on average 1.3829702563575912) internal successors, (107732), 77899 states have internal predecessors, (107732), 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-11-08 15:50:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77900 states to 77900 states and 107732 transitions. [2024-11-08 15:50:06,731 INFO L78 Accepts]: Start accepts. Automaton has 77900 states and 107732 transitions. Word has length 168 [2024-11-08 15:50:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:50:06,731 INFO L471 AbstractCegarLoop]: Abstraction has 77900 states and 107732 transitions. [2024-11-08 15:50:06,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.304347826086956) internal successors, (168), 23 states have internal predecessors, (168), 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-11-08 15:50:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 77900 states and 107732 transitions. [2024-11-08 15:50:06,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 15:50:06,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:50:06,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:50:06,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 15:50:06,748 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:50:06,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:50:06,748 INFO L85 PathProgramCache]: Analyzing trace with hash -74318831, now seen corresponding path program 1 times [2024-11-08 15:50:06,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:50:06,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087593912] [2024-11-08 15:50:06,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:50:06,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:50:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:50:06,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 15:50:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:50:06,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 15:50:06,985 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 15:50:06,986 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:50:06,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 15:50:06,992 INFO L407 BasicCegarLoop]: Path program 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, 1, 1] [2024-11-08 15:50:07,157 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:50:07,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:50:07 BoogieIcfgContainer [2024-11-08 15:50:07,160 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:50:07,161 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:50:07,161 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:50:07,161 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:50:07,161 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:49:17" (3/4) ... [2024-11-08 15:50:07,162 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 15:50:07,343 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:50:07,343 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:50:07,343 INFO L158 Benchmark]: Toolchain (without parser) took 51363.89ms. Allocated memory was 134.2MB in the beginning and 9.5GB in the end (delta: 9.4GB). Free memory was 61.1MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-08 15:50:07,344 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:50:07,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.95ms. Allocated memory was 134.2MB in the beginning and 203.4MB in the end (delta: 69.2MB). Free memory was 60.8MB in the beginning and 155.5MB in the end (delta: -94.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 15:50:07,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.05ms. Allocated memory is still 203.4MB. Free memory was 155.5MB in the beginning and 149.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 15:50:07,345 INFO L158 Benchmark]: Boogie Preprocessor took 127.17ms. Allocated memory is still 203.4MB. Free memory was 149.2MB in the beginning and 143.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 15:50:07,346 INFO L158 Benchmark]: RCFGBuilder took 1207.74ms. Allocated memory is still 203.4MB. Free memory was 143.9MB in the beginning and 120.2MB in the end (delta: 23.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-08 15:50:07,346 INFO L158 Benchmark]: TraceAbstraction took 49259.11ms. Allocated memory was 203.4MB in the beginning and 9.5GB in the end (delta: 9.3GB). Free memory was 119.2MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-08 15:50:07,346 INFO L158 Benchmark]: Witness Printer took 182.33ms. Allocated memory is still 9.5GB. Free memory was 8.0GB in the beginning and 8.0GB in the end (delta: 53.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-08 15:50:07,347 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.95ms. Allocated memory was 134.2MB in the beginning and 203.4MB in the end (delta: 69.2MB). Free memory was 60.8MB in the beginning and 155.5MB in the end (delta: -94.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.05ms. Allocated memory is still 203.4MB. Free memory was 155.5MB in the beginning and 149.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.17ms. Allocated memory is still 203.4MB. Free memory was 149.2MB in the beginning and 143.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1207.74ms. Allocated memory is still 203.4MB. Free memory was 143.9MB in the beginning and 120.2MB in the end (delta: 23.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 49259.11ms. Allocated memory was 203.4MB in the beginning and 9.5GB in the end (delta: 9.3GB). Free memory was 119.2MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 182.33ms. Allocated memory is still 9.5GB. Free memory was 8.0GB in the beginning and 8.0GB in the end (delta: 53.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 818]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L25] msg_t nomsg = (msg_t )-1; [L26] port_t p12 = 0; [L27] char p12_old = '\x0'; [L28] char p12_new = '\x0'; [L29] _Bool ep12 = 0; [L30] port_t p13 = 0; [L31] char p13_old = '\x0'; [L32] char p13_new = '\x0'; [L33] _Bool ep13 = 0; [L34] port_t p21 = 0; [L35] char p21_old = '\x0'; [L36] char p21_new = '\x0'; [L37] _Bool ep21 = 0; [L38] port_t p23 = 0; [L39] char p23_old = '\x0'; [L40] char p23_new = '\x0'; [L41] _Bool ep23 = 0; [L42] port_t p31 = 0; [L43] char p31_old = '\x0'; [L44] char p31_new = '\x0'; [L45] _Bool ep31 = 0; [L46] port_t p32 = 0; [L47] char p32_old = '\x0'; [L48] char p32_new = '\x0'; [L49] _Bool ep32 = 0; [L50] char id1 = '\x0'; [L51] char r1 = '\x0'; [L52] char st1 = '\x0'; [L53] char nl1 = '\x0'; [L54] char m1 = '\x0'; [L55] char max1 = '\x0'; [L56] _Bool mode1 = 0; [L57] char id2 = '\x0'; [L58] char r2 = '\x0'; [L59] char st2 = '\x0'; [L60] char nl2 = '\x0'; [L61] char m2 = '\x0'; [L62] char max2 = '\x0'; [L63] _Bool mode2 = 0; [L64] char id3 = '\x0'; [L65] char r3 = '\x0'; [L66] char st3 = '\x0'; [L67] char nl3 = '\x0'; [L68] char m3 = '\x0'; [L69] char max3 = '\x0'; [L70] _Bool mode3 = 0; [L74] void (*nodes[3])() = { &node1, &node2, &node3 }; [L78] int __return_1709; [L79] int __return_1837; [L80] int __return_1955; [L81] int __return_2060; [L82] int __return_2183; [L83] int __tmp_2184_0; [L84] int __return_2292; [L85] int __return_2197; VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L88] int main__c1; [L89] int main__i2; [L90] main__c1 = 0 [L91] ep12 = __VERIFIER_nondet_bool() [L92] ep13 = __VERIFIER_nondet_bool() [L93] ep21 = __VERIFIER_nondet_bool() [L94] ep23 = __VERIFIER_nondet_bool() [L95] ep31 = __VERIFIER_nondet_bool() [L96] ep32 = __VERIFIER_nondet_bool() [L97] id1 = __VERIFIER_nondet_char() [L98] r1 = __VERIFIER_nondet_char() [L99] st1 = __VERIFIER_nondet_char() [L100] nl1 = __VERIFIER_nondet_char() [L101] m1 = __VERIFIER_nondet_char() [L102] max1 = __VERIFIER_nondet_char() [L103] mode1 = __VERIFIER_nondet_bool() [L104] id2 = __VERIFIER_nondet_char() [L105] r2 = __VERIFIER_nondet_char() [L106] st2 = __VERIFIER_nondet_char() [L107] nl2 = __VERIFIER_nondet_char() [L108] m2 = __VERIFIER_nondet_char() [L109] max2 = __VERIFIER_nondet_char() [L110] mode2 = __VERIFIER_nondet_bool() [L111] id3 = __VERIFIER_nondet_char() [L112] r3 = __VERIFIER_nondet_char() [L113] st3 = __VERIFIER_nondet_char() [L114] nl3 = __VERIFIER_nondet_char() [L115] m3 = __VERIFIER_nondet_char() [L116] max3 = __VERIFIER_nondet_char() [L117] mode3 = __VERIFIER_nondet_bool() [L119] _Bool init__r121; [L120] _Bool init__r131; [L121] _Bool init__r211; [L122] _Bool init__r231; [L123] _Bool init__r311; [L124] _Bool init__r321; [L125] _Bool init__r122; [L126] int init__tmp; [L127] _Bool init__r132; [L128] int init__tmp___0; [L129] _Bool init__r212; [L130] int init__tmp___1; [L131] _Bool init__r232; [L132] int init__tmp___2; [L133] _Bool init__r312; [L134] int init__tmp___3; [L135] _Bool init__r322; [L136] int init__tmp___4; [L137] int init__tmp___5; [L138] init__r121 = ep12 [L139] init__r131 = ep13 [L140] init__r211 = ep21 [L141] init__r231 = ep23 [L142] init__r311 = ep31 [L143] init__r321 = ep32 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L144] COND FALSE !(!(init__r121 == 0)) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L2220] COND TRUE !(init__r131 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L2222] COND TRUE !(ep32 == 0) [L2224] init__tmp = 1 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L148] init__r122 = (_Bool)init__tmp VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L149] COND TRUE !(init__r131 == 0) [L151] init__tmp___0 = 1 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp___0=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L153] init__r132 = (_Bool)init__tmp___0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L154] COND TRUE !(init__r211 == 0) [L156] init__tmp___1 = 1 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp___1=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L158] init__r212 = (_Bool)init__tmp___1 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r212=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L159] COND FALSE !(!(init__r231 == 0)) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r212=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L2151] COND TRUE !(init__r211 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L2153] COND TRUE !(ep13 == 0) [L2155] init__tmp___2 = 1 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r311=0, init__r321=1, init__tmp___2=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L163] init__r232 = (_Bool)init__tmp___2 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L164] COND FALSE !(!(init__r311 == 0)) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L2128] COND TRUE !(init__r321 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L2130] COND TRUE !(ep21 == 0) [L2132] init__tmp___3 = 1 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, init__tmp___3=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] init__r312 = (_Bool)init__tmp___3 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r321=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L169] COND TRUE !(init__r321 == 0) [L171] init__tmp___4 = 1 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__tmp___4=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L173] init__r322 = (_Bool)init__tmp___4 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L174] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L176] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L178] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L180] COND TRUE ((int)id1) >= 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L182] COND TRUE ((int)id2) >= 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L184] COND TRUE ((int)id3) >= 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L186] COND TRUE ((int)r1) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L188] COND TRUE ((int)r2) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L190] COND TRUE ((int)r3) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L192] COND TRUE !(init__r122 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L194] COND TRUE !(init__r132 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L196] COND TRUE !(init__r212 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L198] COND TRUE !(init__r232 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L200] COND TRUE !(init__r312 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L202] COND TRUE !(init__r322 == 0) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L204] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L206] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L208] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)st1) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L212] COND TRUE ((int)st2) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L214] COND TRUE ((int)st3) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L216] COND TRUE ((int)nl1) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L218] COND TRUE ((int)nl2) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L220] COND TRUE ((int)nl3) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L222] COND TRUE ((int)mode1) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L224] COND TRUE ((int)mode2) == 0 VAL [__return_1709=0, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L226] COND TRUE ((int)mode3) == 0 [L228] init__tmp___5 = 1 [L229] __return_1709 = init__tmp___5 [L230] main__i2 = __return_1709 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=1, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L231] COND TRUE main__i2 != 0 [L233] p12_old = nomsg [L234] p12_new = nomsg [L235] p13_old = nomsg [L236] p13_new = nomsg [L237] p21_old = nomsg [L238] p21_new = nomsg [L239] p23_old = nomsg [L240] p23_new = nomsg [L241] p31_old = nomsg [L242] p31_new = nomsg [L243] p32_old = nomsg [L244] p32_new = nomsg [L245] main__i2 = 0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L246] COND TRUE main__i2 < 6 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L249] COND FALSE !(!(mode1 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L255] COND TRUE ((int)r1) < 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L257] COND FALSE !(!(ep12 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L268] COND TRUE !(ep13 == 0) [L270] int node1____CPAchecker_TMP_1; VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L271] COND TRUE max1 != nomsg VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L273] COND TRUE p13_new == nomsg [L275] node1____CPAchecker_TMP_1 = max1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_1=4, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L277] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L279] mode1 = 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L281] COND FALSE !(!(mode2 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L287] COND TRUE ((int)r2) < 2 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L289] COND TRUE !(ep21 == 0) [L291] int node2____CPAchecker_TMP_0; VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L292] COND TRUE max2 != nomsg VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L294] COND TRUE p21_new == nomsg [L296] node2____CPAchecker_TMP_0 = max2 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_0=8, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L298] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L300] COND FALSE !(!(ep23 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L311] mode2 = 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L313] COND FALSE !(!(mode3 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L319] COND TRUE ((int)r3) < 2 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L321] COND FALSE !(!(ep31 == 0)) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L332] COND TRUE !(ep32 == 0) [L334] int node3____CPAchecker_TMP_1; VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L335] COND TRUE max3 != nomsg VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L337] COND TRUE p32_new == nomsg [L339] node3____CPAchecker_TMP_1 = max3 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_1=5, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L341] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=4, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=5, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L343] mode3 = 1 [L344] p12_old = p12_new [L345] p12_new = nomsg [L346] p13_old = p13_new [L347] p13_new = nomsg [L348] p21_old = p21_new [L349] p21_new = nomsg [L350] p23_old = p23_new [L351] p23_new = nomsg [L352] p31_old = p31_new [L353] p31_new = nomsg [L354] p32_old = p32_new [L355] p32_new = nomsg [L357] int check__tmp; VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L358] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L360] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L362] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L364] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L366] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L372] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L374] COND TRUE ((int)r1) < 2 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L376] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L382] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1709=1, __return_1837=0, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L384] COND TRUE ((int)r1) < 2 [L386] check__tmp = 1 [L387] __return_1837 = check__tmp [L388] main__c1 = __return_1837 [L390] _Bool __tmp_1; [L391] __tmp_1 = main__c1 [L392] _Bool assert__arg; [L393] assert__arg = __tmp_1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, assert__arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L394] COND FALSE !(assert__arg == 0) [L400] int main____CPAchecker_TMP_0 = main__i2; [L401] main__i2 = main__i2 + 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=1, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L402] COND TRUE main__i2 < 6 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=1, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L405] COND TRUE !(mode1 == 0) [L407] r1 = (char)(((int)r1) + 1) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=1, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L408] COND TRUE !(ep21 == 0) [L410] m1 = p21_old [L411] p21_old = nomsg VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=0, m3=0, main__i2=1, max1=4, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L412] COND TRUE ((int)m1) > ((int)max1) [L414] max1 = m1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=0, m3=0, main__i2=1, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND FALSE !(!(ep31 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=0, m3=0, main__i2=1, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND FALSE !(((int)r1) == 2) [L430] mode1 = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=0, m3=0, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE !(mode2 == 0) [L434] r2 = (char)(((int)r2) + 1) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=0, m3=0, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L435] COND FALSE !(!(ep12 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=0, m3=0, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE !(ep32 == 0) [L445] m2 = p32_old [L446] p32_old = nomsg VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=0, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L447] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=0, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L451] COND FALSE !(((int)r2) == 2) [L457] mode2 = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=0, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L459] COND TRUE !(mode3 == 0) [L461] r3 = (char)(((int)r3) + 1) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=0, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=4, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L462] COND TRUE !(ep13 == 0) [L464] m3 = p13_old [L465] p13_old = nomsg VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND FALSE !(!(ep23 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND FALSE !(((int)r3) == 2) [L484] mode3 = 0 [L485] p12_old = p12_new [L486] p12_new = nomsg [L487] p13_old = p13_new [L488] p13_new = nomsg [L489] p21_old = p21_new [L490] p21_new = nomsg [L491] p23_old = p23_new [L492] p23_new = nomsg [L493] p31_old = p31_new [L494] p31_new = nomsg [L495] p32_old = p32_new [L496] p32_new = nomsg [L498] int check__tmp; VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L499] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L501] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L505] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L507] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L513] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L515] COND TRUE ((int)r1) < 2 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=0, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int)r1) < 2 [L527] check__tmp = 1 [L528] __return_1955 = check__tmp [L529] main__c1 = __return_1955 [L531] _Bool __tmp_2; [L532] __tmp_2 = main__c1 [L533] _Bool assert__arg; [L534] assert__arg = __tmp_2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, assert__arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=1, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L535] COND FALSE !(assert__arg == 0) [L541] int main____CPAchecker_TMP_0 = main__i2; [L542] main__i2 = main__i2 + 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L543] COND TRUE main__i2 < 6 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L546] COND FALSE !(!(mode1 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L552] COND FALSE !(((int)r1) < 1) [L558] mode1 = 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L560] COND FALSE !(!(mode2 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] COND TRUE ((int)r2) < 2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE !(ep21 == 0) [L570] int node2____CPAchecker_TMP_0; VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L571] COND TRUE max2 != nomsg VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L573] COND TRUE p21_new == nomsg [L575] node2____CPAchecker_TMP_0 = max2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_0=8, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L577] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L579] COND FALSE !(!(ep23 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L590] mode2 = 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L592] COND FALSE !(!(mode3 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L598] COND TRUE ((int)r3) < 2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L600] COND FALSE !(!(ep31 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L611] COND TRUE !(ep32 == 0) [L613] int node3____CPAchecker_TMP_1; VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L614] COND TRUE max3 != nomsg VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L616] COND TRUE p32_new == nomsg [L618] node3____CPAchecker_TMP_1 = max3 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_1=5, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L620] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=8, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=5, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L622] mode3 = 1 [L623] p12_old = p12_new [L624] p12_new = nomsg [L625] p13_old = p13_new [L626] p13_new = nomsg [L627] p21_old = p21_new [L628] p21_new = nomsg [L629] p23_old = p23_new [L630] p23_new = nomsg [L631] p31_old = p31_new [L632] p31_new = nomsg [L633] p32_old = p32_new [L634] p32_new = nomsg [L636] int check__tmp; VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L637] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L639] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L641] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L643] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L645] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L651] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L653] COND TRUE ((int)r1) < 2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L655] COND FALSE !(((int)r1) >= 2) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L661] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=0, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L663] COND TRUE ((int)r1) < 2 [L665] check__tmp = 1 [L666] __return_2060 = check__tmp [L667] main__c1 = __return_2060 [L669] _Bool __tmp_3; [L670] __tmp_3 = main__c1 [L671] _Bool assert__arg; [L672] assert__arg = __tmp_3 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, assert__arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main__i2=2, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L673] COND FALSE !(assert__arg == 0) [L679] int main____CPAchecker_TMP_0 = main__i2; [L680] main__i2 = main__i2 + 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L681] COND TRUE main__i2 < 6 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L684] COND TRUE !(mode1 == 0) [L686] r1 = (char)(((int)r1) + 1) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=8, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L687] COND TRUE !(ep21 == 0) [L689] m1 = p21_old [L690] p21_old = nomsg VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L691] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L695] COND FALSE !(!(ep31 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L703] COND TRUE ((int)r1) == 2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L705] COND FALSE !(((int)max1) == ((int)id1)) [L1484] nl1 = 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=1, mode2=1, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L709] mode1 = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=1, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L711] COND TRUE !(mode2 == 0) [L713] r2 = (char)(((int)r2) + 1) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=1, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=2, r2=2, r3=1, st1=0, st2=0, st3=0] [L714] COND FALSE !(!(ep12 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=1, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=2, r2=2, r3=1, st1=0, st2=0, st3=0] [L722] COND TRUE !(ep32 == 0) [L724] m2 = p32_old [L725] p32_old = nomsg VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=1, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=0, st3=0] [L726] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=1, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=0, st3=0] [L730] COND TRUE ((int)r2) == 2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=1, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=0, st3=0] [L732] COND TRUE ((int)max2) == ((int)id2) [L734] st2 = 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=1, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=1, st3=0] [L736] mode2 = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=1, st3=0] [L738] COND TRUE !(mode3 == 0) [L740] r3 = (char)(((int)r3) + 1) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=4, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=0] [L741] COND TRUE !(ep13 == 0) [L743] m3 = p13_old [L744] p13_old = nomsg VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=-1, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=0] [L745] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=-1, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=0] [L749] COND FALSE !(!(ep23 == 0)) VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=-1, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=0] [L757] COND TRUE ((int)r3) == 2 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=-1, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=0] [L759] COND TRUE ((int)max3) == ((int)id3) [L761] st3 = 1 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=-1, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=1, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L763] mode3 = 0 [L764] p12_old = p12_new [L765] p12_new = nomsg [L766] p13_old = p13_new [L767] p13_new = nomsg [L768] p21_old = p21_new [L769] p21_new = nomsg [L770] p23_old = p23_new [L771] p23_new = nomsg [L772] p31_old = p31_new [L773] p31_new = nomsg [L774] p32_old = p32_new [L775] p32_new = nomsg [L777] int check__tmp; VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=-1, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L778] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1403] check__tmp = 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=0, check__tmp=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=-1, main____CPAchecker_TMP_0=2, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L806] __return_2183 = check__tmp [L807] main__c1 = __return_2183 [L808] __tmp_2184_0 = main____CPAchecker_TMP_0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=2, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=-1, main__c1=0, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L810] main____CPAchecker_TMP_0 = __tmp_2184_0 [L812] _Bool __tmp_4; [L813] __tmp_4 = main__c1 [L814] _Bool assert__arg; [L815] assert__arg = __tmp_4 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=2, assert__arg=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=-1, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L816] COND TRUE assert__arg == 0 VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=2, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=-1, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L818] reach_error() VAL [__return_1709=1, __return_1837=1, __return_1955=1, __return_2060=1, __return_2183=0, __return_2197=0, __return_2292=0, __return_main=0, __tmp_2184_0=2, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=8, id3=5, init__r121=0, init__r311=0, m1=8, m2=5, m3=-1, main__i2=3, max1=8, max2=8, max3=5, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 294 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.0s, OverallIterations: 35, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 20.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38793 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38793 mSDsluCounter, 79681 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59805 mSDsCounter, 657 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15376 IncrementalHoareTripleChecker+Invalid, 16033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 657 mSolverCounterUnsat, 19876 mSDtfsCounter, 15376 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1931 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77900occurred in iteration=34, InterpolantAutomatonStates: 273, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 314717 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 5502 NumberOfCodeBlocks, 5502 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 5300 ConstructedInterpolants, 0 QuantifiedInterpolants, 27308 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 15:50:07,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE