/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/xcsp/AllInterval-011.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 04:09:02,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 04:09:02,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 04:09:02,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 04:09:02,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 04:09:02,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 04:09:02,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 04:09:02,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 04:09:02,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 04:09:02,675 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 04:09:02,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 04:09:02,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 04:09:02,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 04:09:02,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 04:09:02,677 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 04:09:02,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 04:09:02,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 04:09:02,678 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 04:09:02,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 04:09:02,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 04:09:02,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 04:09:02,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 04:09:02,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 04:09:02,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 04:09:02,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 04:09:02,681 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 04:09:02,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 04:09:02,681 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 04:09:02,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 04:09:02,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 04:09:02,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 04:09:02,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 04:09:02,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 04:09:02,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 04:09:02,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 04:09:02,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 04:09:02,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 04:09:02,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 04:09:02,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 04:09:02,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 04:09:02,685 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 04:09:02,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 04:09:02,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 04:09:02,689 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: Use bitabs translation -> true [2023-12-20 04:09:02,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 04:09:02,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 04:09:02,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 04:09:02,911 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 04:09:02,911 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 04:09:02,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/xcsp/AllInterval-011.c [2023-12-20 04:09:03,988 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 04:09:04,145 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 04:09:04,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-011.c [2023-12-20 04:09:04,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9be7ea941/9541d747b240419db78433ee57adc25e/FLAG551602b10 [2023-12-20 04:09:04,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9be7ea941/9541d747b240419db78433ee57adc25e [2023-12-20 04:09:04,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 04:09:04,169 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 04:09:04,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 04:09:04,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 04:09:04,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 04:09:04,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 04:09:04" (1/1) ... [2023-12-20 04:09:04,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eae85dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:09:04, skipping insertion in model container [2023-12-20 04:09:04,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 04:09:04" (1/1) ... [2023-12-20 04:09:04,200 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 04:09:04,352 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-011.c[6600,6613] [2023-12-20 04:09:04,358 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 04:09:04,366 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 04:09:04,399 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-011.c[6600,6613] [2023-12-20 04:09:04,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 04:09:04,412 INFO L206 MainTranslator]: Completed translation [2023-12-20 04:09:04,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:09:04 WrapperNode [2023-12-20 04:09:04,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 04:09:04,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 04:09:04,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 04:09:04,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 04:09:04,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:09:04" (1/1) ... [2023-12-20 04:09:04,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:09:04" (1/1) ... [2023-12-20 04:09:04,466 INFO L138 Inliner]: procedures = 13, calls = 159, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 294 [2023-12-20 04:09:04,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 04:09:04,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 04:09:04,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 04:09:04,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 04:09:04,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:09:04" (1/1) ... [2023-12-20 04:09:04,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:09:04" (1/1) ... [2023-12-20 04:09:04,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:09:04" (1/1) ... [2023-12-20 04:09:04,499 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]. [2023-12-20 04:09:04,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:09:04" (1/1) ... [2023-12-20 04:09:04,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:09:04" (1/1) ... [2023-12-20 04:09:04,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:09:04" (1/1) ... [2023-12-20 04:09:04,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:09:04" (1/1) ... [2023-12-20 04:09:04,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:09:04" (1/1) ... [2023-12-20 04:09:04,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:09:04" (1/1) ... [2023-12-20 04:09:04,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 04:09:04,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 04:09:04,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 04:09:04,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 04:09:04,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:09:04" (1/1) ... [2023-12-20 04:09:04,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 04:09:04,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:09:04,564 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) [2023-12-20 04:09:04,585 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 [2023-12-20 04:09:04,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 04:09:04,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 04:09:04,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 04:09:04,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 04:09:04,596 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2023-12-20 04:09:04,596 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2023-12-20 04:09:04,684 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 04:09:04,686 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 04:09:04,981 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 04:09:05,003 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 04:09:05,003 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-20 04:09:05,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 04:09:05 BoogieIcfgContainer [2023-12-20 04:09:05,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 04:09:05,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 04:09:05,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 04:09:05,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 04:09:05,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 04:09:04" (1/3) ... [2023-12-20 04:09:05,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6307df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 04:09:05, skipping insertion in model container [2023-12-20 04:09:05,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:09:04" (2/3) ... [2023-12-20 04:09:05,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6307df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 04:09:05, skipping insertion in model container [2023-12-20 04:09:05,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 04:09:05" (3/3) ... [2023-12-20 04:09:05,011 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-011.c [2023-12-20 04:09:05,025 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 04:09:05,025 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 04:09:05,072 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 04:09:05,077 INFO L357 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, mHoare=true, 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;@47a8e5eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 04:09:05,077 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 04:09:05,081 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) [2023-12-20 04:09:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2023-12-20 04:09:05,118 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:09:05,119 INFO L195 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] [2023-12-20 04:09:05,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:09:05,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:09:05,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1146258683, now seen corresponding path program 1 times [2023-12-20 04:09:05,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:09:05,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853530889] [2023-12-20 04:09:05,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:09:05,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:09:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:09:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-20 04:09:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:09:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 04:09:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-20 04:09:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 04:09:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 04:09:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 04:09:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 04:09:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-20 04:09:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-20 04:09:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-20 04:09:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-20 04:09:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-20 04:09:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-20 04:09:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-20 04:09:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 04:09:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-20 04:09:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-20 04:09:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-20 04:09:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 04:09:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-20 04:09:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-20 04:09:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-12-20 04:09:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-12-20 04:09:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-20 04:09:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-12-20 04:09:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-12-20 04:09:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-12-20 04:09:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-12-20 04:09:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-12-20 04:09:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-12-20 04:09:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-12-20 04:09:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-12-20 04:09:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-12-20 04:09:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-20 04:09:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-20 04:09:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2023-12-20 04:09:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-12-20 04:09:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-20 04:09:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-12-20 04:09:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-12-20 04:09:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-12-20 04:09:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-20 04:09:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-12-20 04:09:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-20 04:09:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-20 04:09:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-12-20 04:09:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-12-20 04:09:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-20 04:09:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2023-12-20 04:09:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2023-12-20 04:09:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-12-20 04:09:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-12-20 04:09:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2023-12-20 04:09:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2023-12-20 04:09:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2023-12-20 04:09:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2023-12-20 04:09:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2023-12-20 04:09:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2023-12-20 04:09:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2023-12-20 04:09:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2023-12-20 04:09:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2023-12-20 04:09:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2023-12-20 04:09:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2023-12-20 04:09:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2023-12-20 04:09:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2023-12-20 04:09:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2023-12-20 04:09:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2023-12-20 04:09:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2023-12-20 04:09:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2023-12-20 04:09:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2023-12-20 04:09:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2023-12-20 04:09:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2023-12-20 04:09:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2023-12-20 04:09:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2023-12-20 04:09:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2023-12-20 04:09:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2023-12-20 04:09:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2023-12-20 04:09:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 417 [2023-12-20 04:09:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2023-12-20 04:09:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2023-12-20 04:09:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2023-12-20 04:09:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 437 [2023-12-20 04:09:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2023-12-20 04:09:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2023-12-20 04:09:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2023-12-20 04:09:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2023-12-20 04:09:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 462 [2023-12-20 04:09:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2023-12-20 04:09:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 472 [2023-12-20 04:09:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2023-12-20 04:09:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 482 [2023-12-20 04:09:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 487 [2023-12-20 04:09:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 492 [2023-12-20 04:09:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2023-12-20 04:09:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 502 [2023-12-20 04:09:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 507 [2023-12-20 04:09:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2023-12-20 04:09:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 517 [2023-12-20 04:09:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 522 [2023-12-20 04:09:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:05,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 527 [2023-12-20 04:09:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 532 [2023-12-20 04:09:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 537 [2023-12-20 04:09:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 542 [2023-12-20 04:09:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2023-12-20 04:09:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2023-12-20 04:09:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 557 [2023-12-20 04:09:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 562 [2023-12-20 04:09:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 567 [2023-12-20 04:09:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 572 [2023-12-20 04:09:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 577 [2023-12-20 04:09:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 582 [2023-12-20 04:09:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 587 [2023-12-20 04:09:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 592 [2023-12-20 04:09:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 597 [2023-12-20 04:09:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 602 [2023-12-20 04:09:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 607 [2023-12-20 04:09:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 612 [2023-12-20 04:09:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 617 [2023-12-20 04:09:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 622 [2023-12-20 04:09:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 627 [2023-12-20 04:09:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 632 [2023-12-20 04:09:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 637 [2023-12-20 04:09:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 642 [2023-12-20 04:09:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 647 [2023-12-20 04:09:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 652 [2023-12-20 04:09:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 657 [2023-12-20 04:09:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 662 [2023-12-20 04:09:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 667 [2023-12-20 04:09:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 672 [2023-12-20 04:09:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 677 [2023-12-20 04:09:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 682 [2023-12-20 04:09:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 687 [2023-12-20 04:09:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 692 [2023-12-20 04:09:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 697 [2023-12-20 04:09:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 702 [2023-12-20 04:09:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 707 [2023-12-20 04:09:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 712 [2023-12-20 04:09:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 717 [2023-12-20 04:09:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 722 [2023-12-20 04:09:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 727 [2023-12-20 04:09:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 733 [2023-12-20 04:09:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 739 [2023-12-20 04:09:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2023-12-20 04:09:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 751 [2023-12-20 04:09:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 757 [2023-12-20 04:09:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 763 [2023-12-20 04:09:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 769 [2023-12-20 04:09:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 775 [2023-12-20 04:09:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 781 [2023-12-20 04:09:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 787 [2023-12-20 04:09:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:09:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 45904 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45904 trivial. 0 not checked. [2023-12-20 04:09:06,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:09:06,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853530889] [2023-12-20 04:09:06,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853530889] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 04:09:06,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 04:09:06,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 04:09:06,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912336156] [2023-12-20 04:09:06,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 04:09:06,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 04:09:06,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:09:06,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 04:09:06,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 04:09:06,186 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) [2023-12-20 04:09:06,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:09:06,276 INFO L93 Difference]: Finished difference Result 379 states and 833 transitions. [2023-12-20 04:09:06,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 04:09:06,279 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 [2023-12-20 04:09:06,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:09:06,290 INFO L225 Difference]: With dead ends: 379 [2023-12-20 04:09:06,290 INFO L226 Difference]: Without dead ends: 190 [2023-12-20 04:09:06,299 INFO L412 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 [2023-12-20 04:09:06,303 INFO L413 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 [2023-12-20 04:09:06,304 INFO L414 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] [2023-12-20 04:09:06,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-12-20 04:09:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2023-12-20 04:09:06,409 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) [2023-12-20 04:09:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 340 transitions. [2023-12-20 04:09:06,414 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 340 transitions. Word has length 793 [2023-12-20 04:09:06,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:09:06,415 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 340 transitions. [2023-12-20 04:09:06,415 INFO L496 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) [2023-12-20 04:09:06,415 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 340 transitions. [2023-12-20 04:09:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2023-12-20 04:09:06,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:09:06,435 INFO L195 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] [2023-12-20 04:09:06,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 04:09:06,435 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:09:06,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:09:06,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1444769969, now seen corresponding path program 1 times [2023-12-20 04:09:06,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:09:06,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565457915] [2023-12-20 04:09:06,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:09:06,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:09:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 04:09:13,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 04:09:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 04:09:33,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 04:09:33,217 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 04:09:33,219 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 04:09:33,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 04:09:33,222 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-20 04:09:33,227 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 04:09:33,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 04:09:33 BoogieIcfgContainer [2023-12-20 04:09:33,386 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 04:09:33,388 INFO L158 Benchmark]: Toolchain (without parser) took 29217.72ms. Allocated memory was 229.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 176.7MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2023-12-20 04:09:33,388 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory was 127.3MB in the beginning and 127.1MB in the end (delta: 155.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 04:09:33,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.66ms. Allocated memory is still 229.6MB. Free memory was 176.2MB in the beginning and 161.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-20 04:09:33,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.60ms. Allocated memory is still 229.6MB. Free memory was 161.5MB in the beginning and 158.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 04:09:33,393 INFO L158 Benchmark]: Boogie Preprocessor took 51.19ms. Allocated memory is still 229.6MB. Free memory was 158.9MB in the beginning and 156.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 04:09:33,393 INFO L158 Benchmark]: RCFGBuilder took 484.43ms. Allocated memory is still 229.6MB. Free memory was 156.8MB in the beginning and 130.1MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-20 04:09:33,393 INFO L158 Benchmark]: TraceAbstraction took 28380.81ms. Allocated memory was 229.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 129.0MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-12-20 04:09:33,399 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.11ms. Allocated memory is still 181.4MB. Free memory was 127.3MB in the beginning and 127.1MB in the end (delta: 155.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.66ms. Allocated memory is still 229.6MB. Free memory was 176.2MB in the beginning and 161.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.60ms. Allocated memory is still 229.6MB. Free memory was 161.5MB in the beginning and 158.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.19ms. Allocated memory is still 229.6MB. Free memory was 158.9MB in the beginning and 156.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 484.43ms. Allocated memory is still 229.6MB. Free memory was 156.8MB in the beginning and 130.1MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 28380.81ms. Allocated memory was 229.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 129.0MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * 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, cond=1] [L29] RET assume(var0 >= 0) VAL [dummy=0, var0=6] [L30] CALL assume(var0 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 10) VAL [dummy=0, var0=6] [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, cond=1] [L33] RET assume(var1 >= 0) VAL [dummy=0, var0=6, var1=2] [L34] CALL assume(var1 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 10) VAL [dummy=0, var0=6, var1=2] [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, cond=1] [L37] RET assume(var2 >= 0) VAL [dummy=0, var0=6, var1=2, var2=4] [L38] CALL assume(var2 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 10) VAL [dummy=0, var0=6, var1=2, var2=4] [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, cond=1] [L41] RET assume(var3 >= 0) VAL [dummy=0, var0=6, var1=2, var2=4, var3=5] [L42] CALL assume(var3 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 10) VAL [dummy=0, var0=6, var1=2, var2=4, var3=5] [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, cond=1] [L45] RET assume(var4 >= 0) VAL [dummy=0, var0=6, var1=2, var2=4, var3=5, var4=8] [L46] CALL assume(var4 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 10) VAL [dummy=0, var0=6, var1=2, var2=4, var3=5, var4=8] [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, cond=1] [L49] RET assume(var5 >= 0) VAL [dummy=0, var0=6, var1=2, var2=4, var3=5, var4=8, var5=3] [L50] CALL assume(var5 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 10) VAL [dummy=0, var0=6, var1=2, var2=4, var3=5, var4=8, var5=3] [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, cond=1] [L53] RET assume(var6 >= 0) VAL [dummy=0, var0=6, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10] [L54] CALL assume(var6 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 10) VAL [dummy=0, var0=6, var1=2, var2=4, var3=5, var4=8, var5=3, 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, cond=1] [L57] RET assume(var7 >= 0) VAL [dummy=0, var0=6, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0] [L58] CALL assume(var7 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 10) VAL [dummy=0, var0=6, var1=2, var2=4, var3=5, var4=8, var5=3, 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, cond=1] [L61] RET assume(var8 >= 0) VAL [dummy=0, var0=6, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9] [L62] CALL assume(var8 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 10) VAL [dummy=0, var0=6, var1=2, var2=4, var3=5, var4=8, var5=3, 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, cond=1] [L65] RET assume(var9 >= 0) VAL [dummy=0, var0=6, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L66] CALL assume(var9 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var9 <= 10) VAL [dummy=0, var0=6, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [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, cond=1] [L69] RET assume(var10 >= 0) VAL [dummy=0, var0=6, var10=7, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L70] CALL assume(var10 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var10 <= 10) VAL [dummy=0, var0=6, var10=7, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [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, cond=1] [L73] RET assume(var11 >= 1) VAL [dummy=0, var0=6, var10=7, var11=4, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L74] CALL assume(var11 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var11 <= 10) VAL [dummy=0, var0=6, var10=7, var11=4, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [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, cond=1] [L77] RET assume(var12 >= 1) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L78] CALL assume(var12 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var12 <= 10) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [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, cond=1] [L81] RET assume(var13 >= 1) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var13=1, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L82] CALL assume(var13 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume(var13 <= 10) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var13=1, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [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, cond=1] [L85] RET assume(var14 >= 1) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L86] CALL assume(var14 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var14 <= 10) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [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, cond=1] [L89] RET assume(var15 >= 1) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L90] CALL assume(var15 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume(var15 <= 10) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [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, cond=1] [L93] RET assume(var16 >= 1) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L94] CALL assume(var16 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L94] RET assume(var16 <= 10) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [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, cond=1] [L97] RET assume(var17 >= 1) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L98] CALL assume(var17 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L98] RET assume(var17 <= 10) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [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, cond=1] [L101] RET assume(var18 >= 1) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L102] CALL assume(var18 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L102] RET assume(var18 <= 10) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [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, cond=1] [L105] RET assume(var19 >= 1) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L106] CALL assume(var19 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L106] RET assume(var19 <= 10) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [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, cond=1] [L109] RET assume(var20 >= 1) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L110] CALL assume(var20 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L110] RET assume(var20 <= 10) VAL [dummy=0, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L111] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L112] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L113] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L113] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L114] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L114] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L115] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L115] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L116] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L116] RET assume(var0 != var5) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L117] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L117] RET assume(var0 != var6) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L118] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L118] RET assume(var0 != var7) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L119] CALL assume(var0 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L119] RET assume(var0 != var8) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L120] CALL assume(var0 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L120] RET assume(var0 != var9) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L121] CALL assume(var0 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L121] RET assume(var0 != var10) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L122] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L122] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L123] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L123] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L124] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L124] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L125] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L125] RET assume(var1 != var5) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L126] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L126] RET assume(var1 != var6) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L127] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L127] RET assume(var1 != var7) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L128] CALL assume(var1 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L128] RET assume(var1 != var8) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L129] CALL assume(var1 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L129] RET assume(var1 != var9) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L130] CALL assume(var1 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L130] RET assume(var1 != var10) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L131] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L131] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L132] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L132] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L133] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L133] RET assume(var2 != var5) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L134] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L134] RET assume(var2 != var6) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L135] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L135] RET assume(var2 != var7) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L136] CALL assume(var2 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L136] RET assume(var2 != var8) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L137] CALL assume(var2 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L137] RET assume(var2 != var9) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L138] CALL assume(var2 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L138] RET assume(var2 != var10) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L139] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L139] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L140] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L140] RET assume(var3 != var5) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L141] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L141] RET assume(var3 != var6) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L142] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L142] RET assume(var3 != var7) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L143] CALL assume(var3 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L143] RET assume(var3 != var8) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L144] CALL assume(var3 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L144] RET assume(var3 != var9) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L145] CALL assume(var3 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L145] RET assume(var3 != var10) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L146] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L146] RET assume(var4 != var5) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L147] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L147] RET assume(var4 != var6) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L148] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L148] RET assume(var4 != var7) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L149] CALL assume(var4 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L149] RET assume(var4 != var8) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L150] CALL assume(var4 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L150] RET assume(var4 != var9) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L151] CALL assume(var4 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L151] RET assume(var4 != var10) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L152] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L152] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L153] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L153] RET assume(var5 != var7) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L154] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L154] RET assume(var5 != var8) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L155] CALL assume(var5 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L155] RET assume(var5 != var9) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L156] CALL assume(var5 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L156] RET assume(var5 != var10) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L157] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L157] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L158] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L158] RET assume(var6 != var8) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L159] CALL assume(var6 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L159] RET assume(var6 != var9) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L160] CALL assume(var6 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L160] RET assume(var6 != var10) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L161] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L161] RET assume(var7 != var8) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L162] CALL assume(var7 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L162] RET assume(var7 != var9) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L163] CALL assume(var7 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L163] RET assume(var7 != var10) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L164] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L164] RET assume(var8 != var9) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L165] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L165] RET assume(var8 != var10) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L166] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L166] RET assume(var9 != var10) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L167] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L167] RET assume(var11 != var12) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L168] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L168] RET assume(var11 != var13) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L169] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L169] RET assume(var11 != var14) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L170] CALL assume(var11 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L170] RET assume(var11 != var15) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L171] CALL assume(var11 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L171] RET assume(var11 != var16) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L172] CALL assume(var11 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L172] RET assume(var11 != var17) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L173] CALL assume(var11 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L173] RET assume(var11 != var18) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L174] CALL assume(var11 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L174] RET assume(var11 != var19) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L175] CALL assume(var11 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L175] RET assume(var11 != var20) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L176] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L176] RET assume(var12 != var13) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L177] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L177] RET assume(var12 != var14) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L178] CALL assume(var12 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L178] RET assume(var12 != var15) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L179] CALL assume(var12 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L179] RET assume(var12 != var16) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L180] CALL assume(var12 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L180] RET assume(var12 != var17) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L181] CALL assume(var12 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L181] RET assume(var12 != var18) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L182] CALL assume(var12 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L182] RET assume(var12 != var19) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L183] CALL assume(var12 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L183] RET assume(var12 != var20) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L184] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L184] RET assume(var13 != var14) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L185] CALL assume(var13 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L185] RET assume(var13 != var15) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L186] CALL assume(var13 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L186] RET assume(var13 != var16) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L187] CALL assume(var13 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L187] RET assume(var13 != var17) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L188] CALL assume(var13 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L188] RET assume(var13 != var18) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L189] CALL assume(var13 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L189] RET assume(var13 != var19) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L190] CALL assume(var13 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L190] RET assume(var13 != var20) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L191] CALL assume(var14 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L191] RET assume(var14 != var15) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L192] CALL assume(var14 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L192] RET assume(var14 != var16) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L193] CALL assume(var14 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L193] RET assume(var14 != var17) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L194] CALL assume(var14 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L194] RET assume(var14 != var18) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L195] CALL assume(var14 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L195] RET assume(var14 != var19) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L196] CALL assume(var14 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L196] RET assume(var14 != var20) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L197] CALL assume(var15 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L197] RET assume(var15 != var16) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L198] CALL assume(var15 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L198] RET assume(var15 != var17) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L199] CALL assume(var15 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L199] RET assume(var15 != var18) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L200] CALL assume(var15 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L200] RET assume(var15 != var19) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L201] CALL assume(var15 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L201] RET assume(var15 != var20) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L202] CALL assume(var16 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L202] RET assume(var16 != var17) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L203] CALL assume(var16 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L203] RET assume(var16 != var18) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L204] CALL assume(var16 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L204] RET assume(var16 != var19) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L205] CALL assume(var16 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L205] RET assume(var16 != var20) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L206] CALL assume(var17 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L206] RET assume(var17 != var18) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L207] CALL assume(var17 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L207] RET assume(var17 != var19) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L208] CALL assume(var17 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L208] RET assume(var17 != var20) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L209] CALL assume(var18 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L209] RET assume(var18 != var19) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L210] CALL assume(var18 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L210] RET assume(var18 != var20) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [L211] CALL assume(var19 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L211] RET assume(var19 != var20) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1] [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 [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=4] [L215] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L215] RET assume(var11 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=4] [L216] var_for_abs = var1 - var2 [L217] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=2] [L218] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L218] RET assume(var12 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=2] [L219] var_for_abs = var2 - var3 [L220] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=1] [L221] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L221] RET assume(var13 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=1] [L222] var_for_abs = var3 - var4 [L223] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=3] [L224] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L224] RET assume(var14 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=3] [L225] var_for_abs = var4 - var5 [L226] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=5] [L227] CALL assume(var15 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L227] RET assume(var15 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=5] [L228] var_for_abs = var5 - var6 [L229] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=7] [L230] CALL assume(var16 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L230] RET assume(var16 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=7] [L231] var_for_abs = var6 - var7 [L232] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=10] [L233] CALL assume(var17 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L233] RET assume(var17 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, 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 [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=9] [L236] CALL assume(var18 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L236] RET assume(var18 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, 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 [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=8] [L239] CALL assume(var19 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L239] RET assume(var19 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=8] [L240] var_for_abs = var9 - var10 [L241] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=6] [L242] CALL assume(var20 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L242] RET assume(var20 == var_for_abs) VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=6] [L243] reach_error() VAL [dummy=0, myvar0=1, var0=6, var10=7, var11=4, var12=2, var13=1, var14=3, var15=5, var16=7, var17=10, var18=9, var19=8, var1=2, var20=6, var2=4, var3=5, var4=8, var5=3, var6=10, var7=0, var8=9, var9=1, var_for_abs=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 191 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.2s, OverallIterations: 2, TraceHistogramMax: 152, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.2s, 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.9s 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! [2023-12-20 04:09:33,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...