./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.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 9fc8deb48660011a55df6a125b576e7008308183eeefddcba409d6b7b87cd69f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:43:13,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:43:13,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:43:13,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:43:13,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:43:13,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:43:13,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:43:13,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:43:13,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:43:13,668 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:43:13,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:43:13,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:43:13,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:43:13,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:43:13,672 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:43:13,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:43:13,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:43:13,673 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:43:13,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:43:13,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:43:13,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:43:13,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:43:13,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:43:13,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:43:13,678 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:43:13,679 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:43:13,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:43:13,679 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:43:13,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:43:13,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:43:13,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:43:13,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:43:13,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:43:13,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:43:13,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:43:13,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:43:13,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:43:13,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:43:13,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:43:13,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:43:13,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:43:13,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:43:13,684 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 -> 9fc8deb48660011a55df6a125b576e7008308183eeefddcba409d6b7b87cd69f [2024-10-14 03:43:13,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:43:14,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:43:14,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:43:14,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:43:14,022 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:43:14,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-10-14 03:43:15,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:43:15,718 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:43:15,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-10-14 03:43:15,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f60f7ee/cd23f42060434c86b770b9b41cf577b0/FLAGfee99fcc4 [2024-10-14 03:43:15,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f60f7ee/cd23f42060434c86b770b9b41cf577b0 [2024-10-14 03:43:15,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:43:15,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:43:15,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:43:15,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:43:15,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:43:15,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:43:15" (1/1) ... [2024-10-14 03:43:15,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159f701d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:15, skipping insertion in model container [2024-10-14 03:43:15,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:43:15" (1/1) ... [2024-10-14 03:43:15,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:43:16,060 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[9863,9876] [2024-10-14 03:43:16,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:43:16,150 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:43:16,247 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[9863,9876] [2024-10-14 03:43:16,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:43:16,347 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:43:16,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:16 WrapperNode [2024-10-14 03:43:16,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:43:16,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:43:16,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:43:16,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:43:16,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:16" (1/1) ... [2024-10-14 03:43:16,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:16" (1/1) ... [2024-10-14 03:43:16,432 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 930 [2024-10-14 03:43:16,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:43:16,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:43:16,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:43:16,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:43:16,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:16" (1/1) ... [2024-10-14 03:43:16,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:16" (1/1) ... [2024-10-14 03:43:16,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:16" (1/1) ... [2024-10-14 03:43:16,482 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:43:16,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:16" (1/1) ... [2024-10-14 03:43:16,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:16" (1/1) ... [2024-10-14 03:43:16,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:16" (1/1) ... [2024-10-14 03:43:16,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:16" (1/1) ... [2024-10-14 03:43:16,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:16" (1/1) ... [2024-10-14 03:43:16,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:16" (1/1) ... [2024-10-14 03:43:16,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:43:16,548 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:43:16,548 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:43:16,548 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:43:16,549 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:16" (1/1) ... [2024-10-14 03:43:16,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:43:16,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:43:16,598 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-10-14 03:43:16,601 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-10-14 03:43:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:43:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:43:16,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:43:16,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:43:16,862 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:43:16,865 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:43:17,728 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2024-10-14 03:43:17,730 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:43:17,795 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:43:17,797 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:43:17,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:43:17 BoogieIcfgContainer [2024-10-14 03:43:17,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:43:17,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:43:17,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:43:17,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:43:17,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:43:15" (1/3) ... [2024-10-14 03:43:17,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1f0503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:43:17, skipping insertion in model container [2024-10-14 03:43:17,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:43:16" (2/3) ... [2024-10-14 03:43:17,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1f0503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:43:17, skipping insertion in model container [2024-10-14 03:43:17,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:43:17" (3/3) ... [2024-10-14 03:43:17,808 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-10-14 03:43:17,825 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:43:17,826 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:43:17,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:43:17,905 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;@52504a2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:43:17,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:43:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 214 states have (on average 1.7850467289719627) internal successors, (382), 215 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:43:17,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:17,934 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] [2024-10-14 03:43:17,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:17,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:17,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1723196257, now seen corresponding path program 1 times [2024-10-14 03:43:17,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:17,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680632351] [2024-10-14 03:43:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:17,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:18,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:18,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680632351] [2024-10-14 03:43:18,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680632351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:18,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:18,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:18,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139493431] [2024-10-14 03:43:18,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:18,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:43:18,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:18,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:43:18,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:18,547 INFO L87 Difference]: Start difference. First operand has 216 states, 214 states have (on average 1.7850467289719627) internal successors, (382), 215 states have internal predecessors, (382), 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 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:18,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:18,694 INFO L93 Difference]: Finished difference Result 428 states and 750 transitions. [2024-10-14 03:43:18,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:43:18,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2024-10-14 03:43:18,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:18,716 INFO L225 Difference]: With dead ends: 428 [2024-10-14 03:43:18,717 INFO L226 Difference]: Without dead ends: 320 [2024-10-14 03:43:18,720 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-10-14 03:43:18,722 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 256 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:18,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 593 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:43:18,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-14 03:43:18,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2024-10-14 03:43:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.5362776025236593) internal successors, (487), 317 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 487 transitions. [2024-10-14 03:43:18,798 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 487 transitions. Word has length 93 [2024-10-14 03:43:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:18,802 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 487 transitions. [2024-10-14 03:43:18,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 487 transitions. [2024-10-14 03:43:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:43:18,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:18,809 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] [2024-10-14 03:43:18,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:43:18,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:18,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:18,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2057990842, now seen corresponding path program 1 times [2024-10-14 03:43:18,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:18,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022531187] [2024-10-14 03:43:18,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:18,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:19,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:19,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022531187] [2024-10-14 03:43:19,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022531187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:19,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:19,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:19,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657164463] [2024-10-14 03:43:19,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:19,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:43:19,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:19,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:43:19,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:43:19,386 INFO L87 Difference]: Start difference. First operand 318 states and 487 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:19,532 INFO L93 Difference]: Finished difference Result 1529 states and 2332 transitions. [2024-10-14 03:43:19,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:43:19,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2024-10-14 03:43:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:19,543 INFO L225 Difference]: With dead ends: 1529 [2024-10-14 03:43:19,544 INFO L226 Difference]: Without dead ends: 1219 [2024-10-14 03:43:19,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:19,547 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 890 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:19,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 1382 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:43:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-10-14 03:43:19,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 613. [2024-10-14 03:43:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 612 states have (on average 1.5179738562091503) internal successors, (929), 612 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 929 transitions. [2024-10-14 03:43:19,598 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 929 transitions. Word has length 93 [2024-10-14 03:43:19,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:19,599 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 929 transitions. [2024-10-14 03:43:19,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 929 transitions. [2024-10-14 03:43:19,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 03:43:19,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:19,605 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] [2024-10-14 03:43:19,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:43:19,606 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:19,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:19,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1372675202, now seen corresponding path program 1 times [2024-10-14 03:43:19,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:19,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561477938] [2024-10-14 03:43:19,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:19,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:19,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:19,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561477938] [2024-10-14 03:43:19,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561477938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:19,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:19,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:19,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979428796] [2024-10-14 03:43:19,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:19,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:43:19,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:19,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:43:19,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:19,709 INFO L87 Difference]: Start difference. First operand 613 states and 929 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:19,734 INFO L93 Difference]: Finished difference Result 1201 states and 1816 transitions. [2024-10-14 03:43:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:43:19,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-10-14 03:43:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:19,738 INFO L225 Difference]: With dead ends: 1201 [2024-10-14 03:43:19,738 INFO L226 Difference]: Without dead ends: 615 [2024-10-14 03:43:19,742 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-10-14 03:43:19,746 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:19,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 631 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-10-14 03:43:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2024-10-14 03:43:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.51628664495114) internal successors, (931), 614 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 931 transitions. [2024-10-14 03:43:19,764 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 931 transitions. Word has length 94 [2024-10-14 03:43:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:19,764 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 931 transitions. [2024-10-14 03:43:19,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:19,765 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 931 transitions. [2024-10-14 03:43:19,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 03:43:19,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:19,768 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] [2024-10-14 03:43:19,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:43:19,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:19,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:19,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1703142857, now seen corresponding path program 1 times [2024-10-14 03:43:19,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:19,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786549906] [2024-10-14 03:43:19,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:19,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:19,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:19,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786549906] [2024-10-14 03:43:19,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786549906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:19,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:19,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:19,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828001671] [2024-10-14 03:43:19,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:19,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:43:19,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:19,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:43:19,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:19,890 INFO L87 Difference]: Start difference. First operand 615 states and 931 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:19,945 INFO L93 Difference]: Finished difference Result 1627 states and 2488 transitions. [2024-10-14 03:43:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:43:19,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-10-14 03:43:19,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:19,951 INFO L225 Difference]: With dead ends: 1627 [2024-10-14 03:43:19,951 INFO L226 Difference]: Without dead ends: 1189 [2024-10-14 03:43:19,952 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-10-14 03:43:19,952 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 251 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:19,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 854 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:19,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2024-10-14 03:43:19,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1187. [2024-10-14 03:43:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1186 states have (on average 1.5025295109612142) internal successors, (1782), 1186 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1782 transitions. [2024-10-14 03:43:19,986 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1782 transitions. Word has length 95 [2024-10-14 03:43:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:19,988 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1782 transitions. [2024-10-14 03:43:19,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:19,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1782 transitions. [2024-10-14 03:43:19,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 03:43:19,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:19,991 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] [2024-10-14 03:43:19,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:43:19,992 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:19,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:19,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1745893292, now seen corresponding path program 1 times [2024-10-14 03:43:19,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:19,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618896242] [2024-10-14 03:43:19,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:19,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:20,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:20,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618896242] [2024-10-14 03:43:20,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618896242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:20,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:20,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:20,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138734463] [2024-10-14 03:43:20,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:20,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:43:20,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:20,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:43:20,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:43:20,327 INFO L87 Difference]: Start difference. First operand 1187 states and 1782 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:20,417 INFO L93 Difference]: Finished difference Result 3285 states and 4942 transitions. [2024-10-14 03:43:20,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:43:20,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-10-14 03:43:20,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:20,427 INFO L225 Difference]: With dead ends: 3285 [2024-10-14 03:43:20,427 INFO L226 Difference]: Without dead ends: 2147 [2024-10-14 03:43:20,429 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-10-14 03:43:20,430 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 264 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:20,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1097 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:20,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2024-10-14 03:43:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2145. [2024-10-14 03:43:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 2144 states have (on average 1.4972014925373134) internal successors, (3210), 2144 states have internal predecessors, (3210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3210 transitions. [2024-10-14 03:43:20,489 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3210 transitions. Word has length 95 [2024-10-14 03:43:20,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:20,490 INFO L471 AbstractCegarLoop]: Abstraction has 2145 states and 3210 transitions. [2024-10-14 03:43:20,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3210 transitions. [2024-10-14 03:43:20,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 03:43:20,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:20,493 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] [2024-10-14 03:43:20,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:43:20,494 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:20,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:20,495 INFO L85 PathProgramCache]: Analyzing trace with hash -769324729, now seen corresponding path program 1 times [2024-10-14 03:43:20,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:20,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448582324] [2024-10-14 03:43:20,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:20,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:20,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:20,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:20,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448582324] [2024-10-14 03:43:20,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448582324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:20,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:20,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:43:20,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933621458] [2024-10-14 03:43:20,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:20,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:43:20,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:20,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:43:20,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:43:20,917 INFO L87 Difference]: Start difference. First operand 2145 states and 3210 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:20,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:20,976 INFO L93 Difference]: Finished difference Result 3376 states and 5065 transitions. [2024-10-14 03:43:20,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:43:20,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 95 [2024-10-14 03:43:20,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:20,986 INFO L225 Difference]: With dead ends: 3376 [2024-10-14 03:43:20,986 INFO L226 Difference]: Without dead ends: 1398 [2024-10-14 03:43:20,989 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-10-14 03:43:20,990 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 24 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:20,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1028 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-14 03:43:21,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1398. [2024-10-14 03:43:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1397 states have (on average 1.4838940586972083) internal successors, (2073), 1397 states have internal predecessors, (2073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2073 transitions. [2024-10-14 03:43:21,028 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2073 transitions. Word has length 95 [2024-10-14 03:43:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:21,028 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 2073 transitions. [2024-10-14 03:43:21,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2073 transitions. [2024-10-14 03:43:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:43:21,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:21,030 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] [2024-10-14 03:43:21,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:43:21,030 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:21,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:21,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1084412032, now seen corresponding path program 1 times [2024-10-14 03:43:21,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:21,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979632426] [2024-10-14 03:43:21,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:21,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:21,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979632426] [2024-10-14 03:43:21,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979632426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:21,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:21,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:21,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967852296] [2024-10-14 03:43:21,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:21,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:43:21,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:21,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:43:21,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:21,128 INFO L87 Difference]: Start difference. First operand 1398 states and 2073 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:21,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:21,178 INFO L93 Difference]: Finished difference Result 3688 states and 5528 transitions. [2024-10-14 03:43:21,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:43:21,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 99 [2024-10-14 03:43:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:21,188 INFO L225 Difference]: With dead ends: 3688 [2024-10-14 03:43:21,188 INFO L226 Difference]: Without dead ends: 2637 [2024-10-14 03:43:21,193 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-10-14 03:43:21,193 INFO L432 NwaCegarLoop]: 591 mSDtfsCounter, 245 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:21,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 880 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:21,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2024-10-14 03:43:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2635. [2024-10-14 03:43:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2634 states have (on average 1.4715261958997723) internal successors, (3876), 2634 states have internal predecessors, (3876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:21,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3876 transitions. [2024-10-14 03:43:21,259 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3876 transitions. Word has length 99 [2024-10-14 03:43:21,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:21,260 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 3876 transitions. [2024-10-14 03:43:21,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3876 transitions. [2024-10-14 03:43:21,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:43:21,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:21,263 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] [2024-10-14 03:43:21,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:43:21,263 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:21,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:21,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1344050339, now seen corresponding path program 1 times [2024-10-14 03:43:21,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:21,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438284883] [2024-10-14 03:43:21,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:21,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:21,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:21,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438284883] [2024-10-14 03:43:21,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438284883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:21,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:21,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:43:21,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539056979] [2024-10-14 03:43:21,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:21,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:43:21,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:21,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:43:21,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:21,442 INFO L87 Difference]: Start difference. First operand 2635 states and 3876 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:21,580 INFO L93 Difference]: Finished difference Result 4908 states and 7301 transitions. [2024-10-14 03:43:21,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:43:21,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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 99 [2024-10-14 03:43:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:21,590 INFO L225 Difference]: With dead ends: 4908 [2024-10-14 03:43:21,590 INFO L226 Difference]: Without dead ends: 2635 [2024-10-14 03:43:21,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:43:21,594 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 785 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:21,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 334 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:43:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-10-14 03:43:21,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2635. [2024-10-14 03:43:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2634 states have (on average 1.4567198177676537) internal successors, (3837), 2634 states have internal predecessors, (3837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3837 transitions. [2024-10-14 03:43:21,655 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3837 transitions. Word has length 99 [2024-10-14 03:43:21,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:21,655 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 3837 transitions. [2024-10-14 03:43:21,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3837 transitions. [2024-10-14 03:43:21,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:43:21,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:21,658 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] [2024-10-14 03:43:21,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:43:21,659 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:21,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:21,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2089730754, now seen corresponding path program 1 times [2024-10-14 03:43:21,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:21,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672138262] [2024-10-14 03:43:21,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:21,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:21,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:21,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672138262] [2024-10-14 03:43:21,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672138262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:21,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:21,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:43:21,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894903307] [2024-10-14 03:43:21,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:21,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:43:22,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:22,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:43:22,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:43:22,001 INFO L87 Difference]: Start difference. First operand 2635 states and 3837 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:22,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:22,042 INFO L93 Difference]: Finished difference Result 4581 states and 6694 transitions. [2024-10-14 03:43:22,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:43:22,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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 99 [2024-10-14 03:43:22,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:22,051 INFO L225 Difference]: With dead ends: 4581 [2024-10-14 03:43:22,051 INFO L226 Difference]: Without dead ends: 2155 [2024-10-14 03:43:22,054 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-10-14 03:43:22,056 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 20 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:22,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1002 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2024-10-14 03:43:22,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2155. [2024-10-14 03:43:22,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2154 states have (on average 1.446146703806871) internal successors, (3115), 2154 states have internal predecessors, (3115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 3115 transitions. [2024-10-14 03:43:22,109 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 3115 transitions. Word has length 99 [2024-10-14 03:43:22,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:22,109 INFO L471 AbstractCegarLoop]: Abstraction has 2155 states and 3115 transitions. [2024-10-14 03:43:22,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 3115 transitions. [2024-10-14 03:43:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 03:43:22,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:22,112 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] [2024-10-14 03:43:22,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:43:22,112 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:22,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:22,113 INFO L85 PathProgramCache]: Analyzing trace with hash -113060080, now seen corresponding path program 1 times [2024-10-14 03:43:22,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:22,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853819214] [2024-10-14 03:43:22,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:22,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:22,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:22,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:22,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853819214] [2024-10-14 03:43:22,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853819214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:22,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:22,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:22,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417456419] [2024-10-14 03:43:22,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:22,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:43:22,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:22,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:43:22,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:43:22,426 INFO L87 Difference]: Start difference. First operand 2155 states and 3115 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:22,535 INFO L93 Difference]: Finished difference Result 8132 states and 11713 transitions. [2024-10-14 03:43:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:43:22,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2024-10-14 03:43:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:22,557 INFO L225 Difference]: With dead ends: 8132 [2024-10-14 03:43:22,557 INFO L226 Difference]: Without dead ends: 6041 [2024-10-14 03:43:22,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:43:22,564 INFO L432 NwaCegarLoop]: 495 mSDtfsCounter, 558 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:22,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1032 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:43:22,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2024-10-14 03:43:22,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 4102. [2024-10-14 03:43:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4102 states, 4101 states have (on average 1.4303828334552549) internal successors, (5866), 4101 states have internal predecessors, (5866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5866 transitions. [2024-10-14 03:43:22,686 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5866 transitions. Word has length 101 [2024-10-14 03:43:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:22,687 INFO L471 AbstractCegarLoop]: Abstraction has 4102 states and 5866 transitions. [2024-10-14 03:43:22,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5866 transitions. [2024-10-14 03:43:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 03:43:22,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:22,691 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] [2024-10-14 03:43:22,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:43:22,691 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:22,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:22,692 INFO L85 PathProgramCache]: Analyzing trace with hash -2117390962, now seen corresponding path program 1 times [2024-10-14 03:43:22,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:22,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433524542] [2024-10-14 03:43:22,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:22,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:22,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:22,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:22,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433524542] [2024-10-14 03:43:22,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433524542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:22,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:22,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:22,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135617764] [2024-10-14 03:43:22,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:22,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:43:22,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:22,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:43:22,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:22,754 INFO L87 Difference]: Start difference. First operand 4102 states and 5866 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:22,796 INFO L93 Difference]: Finished difference Result 8094 states and 11581 transitions. [2024-10-14 03:43:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:43:22,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 102 [2024-10-14 03:43:22,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:22,810 INFO L225 Difference]: With dead ends: 8094 [2024-10-14 03:43:22,810 INFO L226 Difference]: Without dead ends: 4110 [2024-10-14 03:43:22,816 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-10-14 03:43:22,816 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:22,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 615 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4110 states. [2024-10-14 03:43:22,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4110 to 4110. [2024-10-14 03:43:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4110 states, 4109 states have (on average 1.4295449014358725) internal successors, (5874), 4109 states have internal predecessors, (5874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4110 states to 4110 states and 5874 transitions. [2024-10-14 03:43:22,887 INFO L78 Accepts]: Start accepts. Automaton has 4110 states and 5874 transitions. Word has length 102 [2024-10-14 03:43:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:22,887 INFO L471 AbstractCegarLoop]: Abstraction has 4110 states and 5874 transitions. [2024-10-14 03:43:22,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4110 states and 5874 transitions. [2024-10-14 03:43:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:43:22,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:22,891 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] [2024-10-14 03:43:22,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:43:22,891 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:22,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:22,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1460784431, now seen corresponding path program 1 times [2024-10-14 03:43:22,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:22,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336797295] [2024-10-14 03:43:22,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:22,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:23,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:23,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336797295] [2024-10-14 03:43:23,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336797295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:23,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:23,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:43:23,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501907435] [2024-10-14 03:43:23,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:23,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:43:23,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:23,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:43:23,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:43:23,214 INFO L87 Difference]: Start difference. First operand 4110 states and 5874 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:23,261 INFO L93 Difference]: Finished difference Result 8172 states and 11677 transitions. [2024-10-14 03:43:23,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:43:23,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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 103 [2024-10-14 03:43:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:23,277 INFO L225 Difference]: With dead ends: 8172 [2024-10-14 03:43:23,281 INFO L226 Difference]: Without dead ends: 4102 [2024-10-14 03:43:23,287 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-10-14 03:43:23,288 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 14 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:23,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 982 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2024-10-14 03:43:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 4102. [2024-10-14 03:43:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4102 states, 4101 states have (on average 1.428432089734211) internal successors, (5858), 4101 states have internal predecessors, (5858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5858 transitions. [2024-10-14 03:43:23,394 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5858 transitions. Word has length 103 [2024-10-14 03:43:23,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:23,395 INFO L471 AbstractCegarLoop]: Abstraction has 4102 states and 5858 transitions. [2024-10-14 03:43:23,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:23,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5858 transitions. [2024-10-14 03:43:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:43:23,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:23,399 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] [2024-10-14 03:43:23,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:43:23,399 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:23,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:23,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1424262171, now seen corresponding path program 1 times [2024-10-14 03:43:23,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:23,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528544907] [2024-10-14 03:43:23,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:23,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:23,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:23,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528544907] [2024-10-14 03:43:23,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528544907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:23,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:23,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:23,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907056491] [2024-10-14 03:43:23,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:23,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:43:23,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:23,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:43:23,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:23,485 INFO L87 Difference]: Start difference. First operand 4102 states and 5858 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:23,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:23,546 INFO L93 Difference]: Finished difference Result 9389 states and 13538 transitions. [2024-10-14 03:43:23,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:43:23,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 103 [2024-10-14 03:43:23,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:23,557 INFO L225 Difference]: With dead ends: 9389 [2024-10-14 03:43:23,558 INFO L226 Difference]: Without dead ends: 6093 [2024-10-14 03:43:23,562 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-10-14 03:43:23,563 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 232 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:23,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 828 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6093 states. [2024-10-14 03:43:23,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6093 to 6091. [2024-10-14 03:43:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6091 states, 6090 states have (on average 1.4045977011494253) internal successors, (8554), 6090 states have internal predecessors, (8554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6091 states to 6091 states and 8554 transitions. [2024-10-14 03:43:23,670 INFO L78 Accepts]: Start accepts. Automaton has 6091 states and 8554 transitions. Word has length 103 [2024-10-14 03:43:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:23,671 INFO L471 AbstractCegarLoop]: Abstraction has 6091 states and 8554 transitions. [2024-10-14 03:43:23,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 6091 states and 8554 transitions. [2024-10-14 03:43:23,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 03:43:23,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:23,677 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] [2024-10-14 03:43:23,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:43:23,677 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:23,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:23,678 INFO L85 PathProgramCache]: Analyzing trace with hash 94977779, now seen corresponding path program 1 times [2024-10-14 03:43:23,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:23,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624525151] [2024-10-14 03:43:23,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:23,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:23,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-10-14 03:43:23,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:23,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624525151] [2024-10-14 03:43:23,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624525151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:23,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:23,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:23,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380212530] [2024-10-14 03:43:23,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:23,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:43:23,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:23,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:43:23,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:43:23,970 INFO L87 Difference]: Start difference. First operand 6091 states and 8554 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:24,059 INFO L93 Difference]: Finished difference Result 11341 states and 15929 transitions. [2024-10-14 03:43:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:43:24,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 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 105 [2024-10-14 03:43:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:24,069 INFO L225 Difference]: With dead ends: 11341 [2024-10-14 03:43:24,070 INFO L226 Difference]: Without dead ends: 5518 [2024-10-14 03:43:24,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:24,077 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 245 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:24,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1221 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2024-10-14 03:43:24,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 5332. [2024-10-14 03:43:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5332 states, 5331 states have (on average 1.4031138623147628) internal successors, (7480), 5331 states have internal predecessors, (7480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:24,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5332 states to 5332 states and 7480 transitions. [2024-10-14 03:43:24,170 INFO L78 Accepts]: Start accepts. Automaton has 5332 states and 7480 transitions. Word has length 105 [2024-10-14 03:43:24,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:24,170 INFO L471 AbstractCegarLoop]: Abstraction has 5332 states and 7480 transitions. [2024-10-14 03:43:24,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:24,170 INFO L276 IsEmpty]: Start isEmpty. Operand 5332 states and 7480 transitions. [2024-10-14 03:43:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 03:43:24,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:24,176 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] [2024-10-14 03:43:24,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:43:24,176 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:24,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:24,177 INFO L85 PathProgramCache]: Analyzing trace with hash -795948558, now seen corresponding path program 1 times [2024-10-14 03:43:24,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:24,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299812569] [2024-10-14 03:43:24,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:24,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:24,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:24,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299812569] [2024-10-14 03:43:24,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299812569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:24,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:24,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:24,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723613719] [2024-10-14 03:43:24,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:24,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:43:24,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:24,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:43:24,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:24,261 INFO L87 Difference]: Start difference. First operand 5332 states and 7480 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:24,305 INFO L93 Difference]: Finished difference Result 9792 states and 13892 transitions. [2024-10-14 03:43:24,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:43:24,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 106 [2024-10-14 03:43:24,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:24,318 INFO L225 Difference]: With dead ends: 9792 [2024-10-14 03:43:24,319 INFO L226 Difference]: Without dead ends: 7073 [2024-10-14 03:43:24,327 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-10-14 03:43:24,328 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 278 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 646 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-10-14 03:43:24,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 646 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7073 states. [2024-10-14 03:43:24,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7073 to 5332. [2024-10-14 03:43:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5332 states, 5331 states have (on average 1.402738698180454) internal successors, (7478), 5331 states have internal predecessors, (7478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:24,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5332 states to 5332 states and 7478 transitions. [2024-10-14 03:43:24,465 INFO L78 Accepts]: Start accepts. Automaton has 5332 states and 7478 transitions. Word has length 106 [2024-10-14 03:43:24,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:24,465 INFO L471 AbstractCegarLoop]: Abstraction has 5332 states and 7478 transitions. [2024-10-14 03:43:24,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:24,465 INFO L276 IsEmpty]: Start isEmpty. Operand 5332 states and 7478 transitions. [2024-10-14 03:43:24,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 03:43:24,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:24,471 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] [2024-10-14 03:43:24,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:43:24,472 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:24,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:24,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1942020666, now seen corresponding path program 1 times [2024-10-14 03:43:24,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:24,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736058660] [2024-10-14 03:43:24,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:24,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:24,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:24,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736058660] [2024-10-14 03:43:24,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736058660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:24,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:24,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:24,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764462516] [2024-10-14 03:43:24,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:24,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:43:24,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:24,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:43:24,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:43:24,786 INFO L87 Difference]: Start difference. First operand 5332 states and 7478 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:24,912 INFO L93 Difference]: Finished difference Result 16040 states and 22443 transitions. [2024-10-14 03:43:24,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:43:24,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 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 107 [2024-10-14 03:43:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:24,934 INFO L225 Difference]: With dead ends: 16040 [2024-10-14 03:43:24,934 INFO L226 Difference]: Without dead ends: 10845 [2024-10-14 03:43:24,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:24,945 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 807 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:24,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1169 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:43:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10845 states. [2024-10-14 03:43:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10845 to 5454. [2024-10-14 03:43:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5454 states, 5453 states have (on average 1.3929946818265175) internal successors, (7596), 5453 states have internal predecessors, (7596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5454 states to 5454 states and 7596 transitions. [2024-10-14 03:43:25,118 INFO L78 Accepts]: Start accepts. Automaton has 5454 states and 7596 transitions. Word has length 107 [2024-10-14 03:43:25,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:25,118 INFO L471 AbstractCegarLoop]: Abstraction has 5454 states and 7596 transitions. [2024-10-14 03:43:25,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 5454 states and 7596 transitions. [2024-10-14 03:43:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 03:43:25,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:25,124 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] [2024-10-14 03:43:25,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:43:25,124 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:25,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:25,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1701055636, now seen corresponding path program 1 times [2024-10-14 03:43:25,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:25,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816358232] [2024-10-14 03:43:25,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:25,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:25,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:25,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:25,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816358232] [2024-10-14 03:43:25,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816358232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:25,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:25,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:25,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131410755] [2024-10-14 03:43:25,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:25,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:43:25,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:25,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:43:25,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:43:25,188 INFO L87 Difference]: Start difference. First operand 5454 states and 7596 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:25,230 INFO L93 Difference]: Finished difference Result 9154 states and 12867 transitions. [2024-10-14 03:43:25,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:43:25,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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 108 [2024-10-14 03:43:25,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:25,240 INFO L225 Difference]: With dead ends: 9154 [2024-10-14 03:43:25,240 INFO L226 Difference]: Without dead ends: 5466 [2024-10-14 03:43:25,246 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-10-14 03:43:25,246 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:25,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 605 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2024-10-14 03:43:25,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 5466. [2024-10-14 03:43:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5466 states, 5465 states have (on average 1.392131747483989) internal successors, (7608), 5465 states have internal predecessors, (7608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 7608 transitions. [2024-10-14 03:43:25,332 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 7608 transitions. Word has length 108 [2024-10-14 03:43:25,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:25,332 INFO L471 AbstractCegarLoop]: Abstraction has 5466 states and 7608 transitions. [2024-10-14 03:43:25,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:25,332 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 7608 transitions. [2024-10-14 03:43:25,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 03:43:25,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:25,337 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] [2024-10-14 03:43:25,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:43:25,338 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:25,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:25,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1197791963, now seen corresponding path program 1 times [2024-10-14 03:43:25,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:25,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509896940] [2024-10-14 03:43:25,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:25,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:25,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:25,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509896940] [2024-10-14 03:43:25,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509896940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:25,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:25,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:43:25,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66924787] [2024-10-14 03:43:25,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:25,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:43:25,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:25,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:43:25,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:25,624 INFO L87 Difference]: Start difference. First operand 5466 states and 7608 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:25,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:25,768 INFO L93 Difference]: Finished difference Result 11220 states and 16654 transitions. [2024-10-14 03:43:25,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:43:25,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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 109 [2024-10-14 03:43:25,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:25,784 INFO L225 Difference]: With dead ends: 11220 [2024-10-14 03:43:25,784 INFO L226 Difference]: Without dead ends: 8343 [2024-10-14 03:43:25,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:43:25,793 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 176 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:25,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 984 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:43:25,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8343 states. [2024-10-14 03:43:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8343 to 8320. [2024-10-14 03:43:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8320 states, 8319 states have (on average 1.4379132107224426) internal successors, (11962), 8319 states have internal predecessors, (11962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8320 states to 8320 states and 11962 transitions. [2024-10-14 03:43:25,952 INFO L78 Accepts]: Start accepts. Automaton has 8320 states and 11962 transitions. Word has length 109 [2024-10-14 03:43:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:25,952 INFO L471 AbstractCegarLoop]: Abstraction has 8320 states and 11962 transitions. [2024-10-14 03:43:25,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 8320 states and 11962 transitions. [2024-10-14 03:43:25,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 03:43:25,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:25,957 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] [2024-10-14 03:43:25,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:43:25,958 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:25,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:25,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1376261686, now seen corresponding path program 1 times [2024-10-14 03:43:25,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:25,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968458673] [2024-10-14 03:43:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:25,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:26,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:26,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968458673] [2024-10-14 03:43:26,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968458673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:26,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:26,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:43:26,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505209095] [2024-10-14 03:43:26,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:26,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:43:26,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:26,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:43:26,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:43:26,359 INFO L87 Difference]: Start difference. First operand 8320 states and 11962 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:26,476 INFO L93 Difference]: Finished difference Result 14490 states and 21403 transitions. [2024-10-14 03:43:26,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:43:26,476 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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 109 [2024-10-14 03:43:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:26,491 INFO L225 Difference]: With dead ends: 14490 [2024-10-14 03:43:26,491 INFO L226 Difference]: Without dead ends: 8322 [2024-10-14 03:43:26,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:43:26,501 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 411 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:26,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 914 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:43:26,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8322 states. [2024-10-14 03:43:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8322 to 8320. [2024-10-14 03:43:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8320 states, 8319 states have (on average 1.4303401851184037) internal successors, (11899), 8319 states have internal predecessors, (11899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8320 states to 8320 states and 11899 transitions. [2024-10-14 03:43:26,746 INFO L78 Accepts]: Start accepts. Automaton has 8320 states and 11899 transitions. Word has length 109 [2024-10-14 03:43:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:26,746 INFO L471 AbstractCegarLoop]: Abstraction has 8320 states and 11899 transitions. [2024-10-14 03:43:26,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:26,747 INFO L276 IsEmpty]: Start isEmpty. Operand 8320 states and 11899 transitions. [2024-10-14 03:43:26,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 03:43:26,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:26,751 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] [2024-10-14 03:43:26,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:43:26,751 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:26,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:26,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1892343290, now seen corresponding path program 1 times [2024-10-14 03:43:26,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:26,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041991457] [2024-10-14 03:43:26,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:26,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:27,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:27,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041991457] [2024-10-14 03:43:27,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041991457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:27,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:27,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:43:27,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375118056] [2024-10-14 03:43:27,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:27,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:43:27,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:27,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:43:27,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:43:27,031 INFO L87 Difference]: Start difference. First operand 8320 states and 11899 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:27,119 INFO L93 Difference]: Finished difference Result 16786 states and 23943 transitions. [2024-10-14 03:43:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:43:27,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 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 109 [2024-10-14 03:43:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:27,135 INFO L225 Difference]: With dead ends: 16786 [2024-10-14 03:43:27,135 INFO L226 Difference]: Without dead ends: 8742 [2024-10-14 03:43:27,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:43:27,147 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 245 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:27,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1178 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:27,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8742 states. [2024-10-14 03:43:27,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8742 to 8503. [2024-10-14 03:43:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8503 states, 8502 states have (on average 1.4213126323218066) internal successors, (12084), 8502 states have internal predecessors, (12084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:27,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8503 states to 8503 states and 12084 transitions. [2024-10-14 03:43:27,282 INFO L78 Accepts]: Start accepts. Automaton has 8503 states and 12084 transitions. Word has length 109 [2024-10-14 03:43:27,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:27,282 INFO L471 AbstractCegarLoop]: Abstraction has 8503 states and 12084 transitions. [2024-10-14 03:43:27,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 8503 states and 12084 transitions. [2024-10-14 03:43:27,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 03:43:27,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:27,287 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] [2024-10-14 03:43:27,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:43:27,288 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:27,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:27,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1377707653, now seen corresponding path program 1 times [2024-10-14 03:43:27,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:27,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064069725] [2024-10-14 03:43:27,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:27,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:27,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:27,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:27,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064069725] [2024-10-14 03:43:27,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064069725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:27,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:27,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:43:27,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752503602] [2024-10-14 03:43:27,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:27,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:43:27,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:27,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:43:27,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:43:27,702 INFO L87 Difference]: Start difference. First operand 8503 states and 12084 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:27,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:27,754 INFO L93 Difference]: Finished difference Result 11682 states and 16741 transitions. [2024-10-14 03:43:27,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:43:27,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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 109 [2024-10-14 03:43:27,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:27,769 INFO L225 Difference]: With dead ends: 11682 [2024-10-14 03:43:27,769 INFO L226 Difference]: Without dead ends: 7373 [2024-10-14 03:43:27,777 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-10-14 03:43:27,778 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 0 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:27,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 931 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:43:27,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7373 states. [2024-10-14 03:43:27,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7373 to 7370. [2024-10-14 03:43:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7370 states, 7369 states have (on average 1.4187813814628851) internal successors, (10455), 7369 states have internal predecessors, (10455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7370 states to 7370 states and 10455 transitions. [2024-10-14 03:43:27,944 INFO L78 Accepts]: Start accepts. Automaton has 7370 states and 10455 transitions. Word has length 109 [2024-10-14 03:43:27,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:27,944 INFO L471 AbstractCegarLoop]: Abstraction has 7370 states and 10455 transitions. [2024-10-14 03:43:27,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:27,945 INFO L276 IsEmpty]: Start isEmpty. Operand 7370 states and 10455 transitions. [2024-10-14 03:43:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:43:27,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:27,950 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] [2024-10-14 03:43:27,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:43:27,951 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:27,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash 162902571, now seen corresponding path program 1 times [2024-10-14 03:43:27,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:27,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194163505] [2024-10-14 03:43:27,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:27,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:43:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:43:29,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:43:29,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194163505] [2024-10-14 03:43:29,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194163505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:43:29,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:43:29,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-14 03:43:29,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843153908] [2024-10-14 03:43:29,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:43:29,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 03:43:29,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:43:29,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 03:43:29,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2024-10-14 03:43:29,846 INFO L87 Difference]: Start difference. First operand 7370 states and 10455 transitions. Second operand has 21 states, 21 states have (on average 5.285714285714286) internal successors, (111), 20 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:43:32,656 INFO L93 Difference]: Finished difference Result 13283 states and 19189 transitions. [2024-10-14 03:43:32,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 03:43:32,656 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.285714285714286) internal successors, (111), 20 states have internal predecessors, (111), 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 111 [2024-10-14 03:43:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:43:32,677 INFO L225 Difference]: With dead ends: 13283 [2024-10-14 03:43:32,678 INFO L226 Difference]: Without dead ends: 10907 [2024-10-14 03:43:32,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=241, Invalid=949, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 03:43:32,685 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 1365 mSDsluCounter, 4180 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 4568 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:43:32,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 4568 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 03:43:32,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10907 states. [2024-10-14 03:43:32,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10907 to 7871. [2024-10-14 03:43:32,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7871 states, 7870 states have (on average 1.4063532401524779) internal successors, (11068), 7870 states have internal predecessors, (11068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7871 states to 7871 states and 11068 transitions. [2024-10-14 03:43:32,873 INFO L78 Accepts]: Start accepts. Automaton has 7871 states and 11068 transitions. Word has length 111 [2024-10-14 03:43:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:43:32,874 INFO L471 AbstractCegarLoop]: Abstraction has 7871 states and 11068 transitions. [2024-10-14 03:43:32,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.285714285714286) internal successors, (111), 20 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:43:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 7871 states and 11068 transitions. [2024-10-14 03:43:32,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:43:32,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:43:32,879 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] [2024-10-14 03:43:32,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 03:43:32,880 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:43:32,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:43:32,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1561366889, now seen corresponding path program 1 times [2024-10-14 03:43:32,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:43:32,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057535440] [2024-10-14 03:43:32,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:43:32,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:43:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:43:32,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 03:43:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:43:33,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 03:43:33,056 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 03:43:33,057 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:43:33,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 03:43:33,061 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] [2024-10-14 03:43:33,215 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:43:33,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:43:33 BoogieIcfgContainer [2024-10-14 03:43:33,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:43:33,221 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:43:33,221 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:43:33,221 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:43:33,222 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:43:17" (3/4) ... [2024-10-14 03:43:33,222 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 03:43:33,405 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:43:33,406 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:43:33,406 INFO L158 Benchmark]: Toolchain (without parser) took 17653.17ms. Allocated memory was 157.3MB in the beginning and 933.2MB in the end (delta: 775.9MB). Free memory was 118.2MB in the beginning and 720.7MB in the end (delta: -602.4MB). Peak memory consumption was 173.5MB. Max. memory is 16.1GB. [2024-10-14 03:43:33,406 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 98.6MB. Free memory is still 70.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:43:33,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.85ms. Allocated memory is still 157.3MB. Free memory was 118.0MB in the beginning and 92.1MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 03:43:33,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.34ms. Allocated memory is still 157.3MB. Free memory was 92.1MB in the beginning and 87.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 03:43:33,407 INFO L158 Benchmark]: Boogie Preprocessor took 113.26ms. Allocated memory is still 157.3MB. Free memory was 87.3MB in the beginning and 82.3MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 03:43:33,407 INFO L158 Benchmark]: RCFGBuilder took 1250.21ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 82.3MB in the beginning and 154.5MB in the end (delta: -72.2MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-10-14 03:43:33,408 INFO L158 Benchmark]: TraceAbstraction took 15419.36ms. Allocated memory was 209.7MB in the beginning and 933.2MB in the end (delta: 723.5MB). Free memory was 154.5MB in the beginning and 755.6MB in the end (delta: -601.1MB). Peak memory consumption was 122.2MB. Max. memory is 16.1GB. [2024-10-14 03:43:33,408 INFO L158 Benchmark]: Witness Printer took 185.06ms. Allocated memory is still 933.2MB. Free memory was 755.6MB in the beginning and 720.7MB in the end (delta: 34.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-14 03:43:33,413 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.09ms. Allocated memory is still 98.6MB. Free memory is still 70.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 593.85ms. Allocated memory is still 157.3MB. Free memory was 118.0MB in the beginning and 92.1MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.34ms. Allocated memory is still 157.3MB. Free memory was 92.1MB in the beginning and 87.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.26ms. Allocated memory is still 157.3MB. Free memory was 87.3MB in the beginning and 82.3MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1250.21ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 82.3MB in the beginning and 154.5MB in the end (delta: -72.2MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15419.36ms. Allocated memory was 209.7MB in the beginning and 933.2MB in the end (delta: 723.5MB). Free memory was 154.5MB in the beginning and 755.6MB in the end (delta: -601.1MB). Peak memory consumption was 122.2MB. Max. memory is 16.1GB. * Witness Printer took 185.06ms. Allocated memory is still 933.2MB. Free memory was 755.6MB in the beginning and 720.7MB in the end (delta: 34.9MB). Peak memory consumption was 35.7MB. 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: 541]: 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_1131; [L79] int __return_1259; [L80] int __return_1378; [L81] int __tmp_1379_0; [L82] int __return_1487; [L83] int __return_1392; [L86] int main__c1; [L87] int main__i2; [L88] main__c1 = 0 [L89] ep12 = __VERIFIER_nondet_bool() [L90] ep13 = __VERIFIER_nondet_bool() [L91] ep21 = __VERIFIER_nondet_bool() [L92] ep23 = __VERIFIER_nondet_bool() [L93] ep31 = __VERIFIER_nondet_bool() [L94] ep32 = __VERIFIER_nondet_bool() [L95] id1 = __VERIFIER_nondet_char() [L96] r1 = __VERIFIER_nondet_char() [L97] st1 = __VERIFIER_nondet_char() [L98] nl1 = __VERIFIER_nondet_char() [L99] m1 = __VERIFIER_nondet_char() [L100] max1 = __VERIFIER_nondet_char() [L101] mode1 = __VERIFIER_nondet_bool() [L102] id2 = __VERIFIER_nondet_char() [L103] r2 = __VERIFIER_nondet_char() [L104] st2 = __VERIFIER_nondet_char() [L105] nl2 = __VERIFIER_nondet_char() [L106] m2 = __VERIFIER_nondet_char() [L107] max2 = __VERIFIER_nondet_char() [L108] mode2 = __VERIFIER_nondet_bool() [L109] id3 = __VERIFIER_nondet_char() [L110] r3 = __VERIFIER_nondet_char() [L111] st3 = __VERIFIER_nondet_char() [L112] nl3 = __VERIFIER_nondet_char() [L113] m3 = __VERIFIER_nondet_char() [L114] max3 = __VERIFIER_nondet_char() [L115] mode3 = __VERIFIER_nondet_bool() [L117] _Bool init__r121; [L118] _Bool init__r131; [L119] _Bool init__r211; [L120] _Bool init__r231; [L121] _Bool init__r311; [L122] _Bool init__r321; [L123] _Bool init__r122; [L124] int init__tmp; [L125] _Bool init__r132; [L126] int init__tmp___0; [L127] _Bool init__r212; [L128] int init__tmp___1; [L129] _Bool init__r232; [L130] int init__tmp___2; [L131] _Bool init__r312; [L132] int init__tmp___3; [L133] _Bool init__r322; [L134] int init__tmp___4; [L135] int init__tmp___5; [L136] init__r121 = ep12 [L137] init__r131 = ep13 [L138] init__r211 = ep21 [L139] init__r231 = ep23 [L140] init__r311 = ep31 [L141] init__r321 = ep32 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L142] COND FALSE !(!(init__r121 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L1631] COND TRUE !(init__r131 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L1633] COND TRUE !(ep32 == 0) [L1635] init__tmp = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L146] init__r122 = (_Bool)init__tmp VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L147] COND TRUE !(init__r131 == 0) [L149] init__tmp___0 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L151] init__r132 = (_Bool)init__tmp___0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L152] COND TRUE !(init__r211 == 0) [L154] init__tmp___1 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L156] init__r212 = (_Bool)init__tmp___1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L157] COND FALSE !(!(init__r231 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L1562] COND TRUE !(init__r211 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L1564] COND TRUE !(ep13 == 0) [L1566] init__tmp___2 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L161] init__r232 = (_Bool)init__tmp___2 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L162] COND FALSE !(!(init__r311 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L1539] COND TRUE !(init__r321 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L1541] COND TRUE !(ep21 == 0) [L1543] init__tmp___3 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L166] init__r312 = (_Bool)init__tmp___3 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L167] COND TRUE !(init__r321 == 0) [L169] init__tmp___4 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L171] init__r322 = (_Bool)init__tmp___4 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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] [L172] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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)id2) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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)id1) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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)id2) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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)id3) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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)r1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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)r2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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)r3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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 !(init__r122 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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__r132 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, 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=127, max2=5, max3=4, 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__r212 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, 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__r232 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, 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__r312 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, 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__r322 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, 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 ((int)max1) == ((int)id1) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, 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)max2) == ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, 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)max3) == ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, 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)st1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, 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)st2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, 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)st3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, 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)nl1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, 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)nl2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, 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)nl3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, 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)mode1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, 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)mode2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=5, max3=4, 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)mode3) == 0 [L226] init__tmp___5 = 1 [L227] __return_1131 = init__tmp___5 [L228] main__i2 = __return_1131 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=1, max1=127, max2=5, max3=4, 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] [L229] COND TRUE main__i2 != 0 [L231] p12_old = nomsg [L232] p12_new = nomsg [L233] p13_old = nomsg [L234] p13_new = nomsg [L235] p21_old = nomsg [L236] p21_new = nomsg [L237] p23_old = nomsg [L238] p23_new = nomsg [L239] p31_old = nomsg [L240] p31_new = nomsg [L241] p32_old = nomsg [L242] p32_new = nomsg [L243] main__i2 = 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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] [L244] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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] [L247] COND FALSE !(!(mode1 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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] [L253] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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 FALSE !(!(ep12 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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] [L266] COND TRUE !(ep13 == 0) [L268] int node1____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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] [L269] COND TRUE max1 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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 p13_new == nomsg [L273] node1____CPAchecker_TMP_1 = max1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_1=127, 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] [L275] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, 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] mode1 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, 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] COND FALSE !(!(mode2 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, 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] [L285] COND TRUE ((int)r2) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, 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 !(ep21 == 0) [L289] int node2____CPAchecker_TMP_0; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, 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] [L290] COND TRUE max2 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, 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 p21_new == nomsg [L294] node2____CPAchecker_TMP_0 = max2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_0=5, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, 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] [L296] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p13_old=-1, p21=0, p21_new=5, 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] COND FALSE !(!(ep23 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p13_old=-1, p21=0, p21_new=5, 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] [L309] mode2 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p13_old=-1, p21=0, p21_new=5, 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] COND FALSE !(!(mode3 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p13_old=-1, p21=0, p21_new=5, 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] [L317] COND TRUE ((int)r3) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p13_old=-1, p21=0, p21_new=5, 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 FALSE !(!(ep31 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p13_old=-1, p21=0, p21_new=5, 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] [L330] COND TRUE !(ep32 == 0) [L332] int node3____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p13_old=-1, p21=0, p21_new=5, 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] [L333] COND TRUE max3 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p13_old=-1, p21=0, p21_new=5, 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 p32_new == nomsg [L337] node3____CPAchecker_TMP_1 = max3 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_1=4, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=5, 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] [L339] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p13_old=-1, p21=0, p21_new=5, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=4, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L341] mode3 = 1 [L342] p12_old = p12_new [L343] p12_new = nomsg [L344] p13_old = p13_new [L345] p13_new = nomsg [L346] p21_old = p21_new [L347] p21_new = nomsg [L348] p23_old = p23_new [L349] p23_new = nomsg [L350] p31_old = p31_new [L351] p31_new = nomsg [L352] p32_old = p32_new [L353] p32_new = nomsg [L355] int check__tmp; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L356] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L358] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L360] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L362] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L364] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L370] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L372] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L374] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L380] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L382] COND TRUE ((int)r1) < 2 [L384] check__tmp = 1 [L385] __return_1259 = check__tmp [L386] main__c1 = __return_1259 [L388] _Bool __tmp_1; [L389] __tmp_1 = main__c1 [L390] _Bool assert__arg; [L391] assert__arg = __tmp_1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, assert__arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=5, max3=4, 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=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L392] COND FALSE !(assert__arg == 0) [L398] int main____CPAchecker_TMP_0 = main__i2; [L399] main__i2 = main__i2 + 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, 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=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L400] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, 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=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L403] COND TRUE !(mode1 == 0) [L405] r1 = (char)(((int)r1) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, 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=127, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L406] COND TRUE !(ep21 == 0) [L408] m1 = p21_old [L409] p21_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, 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=127, 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=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L410] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, 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=127, 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=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L414] COND FALSE !(!(ep31 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, 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=127, 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=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L422] COND TRUE ((int)r1) == 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, 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=127, 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=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND TRUE ((int)max1) == ((int)id1) [L426] st1 = 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, 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=127, 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=4, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L428] mode1 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, 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=127, 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=4, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L430] COND TRUE !(mode2 == 0) [L432] r2 = (char)(((int)r2) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, 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=127, 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=4, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L433] COND FALSE !(!(ep12 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, 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=127, 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=4, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L441] COND TRUE !(ep32 == 0) [L443] m2 = p32_old [L444] p32_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, 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=127, 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=1, st2=0, st3=0] [L445] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, 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=127, 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=1, st2=0, st3=0] [L449] COND FALSE !(((int)r2) == 2) [L455] mode2 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, 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=127, 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=1, st2=0, st3=0] [L457] COND TRUE !(mode3 == 0) [L459] r3 = (char)(((int)r3) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, 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=127, 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=1, st2=0, st3=0] [L460] COND TRUE !(ep13 == 0) [L462] m3 = p13_old [L463] p13_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=4, 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=1, st2=0, st3=0] [L464] COND TRUE ((int)m3) > ((int)max3) [L466] max3 = m3 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, 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=1, st2=0, st3=0] [L468] COND FALSE !(!(ep23 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, 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=1, st2=0, st3=0] [L476] COND FALSE !(((int)r3) == 2) [L482] mode3 = 0 [L483] p12_old = p12_new [L484] p12_new = nomsg [L485] p13_old = p13_new [L486] p13_new = nomsg [L487] p21_old = p21_new [L488] p21_new = nomsg [L489] p23_old = p23_new [L490] p23_new = nomsg [L491] p31_old = p31_new [L492] p31_new = nomsg [L493] p32_old = p32_new [L494] p32_new = nomsg [L496] int check__tmp; VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, 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=1, st2=0, st3=0] [L497] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, 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=1, st2=0, st3=0] [L499] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, 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=1, st2=0, st3=0] [L501] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, 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=1, st2=0, st3=0] [L503] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, 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=1, st2=0, st3=0] [L505] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, 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=1, st2=0, st3=0] [L511] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1079] check__tmp = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, check__tmp=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=5, max3=127, 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=1, st2=0, st3=0] [L529] __return_1378 = check__tmp [L530] main__c1 = __return_1378 [L531] __tmp_1379_0 = main____CPAchecker_TMP_0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main__c1=0, main__i2=1, max1=127, max2=5, max3=127, 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=1, st2=0, st3=0] [L533] main____CPAchecker_TMP_0 = __tmp_1379_0 [L535] _Bool __tmp_2; [L536] __tmp_2 = main__c1 [L537] _Bool assert__arg; [L538] assert__arg = __tmp_2 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, assert__arg=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main__i2=1, max1=127, max2=5, max3=127, 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=1, st2=0, st3=0] [L539] COND TRUE assert__arg == 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main__i2=1, max1=127, max2=5, max3=127, 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=1, st2=0, st3=0] [L541] reach_error() VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=5, id3=4, init__r121=0, init__r311=0, m1=5, m2=4, m3=127, main__i2=1, max1=127, max2=5, max3=127, 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=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 216 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7066 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7066 mSDsluCounter, 23474 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14342 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2351 IncrementalHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 9132 mSDtfsCounter, 2351 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8503occurred in iteration=20, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 13176 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 2355 NumberOfCodeBlocks, 2355 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2222 ConstructedInterpolants, 0 QuantifiedInterpolants, 9867 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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-10-14 03:43:33,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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