/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_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/xcsp/AllInterval-007.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 11:49:22,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 11:49:22,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 11:49:22,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 11:49:22,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 11:49:22,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 11:49:22,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 11:49:22,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 11:49:22,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 11:49:22,280 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 11:49:22,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 11:49:22,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 11:49:22,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 11:49:22,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 11:49:22,284 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 11:49:22,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 11:49:22,285 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 11:49:22,285 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 11:49:22,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 11:49:22,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 11:49:22,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 11:49:22,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 11:49:22,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 11:49:22,286 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 11:49:22,286 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 11:49:22,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 11:49:22,286 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 11:49:22,287 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 11:49:22,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 11:49:22,287 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 11:49:22,288 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 11:49:22,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 11:49:22,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 11:49:22,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 11:49:22,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 11:49:22,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 11:49:22,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 11:49:22,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 11:49:22,289 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 11:49:22,289 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 11:49:22,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 11:49:22,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 11:49:22,290 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 11:49:22,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 11:49:22,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 11:49:22,291 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 11:49:22,291 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 [2023-12-25 11:49:22,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 11:49:22,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 11:49:22,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 11:49:22,505 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 11:49:22,507 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 11:49:22,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/xcsp/AllInterval-007.c [2023-12-25 11:49:23,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 11:49:23,783 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 11:49:23,783 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-007.c [2023-12-25 11:49:23,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aeeb0b4a/226e6adac62e49e9a784bc8198392980/FLAGd2dd81c09 [2023-12-25 11:49:23,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aeeb0b4a/226e6adac62e49e9a784bc8198392980 [2023-12-25 11:49:23,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 11:49:23,808 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 11:49:23,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 11:49:23,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 11:49:23,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 11:49:23,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 11:49:23" (1/1) ... [2023-12-25 11:49:23,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fb49232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:23, skipping insertion in model container [2023-12-25 11:49:23,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 11:49:23" (1/1) ... [2023-12-25 11:49:23,839 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 11:49:23,953 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-007.c[3690,3703] [2023-12-25 11:49:23,959 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 11:49:23,976 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 11:49:24,004 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-007.c[3690,3703] [2023-12-25 11:49:24,005 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 11:49:24,015 INFO L206 MainTranslator]: Completed translation [2023-12-25 11:49:24,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:24 WrapperNode [2023-12-25 11:49:24,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 11:49:24,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 11:49:24,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 11:49:24,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 11:49:24,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:24" (1/1) ... [2023-12-25 11:49:24,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:24" (1/1) ... [2023-12-25 11:49:24,065 INFO L138 Inliner]: procedures = 13, calls = 75, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 149 [2023-12-25 11:49:24,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 11:49:24,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 11:49:24,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 11:49:24,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 11:49:24,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:24" (1/1) ... [2023-12-25 11:49:24,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:24" (1/1) ... [2023-12-25 11:49:24,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:24" (1/1) ... [2023-12-25 11:49:24,090 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-25 11:49:24,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:24" (1/1) ... [2023-12-25 11:49:24,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:24" (1/1) ... [2023-12-25 11:49:24,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:24" (1/1) ... [2023-12-25 11:49:24,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:24" (1/1) ... [2023-12-25 11:49:24,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:24" (1/1) ... [2023-12-25 11:49:24,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:24" (1/1) ... [2023-12-25 11:49:24,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 11:49:24,121 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 11:49:24,121 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 11:49:24,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 11:49:24,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:24" (1/1) ... [2023-12-25 11:49:24,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 11:49:24,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 11:49:24,176 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-25 11:49:24,192 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-25 11:49:24,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 11:49:24,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 11:49:24,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 11:49:24,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 11:49:24,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2023-12-25 11:49:24,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2023-12-25 11:49:24,272 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 11:49:24,281 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 11:49:24,533 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 11:49:24,551 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 11:49:24,551 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 11:49:24,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 11:49:24 BoogieIcfgContainer [2023-12-25 11:49:24,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 11:49:24,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 11:49:24,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 11:49:24,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 11:49:24,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 11:49:23" (1/3) ... [2023-12-25 11:49:24,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b9ce4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 11:49:24, skipping insertion in model container [2023-12-25 11:49:24,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:24" (2/3) ... [2023-12-25 11:49:24,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b9ce4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 11:49:24, skipping insertion in model container [2023-12-25 11:49:24,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 11:49:24" (3/3) ... [2023-12-25 11:49:24,560 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-007.c [2023-12-25 11:49:24,572 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 11:49:24,573 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 11:49:24,617 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 11:49:24,623 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;@33d7a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 11:49:24,623 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 11:49:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-25 11:49:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2023-12-25 11:49:24,672 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:49:24,673 INFO L195 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:49:24,673 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:49:24,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:49:24,677 INFO L85 PathProgramCache]: Analyzing trace with hash 63591308, now seen corresponding path program 1 times [2023-12-25 11:49:24,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:49:24,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435961728] [2023-12-25 11:49:24,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:49:24,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:49:24,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:49:24,697 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:49:24,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 11:49:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 11:49:24,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 11:49:24,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 11:49:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 4614 proven. 0 refuted. 0 times theorem prover too weak. 4498 trivial. 0 not checked. [2023-12-25 11:49:25,048 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 11:49:25,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 11:49:25,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435961728] [2023-12-25 11:49:25,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435961728] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 11:49:25,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 11:49:25,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 11:49:25,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73218449] [2023-12-25 11:49:25,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 11:49:25,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 11:49:25,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 11:49:25,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 11:49:25,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 11:49:25,087 INFO L87 Difference]: Start difference. First operand has 95 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) [2023-12-25 11:49:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 11:49:25,128 INFO L93 Difference]: Finished difference Result 187 states and 389 transitions. [2023-12-25 11:49:25,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 11:49:25,131 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) Word has length 361 [2023-12-25 11:49:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 11:49:25,138 INFO L225 Difference]: With dead ends: 187 [2023-12-25 11:49:25,138 INFO L226 Difference]: Without dead ends: 94 [2023-12-25 11:49:25,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 360 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-25 11:49:25,144 INFO L413 NwaCegarLoop]: 159 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, 159 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-25 11:49:25,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 11:49:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-25 11:49:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-12-25 11:49:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 24 states have (on average 1.0) internal successors, (24), 24 states have internal predecessors, (24), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-25 11:49:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 160 transitions. [2023-12-25 11:49:25,205 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 160 transitions. Word has length 361 [2023-12-25 11:49:25,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 11:49:25,205 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 160 transitions. [2023-12-25 11:49:25,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 2 states have call predecessors, (68), 2 states have call successors, (68) [2023-12-25 11:49:25,206 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 160 transitions. [2023-12-25 11:49:25,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2023-12-25 11:49:25,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:49:25,217 INFO L195 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 11:49:25,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 11:49:25,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:49:25,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:49:25,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:49:25,427 INFO L85 PathProgramCache]: Analyzing trace with hash 680341824, now seen corresponding path program 1 times [2023-12-25 11:49:25,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:49:25,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809955644] [2023-12-25 11:49:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:49:25,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:49:25,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:49:25,430 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:49:25,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 11:49:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 11:49:25,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 11:49:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 11:49:26,380 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 11:49:26,380 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 11:49:26,382 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 11:49:26,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 11:49:26,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:49:26,597 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-25 11:49:26,600 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 11:49:26,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 11:49:26 BoogieIcfgContainer [2023-12-25 11:49:26,681 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 11:49:26,681 INFO L158 Benchmark]: Toolchain (without parser) took 2872.81ms. Allocated memory was 201.3MB in the beginning and 363.9MB in the end (delta: 162.5MB). Free memory was 149.5MB in the beginning and 237.8MB in the end (delta: -88.3MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. [2023-12-25 11:49:26,682 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 11:49:26,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.21ms. Allocated memory is still 201.3MB. Free memory was 149.5MB in the beginning and 136.3MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 11:49:26,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.95ms. Allocated memory is still 201.3MB. Free memory was 136.3MB in the beginning and 134.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 11:49:26,682 INFO L158 Benchmark]: Boogie Preprocessor took 42.00ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 132.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 11:49:26,683 INFO L158 Benchmark]: RCFGBuilder took 430.94ms. Allocated memory is still 201.3MB. Free memory was 132.1MB in the beginning and 113.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-25 11:49:26,683 INFO L158 Benchmark]: TraceAbstraction took 2125.73ms. Allocated memory was 201.3MB in the beginning and 363.9MB in the end (delta: 162.5MB). Free memory was 112.5MB in the beginning and 237.8MB in the end (delta: -125.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2023-12-25 11:49:26,685 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 201.3MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.21ms. Allocated memory is still 201.3MB. Free memory was 149.5MB in the beginning and 136.3MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.95ms. Allocated memory is still 201.3MB. Free memory was 136.3MB in the beginning and 134.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.00ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 132.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 430.94ms. Allocated memory is still 201.3MB. Free memory was 132.1MB in the beginning and 113.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 2125.73ms. Allocated memory was 201.3MB in the beginning and 363.9MB in the end (delta: 162.5MB). Free memory was 112.5MB in the beginning and 237.8MB in the end (delta: -125.3MB). Peak memory consumption was 38.8MB. 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: 135]: 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=4] [L30] CALL assume(var0 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 6) VAL [dummy=0, var0=4] [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=4, var1=0] [L34] CALL assume(var1 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 6) VAL [dummy=0, var0=4, var1=0] [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=4, var1=0, var2=6] [L38] CALL assume(var2 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 6) VAL [dummy=0, var0=4, var1=0, var2=6] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L41] RET assume(var3 >= 0) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1] [L42] CALL assume(var3 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 6) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1] [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=4, var1=0, var2=6, var3=1, var4=3] [L46] CALL assume(var4 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 6) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=3] [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=4, var1=0, var2=6, var3=1, var4=3, var5=2] [L50] CALL assume(var5 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 6) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=3, var5=2] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L53] RET assume(var6 >= 0) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5] [L54] CALL assume(var6 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 6) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L57] RET assume(var7 >= 1) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4] [L58] CALL assume(var7 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 6) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L61] RET assume(var8 >= 1) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6] [L62] CALL assume(var8 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 6) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L65] RET assume(var9 >= 1) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L66] CALL assume(var9 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var9 <= 6) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L69] RET assume(var10 >= 1) VAL [dummy=0, var0=4, var10=2, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L70] CALL assume(var10 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var10 <= 6) VAL [dummy=0, var0=4, var10=2, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [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=4, var10=2, var11=1, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L74] CALL assume(var11 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var11 <= 6) VAL [dummy=0, var0=4, var10=2, var11=1, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [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=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L78] CALL assume(var12 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var12 <= 6) VAL [dummy=0, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L79] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L80] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L81] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L81] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L82] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L83] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L83] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L84] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L84] RET assume(var0 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L85] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L85] RET assume(var0 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L86] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L87] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L88] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L89] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L89] RET assume(var1 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L90] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume(var1 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L91] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L92] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L93] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L93] RET assume(var2 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L94] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L94] RET assume(var2 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L95] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L95] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L96] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L96] RET assume(var3 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L97] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L97] RET assume(var3 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L98] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L98] RET assume(var4 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L99] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L99] RET assume(var4 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L100] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L100] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L101] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L101] RET assume(var7 != var8) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L102] CALL assume(var7 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L102] RET assume(var7 != var9) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L103] CALL assume(var7 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L103] RET assume(var7 != var10) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L104] CALL assume(var7 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L104] RET assume(var7 != var11) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L105] CALL assume(var7 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L105] RET assume(var7 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L106] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L106] RET assume(var8 != var9) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L107] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L107] RET assume(var8 != var10) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L108] CALL assume(var8 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L108] RET assume(var8 != var11) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L109] CALL assume(var8 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L109] RET assume(var8 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L110] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L110] RET assume(var9 != var10) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L111] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L111] RET assume(var9 != var11) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L112] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var9 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L113] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L113] RET assume(var10 != var11) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L114] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L114] RET assume(var10 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L115] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L115] RET assume(var11 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5] [L116] int var_for_abs; [L117] var_for_abs = var0 - var1 [L118] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5, var_for_abs=4] [L119] CALL assume(var7 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L119] RET assume(var7 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5, var_for_abs=4] [L120] var_for_abs = var1 - var2 [L121] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5, var_for_abs=6] [L122] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L122] RET assume(var8 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5, var_for_abs=6] [L123] var_for_abs = var2 - var3 [L124] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5, var_for_abs=5] [L125] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L125] RET assume(var9 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5, var_for_abs=5] [L126] var_for_abs = var3 - var4 [L127] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5, var_for_abs=2] [L128] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L128] RET assume(var10 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5, var_for_abs=2] [L129] var_for_abs = var4 - var5 [L130] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5, var_for_abs=1] [L131] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L131] RET assume(var11 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5, var_for_abs=1] [L132] var_for_abs = var5 - var6 [L133] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5, var_for_abs=3] [L134] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L134] RET assume(var12 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5, var_for_abs=3] [L135] reach_error() VAL [dummy=0, myvar0=1, var0=4, var10=2, var11=1, var12=3, var1=0, var2=6, var3=1, var4=3, var5=2, var6=5, var7=4, var8=6, var9=5, var_for_abs=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 2, TraceHistogramMax: 68, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 159 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, 159 mSDtfsCounter, 1 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 722 NumberOfCodeBlocks, 722 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 509 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 9112/9112 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-25 11:49:26,702 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...