./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-011.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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/xcsp/AllInterval-011.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 5b6e29ecd51153e438c1994cc2e0ffddafd2990e0e080381de4ae5b34f9e08cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:40:14,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:40:14,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:40:14,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:40:14,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:40:14,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:40:14,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:40:14,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:40:14,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:40:14,649 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:40:14,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:40:14,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:40:14,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:40:14,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:40:14,652 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:40:14,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:40:14,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:40:14,655 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:40:14,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:40:14,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:40:14,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:40:14,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:40:14,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:40:14,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:40:14,662 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:40:14,662 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:40:14,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:40:14,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:40:14,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:40:14,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:40:14,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:40:14,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:40:14,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:40:14,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:40:14,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:40:14,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:40:14,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:40:14,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:40:14,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:40:14,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:40:14,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:40:14,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:40:14,667 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 -> 5b6e29ecd51153e438c1994cc2e0ffddafd2990e0e080381de4ae5b34f9e08cf [2024-10-12 20:40:14,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:40:14,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:40:14,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:40:14,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:40:14,948 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:40:14,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-011.c [2024-10-12 20:40:16,398 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:40:16,591 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:40:16,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-011.c [2024-10-12 20:40:16,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f7277f6f/fe3a7f353f3d48e08d59877ed673a8e6/FLAG3a93469f6 [2024-10-12 20:40:16,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f7277f6f/fe3a7f353f3d48e08d59877ed673a8e6 [2024-10-12 20:40:16,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:40:16,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:40:16,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:40:16,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:40:16,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:40:16,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:40:16" (1/1) ... [2024-10-12 20:40:16,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66ede1b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:40:16, skipping insertion in model container [2024-10-12 20:40:16,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:40:16" (1/1) ... [2024-10-12 20:40:16,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:40:16,901 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/xcsp/AllInterval-011.c[6600,6613] [2024-10-12 20:40:16,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:40:16,927 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:40:16,986 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/xcsp/AllInterval-011.c[6600,6613] [2024-10-12 20:40:16,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:40:17,008 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:40:17,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:40:17 WrapperNode [2024-10-12 20:40:17,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:40:17,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:40:17,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:40:17,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:40:17,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:40:17" (1/1) ... [2024-10-12 20:40:17,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:40:17" (1/1) ... [2024-10-12 20:40:17,070 INFO L138 Inliner]: procedures = 13, calls = 159, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 294 [2024-10-12 20:40:17,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:40:17,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:40:17,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:40:17,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:40:17,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:40:17" (1/1) ... [2024-10-12 20:40:17,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:40:17" (1/1) ... [2024-10-12 20:40:17,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:40:17" (1/1) ... [2024-10-12 20:40:17,117 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-12 20:40:17,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:40:17" (1/1) ... [2024-10-12 20:40:17,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:40:17" (1/1) ... [2024-10-12 20:40:17,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:40:17" (1/1) ... [2024-10-12 20:40:17,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:40:17" (1/1) ... [2024-10-12 20:40:17,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:40:17" (1/1) ... [2024-10-12 20:40:17,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:40:17" (1/1) ... [2024-10-12 20:40:17,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:40:17,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:40:17,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:40:17,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:40:17,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:40:17" (1/1) ... [2024-10-12 20:40:17,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:40:17,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:40:17,191 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-12 20:40:17,198 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-12 20:40:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:40:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:40:17,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:40:17,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:40:17,248 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2024-10-12 20:40:17,248 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2024-10-12 20:40:17,323 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:40:17,325 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:40:17,746 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-12 20:40:17,746 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:40:17,782 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:40:17,783 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:40:17,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:40:17 BoogieIcfgContainer [2024-10-12 20:40:17,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:40:17,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:40:17,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:40:17,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:40:17,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:40:16" (1/3) ... [2024-10-12 20:40:17,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4284b8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:40:17, skipping insertion in model container [2024-10-12 20:40:17,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:40:17" (2/3) ... [2024-10-12 20:40:17,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4284b8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:40:17, skipping insertion in model container [2024-10-12 20:40:17,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:40:17" (3/3) ... [2024-10-12 20:40:17,793 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-011.c [2024-10-12 20:40:17,809 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:40:17,809 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:40:17,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:40:17,895 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;@7ce4e40b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:40:17,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:40:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 37 states have internal predecessors, (38), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2024-10-12 20:40:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2024-10-12 20:40:17,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:40:17,940 INFO L215 NwaCegarLoop]: trace histogram [152, 152, 152, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:40:17,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:40:17,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:40:17,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1146258683, now seen corresponding path program 1 times [2024-10-12 20:40:17,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:40:17,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109724875] [2024-10-12 20:40:17,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:40:17,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:40:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 20:40:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:40:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:40:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 20:40:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 20:40:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 20:40:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 20:40:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:40:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 20:40:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 20:40:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 20:40:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 20:40:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 20:40:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 20:40:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 20:40:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 20:40:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 20:40:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 20:40:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 20:40:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 20:40:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 20:40:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 20:40:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 20:40:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 20:40:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:40:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-12 20:40:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-12 20:40:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-12 20:40:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-12 20:40:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-12 20:40:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-12 20:40:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-12 20:40:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-12 20:40:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-12 20:40:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-12 20:40:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-12 20:40:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-10-12 20:40:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-12 20:40:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-12 20:40:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-12 20:40:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-10-12 20:40:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-12 20:40:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-12 20:40:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-12 20:40:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-12 20:40:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-12 20:40:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-12 20:40:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-12 20:40:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-12 20:40:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-12 20:40:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-10-12 20:40:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-10-12 20:40:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-10-12 20:40:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-10-12 20:40:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-10-12 20:40:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-10-12 20:40:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-10-12 20:40:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-10-12 20:40:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-10-12 20:40:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2024-10-12 20:40:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2024-10-12 20:40:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2024-10-12 20:40:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2024-10-12 20:40:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2024-10-12 20:40:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-10-12 20:40:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-10-12 20:40:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-10-12 20:40:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-10-12 20:40:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-10-12 20:40:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2024-10-12 20:40:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2024-10-12 20:40:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2024-10-12 20:40:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2024-10-12 20:40:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2024-10-12 20:40:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2024-10-12 20:40:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2024-10-12 20:40:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2024-10-12 20:40:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2024-10-12 20:40:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 417 [2024-10-12 20:40:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2024-10-12 20:40:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2024-10-12 20:40:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2024-10-12 20:40:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 437 [2024-10-12 20:40:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2024-10-12 20:40:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2024-10-12 20:40:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2024-10-12 20:40:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2024-10-12 20:40:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 462 [2024-10-12 20:40:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2024-10-12 20:40:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 472 [2024-10-12 20:40:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2024-10-12 20:40:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 482 [2024-10-12 20:40:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 487 [2024-10-12 20:40:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 492 [2024-10-12 20:40:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2024-10-12 20:40:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 502 [2024-10-12 20:40:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 507 [2024-10-12 20:40:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2024-10-12 20:40:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 517 [2024-10-12 20:40:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 522 [2024-10-12 20:40:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 527 [2024-10-12 20:40:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 532 [2024-10-12 20:40:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 537 [2024-10-12 20:40:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 542 [2024-10-12 20:40:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2024-10-12 20:40:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2024-10-12 20:40:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 557 [2024-10-12 20:40:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 562 [2024-10-12 20:40:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 567 [2024-10-12 20:40:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 572 [2024-10-12 20:40:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 577 [2024-10-12 20:40:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 582 [2024-10-12 20:40:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 587 [2024-10-12 20:40:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 592 [2024-10-12 20:40:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 597 [2024-10-12 20:40:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 602 [2024-10-12 20:40:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 607 [2024-10-12 20:40:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 612 [2024-10-12 20:40:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 617 [2024-10-12 20:40:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 622 [2024-10-12 20:40:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 627 [2024-10-12 20:40:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 632 [2024-10-12 20:40:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 637 [2024-10-12 20:40:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 642 [2024-10-12 20:40:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 647 [2024-10-12 20:40:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 652 [2024-10-12 20:40:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 657 [2024-10-12 20:40:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 662 [2024-10-12 20:40:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 667 [2024-10-12 20:40:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 672 [2024-10-12 20:40:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 677 [2024-10-12 20:40:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 682 [2024-10-12 20:40:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 687 [2024-10-12 20:40:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 692 [2024-10-12 20:40:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 697 [2024-10-12 20:40:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 702 [2024-10-12 20:40:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 707 [2024-10-12 20:40:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 712 [2024-10-12 20:40:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2024-10-12 20:40:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 722 [2024-10-12 20:40:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 727 [2024-10-12 20:40:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 733 [2024-10-12 20:40:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 739 [2024-10-12 20:40:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2024-10-12 20:40:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 751 [2024-10-12 20:40:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 757 [2024-10-12 20:40:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 763 [2024-10-12 20:40:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 769 [2024-10-12 20:40:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 775 [2024-10-12 20:40:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 781 [2024-10-12 20:40:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 787 [2024-10-12 20:40:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 45904 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45904 trivial. 0 not checked. [2024-10-12 20:40:18,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:40:18,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109724875] [2024-10-12 20:40:18,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109724875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:40:18,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:40:18,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 20:40:18,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501624473] [2024-10-12 20:40:18,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:40:18,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 20:40:18,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:40:19,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 20:40:19,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:40:19,008 INFO L87 Difference]: Start difference. First operand has 191 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 37 states have internal predecessors, (38), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 1 states have call predecessors, (152), 2 states have call successors, (152) [2024-10-12 20:40:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:40:19,093 INFO L93 Difference]: Finished difference Result 379 states and 833 transitions. [2024-10-12 20:40:19,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 20:40:19,096 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 1 states have call predecessors, (152), 2 states have call successors, (152) Word has length 793 [2024-10-12 20:40:19,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:40:19,107 INFO L225 Difference]: With dead ends: 379 [2024-10-12 20:40:19,108 INFO L226 Difference]: Without dead ends: 190 [2024-10-12 20:40:19,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:40:19,121 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:40:19,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:40:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-12 20:40:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-10-12 20:40:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 36 states have (on average 1.0) internal successors, (36), 36 states have internal predecessors, (36), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2024-10-12 20:40:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 340 transitions. [2024-10-12 20:40:19,235 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 340 transitions. Word has length 793 [2024-10-12 20:40:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:40:19,236 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 340 transitions. [2024-10-12 20:40:19,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 1 states have call predecessors, (152), 2 states have call successors, (152) [2024-10-12 20:40:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 340 transitions. [2024-10-12 20:40:19,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2024-10-12 20:40:19,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:40:19,257 INFO L215 NwaCegarLoop]: trace histogram [152, 152, 152, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:40:19,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:40:19,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:40:19,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:40:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1444769969, now seen corresponding path program 1 times [2024-10-12 20:40:19,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:40:19,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411453798] [2024-10-12 20:40:19,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:40:19,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:40:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 20:40:26,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 20:40:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 20:40:35,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 20:40:35,148 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 20:40:35,150 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 20:40:35,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:40:35,155 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-12 20:40:35,362 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 20:40:35,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 08:40:35 BoogieIcfgContainer [2024-10-12 20:40:35,368 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 20:40:35,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 20:40:35,369 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 20:40:35,369 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 20:40:35,369 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:40:17" (3/4) ... [2024-10-12 20:40:35,372 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 20:40:35,557 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 20:40:35,557 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 20:40:35,558 INFO L158 Benchmark]: Toolchain (without parser) took 18939.24ms. Allocated memory was 180.4MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 115.0MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 833.3MB. Max. memory is 16.1GB. [2024-10-12 20:40:35,558 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 180.4MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 20:40:35,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.88ms. Allocated memory is still 180.4MB. Free memory was 114.7MB in the beginning and 98.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 20:40:35,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.16ms. Allocated memory is still 180.4MB. Free memory was 98.8MB in the beginning and 96.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 20:40:35,563 INFO L158 Benchmark]: Boogie Preprocessor took 74.04ms. Allocated memory is still 180.4MB. Free memory was 96.1MB in the beginning and 93.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 20:40:35,563 INFO L158 Benchmark]: RCFGBuilder took 636.94ms. Allocated memory is still 180.4MB. Free memory was 93.7MB in the beginning and 142.5MB in the end (delta: -48.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-12 20:40:35,563 INFO L158 Benchmark]: TraceAbstraction took 17582.58ms. Allocated memory was 180.4MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 142.1MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-12 20:40:35,563 INFO L158 Benchmark]: Witness Printer took 188.82ms. Allocated memory is still 3.1GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 20:40:35,565 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.17ms. Allocated memory is still 180.4MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.88ms. Allocated memory is still 180.4MB. Free memory was 114.7MB in the beginning and 98.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.16ms. Allocated memory is still 180.4MB. Free memory was 98.8MB in the beginning and 96.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.04ms. Allocated memory is still 180.4MB. Free memory was 96.1MB in the beginning and 93.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 636.94ms. Allocated memory is still 180.4MB. Free memory was 93.7MB in the beginning and 142.5MB in the end (delta: -48.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17582.58ms. Allocated memory was 180.4MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 142.1MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 188.82ms. Allocated memory is still 3.1GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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: 243]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L29] RET assume(var0 >= 0) VAL [var0=8] [L30] CALL assume(var0 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L30] RET assume(var0 <= 10) VAL [var0=8] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L33] RET assume(var1 >= 0) VAL [var0=8, var1=1] [L34] CALL assume(var1 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L34] RET assume(var1 <= 10) VAL [var0=8, var1=1] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L37] RET assume(var2 >= 0) VAL [var0=8, var1=1, var2=6] [L38] CALL assume(var2 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L38] RET assume(var2 <= 10) VAL [var0=8, var1=1, var2=6] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L41] RET assume(var3 >= 0) VAL [var0=8, var1=1, var2=6, var3=4] [L42] CALL assume(var3 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L42] RET assume(var3 <= 10) VAL [var0=8, var1=1, var2=6, var3=4] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L45] RET assume(var4 >= 0) VAL [var0=8, var1=1, var2=6, var3=4, var4=5] [L46] CALL assume(var4 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L46] RET assume(var4 <= 10) VAL [var0=8, var1=1, var2=6, var3=4, var4=5] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L49] RET assume(var5 >= 0) VAL [var0=8, var1=1, var2=6, var3=4, var4=5, var5=2] [L50] CALL assume(var5 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L50] RET assume(var5 <= 10) VAL [var0=8, var1=1, var2=6, var3=4, var4=5, var5=2] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L53] RET assume(var6 >= 0) VAL [var0=8, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10] [L54] CALL assume(var6 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L54] RET assume(var6 <= 10) VAL [var0=8, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L57] RET assume(var7 >= 0) VAL [var0=8, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0] [L58] CALL assume(var7 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET assume(var7 <= 10) VAL [var0=8, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L61] RET assume(var8 >= 0) VAL [var0=8, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9] [L62] CALL assume(var8 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L62] RET assume(var8 <= 10) VAL [var0=8, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L65] RET assume(var9 >= 0) VAL [var0=8, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L66] CALL assume(var9 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L66] RET assume(var9 <= 10) VAL [var0=8, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L69] RET assume(var10 >= 0) VAL [var0=8, var10=7, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L70] CALL assume(var10 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L70] RET assume(var10 <= 10) VAL [var0=8, var10=7, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L73] RET assume(var11 >= 1) VAL [var0=8, var10=7, var11=7, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L74] CALL assume(var11 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L74] RET assume(var11 <= 10) VAL [var0=8, var10=7, var11=7, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L77] RET assume(var12 >= 1) VAL [var0=8, var10=7, var11=7, var12=5, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L78] CALL assume(var12 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L78] RET assume(var12 <= 10) VAL [var0=8, var10=7, var11=7, var12=5, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L79] int var13; [L80] var13 = __VERIFIER_nondet_int() [L81] CALL assume(var13 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L81] RET assume(var13 >= 1) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L82] CALL assume(var13 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L82] RET assume(var13 <= 10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L83] int var14; [L84] var14 = __VERIFIER_nondet_int() [L85] CALL assume(var14 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L85] RET assume(var14 >= 1) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L86] CALL assume(var14 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L86] RET assume(var14 <= 10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L87] int var15; [L88] var15 = __VERIFIER_nondet_int() [L89] CALL assume(var15 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L89] RET assume(var15 >= 1) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L90] CALL assume(var15 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L90] RET assume(var15 <= 10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L91] int var16; [L92] var16 = __VERIFIER_nondet_int() [L93] CALL assume(var16 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L93] RET assume(var16 >= 1) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L94] CALL assume(var16 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L94] RET assume(var16 <= 10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L95] int var17; [L96] var17 = __VERIFIER_nondet_int() [L97] CALL assume(var17 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L97] RET assume(var17 >= 1) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L98] CALL assume(var17 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L98] RET assume(var17 <= 10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L99] int var18; [L100] var18 = __VERIFIER_nondet_int() [L101] CALL assume(var18 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L101] RET assume(var18 >= 1) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L102] CALL assume(var18 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L102] RET assume(var18 <= 10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L103] int var19; [L104] var19 = __VERIFIER_nondet_int() [L105] CALL assume(var19 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L105] RET assume(var19 >= 1) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L106] CALL assume(var19 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L106] RET assume(var19 <= 10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L107] int var20; [L108] var20 = __VERIFIER_nondet_int() [L109] CALL assume(var20 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L109] RET assume(var20 >= 1) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L110] CALL assume(var20 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L110] RET assume(var20 <= 10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L111] int myvar0 = 1; VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L112] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L112] RET assume(var0 != var1) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L113] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L113] RET assume(var0 != var2) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L114] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L114] RET assume(var0 != var3) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L115] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L115] RET assume(var0 != var4) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L116] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L116] RET assume(var0 != var5) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L117] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L117] RET assume(var0 != var6) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L118] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L118] RET assume(var0 != var7) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L119] CALL assume(var0 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L119] RET assume(var0 != var8) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L120] CALL assume(var0 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L120] RET assume(var0 != var9) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L121] CALL assume(var0 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L121] RET assume(var0 != var10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L122] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L122] RET assume(var1 != var2) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L123] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L123] RET assume(var1 != var3) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L124] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L124] RET assume(var1 != var4) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L125] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L125] RET assume(var1 != var5) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L126] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L126] RET assume(var1 != var6) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L127] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L127] RET assume(var1 != var7) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L128] CALL assume(var1 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L128] RET assume(var1 != var8) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L129] CALL assume(var1 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L129] RET assume(var1 != var9) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L130] CALL assume(var1 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L130] RET assume(var1 != var10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L131] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L131] RET assume(var2 != var3) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L132] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L132] RET assume(var2 != var4) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L133] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L133] RET assume(var2 != var5) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L134] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L134] RET assume(var2 != var6) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L135] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L135] RET assume(var2 != var7) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L136] CALL assume(var2 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L136] RET assume(var2 != var8) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L137] CALL assume(var2 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L137] RET assume(var2 != var9) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L138] CALL assume(var2 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L138] RET assume(var2 != var10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L139] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L139] RET assume(var3 != var4) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L140] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L140] RET assume(var3 != var5) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L141] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L141] RET assume(var3 != var6) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L142] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L142] RET assume(var3 != var7) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L143] CALL assume(var3 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L143] RET assume(var3 != var8) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L144] CALL assume(var3 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L144] RET assume(var3 != var9) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L145] CALL assume(var3 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L145] RET assume(var3 != var10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L146] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L146] RET assume(var4 != var5) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L147] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L147] RET assume(var4 != var6) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L148] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L148] RET assume(var4 != var7) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L149] CALL assume(var4 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L149] RET assume(var4 != var8) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L150] CALL assume(var4 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L150] RET assume(var4 != var9) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L151] CALL assume(var4 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L151] RET assume(var4 != var10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L152] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L152] RET assume(var5 != var6) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L153] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L153] RET assume(var5 != var7) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L154] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L154] RET assume(var5 != var8) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L155] CALL assume(var5 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L155] RET assume(var5 != var9) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L156] CALL assume(var5 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L156] RET assume(var5 != var10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L157] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L157] RET assume(var6 != var7) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L158] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L158] RET assume(var6 != var8) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L159] CALL assume(var6 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L159] RET assume(var6 != var9) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L160] CALL assume(var6 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L160] RET assume(var6 != var10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L161] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L161] RET assume(var7 != var8) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L162] CALL assume(var7 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L162] RET assume(var7 != var9) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L163] CALL assume(var7 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L163] RET assume(var7 != var10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L164] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L164] RET assume(var8 != var9) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L165] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L165] RET assume(var8 != var10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L166] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L166] RET assume(var9 != var10) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L167] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L167] RET assume(var11 != var12) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L168] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L168] RET assume(var11 != var13) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L169] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L169] RET assume(var11 != var14) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L170] CALL assume(var11 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L170] RET assume(var11 != var15) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L171] CALL assume(var11 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L171] RET assume(var11 != var16) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L172] CALL assume(var11 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L172] RET assume(var11 != var17) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L173] CALL assume(var11 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L173] RET assume(var11 != var18) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L174] CALL assume(var11 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L174] RET assume(var11 != var19) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L175] CALL assume(var11 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L175] RET assume(var11 != var20) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L176] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L176] RET assume(var12 != var13) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L177] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L177] RET assume(var12 != var14) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L178] CALL assume(var12 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L178] RET assume(var12 != var15) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L179] CALL assume(var12 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L179] RET assume(var12 != var16) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L180] CALL assume(var12 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L180] RET assume(var12 != var17) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L181] CALL assume(var12 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L181] RET assume(var12 != var18) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L182] CALL assume(var12 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L182] RET assume(var12 != var19) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L183] CALL assume(var12 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L183] RET assume(var12 != var20) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L184] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L184] RET assume(var13 != var14) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L185] CALL assume(var13 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L185] RET assume(var13 != var15) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L186] CALL assume(var13 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L186] RET assume(var13 != var16) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L187] CALL assume(var13 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L187] RET assume(var13 != var17) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L188] CALL assume(var13 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L188] RET assume(var13 != var18) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L189] CALL assume(var13 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L189] RET assume(var13 != var19) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L190] CALL assume(var13 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L190] RET assume(var13 != var20) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L191] CALL assume(var14 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L191] RET assume(var14 != var15) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L192] CALL assume(var14 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L192] RET assume(var14 != var16) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L193] CALL assume(var14 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L193] RET assume(var14 != var17) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L194] CALL assume(var14 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L194] RET assume(var14 != var18) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L195] CALL assume(var14 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L195] RET assume(var14 != var19) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L196] CALL assume(var14 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L196] RET assume(var14 != var20) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L197] CALL assume(var15 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L197] RET assume(var15 != var16) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L198] CALL assume(var15 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L198] RET assume(var15 != var17) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L199] CALL assume(var15 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L199] RET assume(var15 != var18) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L200] CALL assume(var15 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L200] RET assume(var15 != var19) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L201] CALL assume(var15 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L201] RET assume(var15 != var20) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L202] CALL assume(var16 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L202] RET assume(var16 != var17) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L203] CALL assume(var16 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L203] RET assume(var16 != var18) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L204] CALL assume(var16 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L204] RET assume(var16 != var19) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L205] CALL assume(var16 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L205] RET assume(var16 != var20) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L206] CALL assume(var17 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L206] RET assume(var17 != var18) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L207] CALL assume(var17 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L207] RET assume(var17 != var19) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L208] CALL assume(var17 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L208] RET assume(var17 != var20) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L209] CALL assume(var18 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L209] RET assume(var18 != var19) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L210] CALL assume(var18 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L210] RET assume(var18 != var20) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L211] CALL assume(var19 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L211] RET assume(var19 != var20) VAL [var0=8, var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3] [L212] int var_for_abs; [L213] var_for_abs = var0 - var1 [L214] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3, var_for_abs=7] [L215] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L215] RET assume(var11 == var_for_abs) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var1=1, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3, var_for_abs=7] [L216] var_for_abs = var1 - var2 [L217] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3, var_for_abs=5] [L218] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L218] RET assume(var12 == var_for_abs) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var2=6, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3, var_for_abs=5] [L219] var_for_abs = var2 - var3 [L220] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3, var_for_abs=2] [L221] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L221] RET assume(var13 == var_for_abs) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var3=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3, var_for_abs=2] [L222] var_for_abs = var3 - var4 [L223] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3, var_for_abs=1] [L224] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L224] RET assume(var14 == var_for_abs) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var4=5, var5=2, var6=10, var7=0, var8=9, var9=3, var_for_abs=1] [L225] var_for_abs = var4 - var5 [L226] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var5=2, var6=10, var7=0, var8=9, var9=3, var_for_abs=3] [L227] CALL assume(var15 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L227] RET assume(var15 == var_for_abs) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var5=2, var6=10, var7=0, var8=9, var9=3, var_for_abs=3] [L228] var_for_abs = var5 - var6 [L229] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var6=10, var7=0, var8=9, var9=3, var_for_abs=8] [L230] CALL assume(var16 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L230] RET assume(var16 == var_for_abs) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var6=10, var7=0, var8=9, var9=3, var_for_abs=8] [L231] var_for_abs = var6 - var7 [L232] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var7=0, var8=9, var9=3, var_for_abs=10] [L233] CALL assume(var17 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L233] RET assume(var17 == var_for_abs) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var7=0, var8=9, var9=3, var_for_abs=10] [L234] var_for_abs = var7 - var8 [L235] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var8=9, var9=3, var_for_abs=9] [L236] CALL assume(var18 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L236] RET assume(var18 == var_for_abs) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var8=9, var9=3, var_for_abs=9] [L237] var_for_abs = var8 - var9 [L238] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var9=3, var_for_abs=6] [L239] CALL assume(var19 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L239] RET assume(var19 == var_for_abs) VAL [var10=7, var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var9=3, var_for_abs=6] [L240] var_for_abs = var9 - var10 [L241] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var_for_abs=4] [L242] CALL assume(var20 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L242] RET assume(var20 == var_for_abs) VAL [var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var_for_abs=4] [L243] reach_error() VAL [var11=7, var12=5, var13=2, var14=1, var15=3, var16=8, var17=10, var18=9, var19=6, var20=4, var_for_abs=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 191 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 2, TraceHistogramMax: 152, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 339 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1 IncrementalHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 339 mSDtfsCounter, 1 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 6.8s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1586 NumberOfCodeBlocks, 1586 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 792 ConstructedInterpolants, 0 QuantifiedInterpolants, 792 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 45904/45904 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-12 20:40:35,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE