/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/xcsp/AllInterval-008.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 14:49:23,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 14:49:24,030 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-21 14:49:24,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 14:49:24,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 14:49:24,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 14:49:24,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 14:49:24,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 14:49:24,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 14:49:24,065 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 14:49:24,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 14:49:24,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 14:49:24,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 14:49:24,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 14:49:24,067 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 14:49:24,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 14:49:24,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 14:49:24,068 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 14:49:24,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 14:49:24,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 14:49:24,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 14:49:24,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 14:49:24,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 14:49:24,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 14:49:24,071 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 14:49:24,071 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 14:49:24,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 14:49:24,071 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 14:49:24,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 14:49:24,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 14:49:24,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 14:49:24,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 14:49:24,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 14:49:24,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 14:49:24,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 14:49:24,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 14:49:24,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 14:49:24,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 14:49:24,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 14:49:24,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 14:49:24,075 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 14:49:24,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 14:49:24,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 14:49:24,076 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 -> false [2023-12-21 14:49:24,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 14:49:24,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 14:49:24,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 14:49:24,325 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 14:49:24,325 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 14:49:24,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/xcsp/AllInterval-008.c [2023-12-21 14:49:25,475 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 14:49:25,638 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 14:49:25,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-008.c [2023-12-21 14:49:25,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc582f371/2e3f1ffb67e141808ab64f53afd24b98/FLAG88ddc879a [2023-12-21 14:49:25,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc582f371/2e3f1ffb67e141808ab64f53afd24b98 [2023-12-21 14:49:25,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 14:49:25,659 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 14:49:25,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 14:49:25,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 14:49:25,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 14:49:25,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:49:25" (1/1) ... [2023-12-21 14:49:25,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4952a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:25, skipping insertion in model container [2023-12-21 14:49:25,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:49:25" (1/1) ... [2023-12-21 14:49:25,701 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 14:49:25,849 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-008.c[4334,4347] [2023-12-21 14:49:25,854 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 14:49:25,863 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 14:49:25,888 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-008.c[4334,4347] [2023-12-21 14:49:25,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 14:49:25,901 INFO L206 MainTranslator]: Completed translation [2023-12-21 14:49:25,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:25 WrapperNode [2023-12-21 14:49:25,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 14:49:25,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 14:49:25,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 14:49:25,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 14:49:25,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:25" (1/1) ... [2023-12-21 14:49:25,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:25" (1/1) ... [2023-12-21 14:49:25,964 INFO L138 Inliner]: procedures = 13, calls = 93, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 192 [2023-12-21 14:49:25,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 14:49:25,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 14:49:25,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 14:49:25,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 14:49:25,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:25" (1/1) ... [2023-12-21 14:49:25,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:25" (1/1) ... [2023-12-21 14:49:25,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:25" (1/1) ... [2023-12-21 14:49:25,998 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-21 14:49:25,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:25" (1/1) ... [2023-12-21 14:49:25,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:25" (1/1) ... [2023-12-21 14:49:26,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:25" (1/1) ... [2023-12-21 14:49:26,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:25" (1/1) ... [2023-12-21 14:49:26,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:25" (1/1) ... [2023-12-21 14:49:26,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:25" (1/1) ... [2023-12-21 14:49:26,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 14:49:26,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 14:49:26,010 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 14:49:26,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 14:49:26,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:25" (1/1) ... [2023-12-21 14:49:26,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 14:49:26,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:49:26,045 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-21 14:49:26,057 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-21 14:49:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 14:49:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 14:49:26,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 14:49:26,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 14:49:26,077 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2023-12-21 14:49:26,077 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2023-12-21 14:49:26,134 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 14:49:26,136 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 14:49:26,351 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 14:49:26,372 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 14:49:26,372 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-21 14:49:26,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:49:26 BoogieIcfgContainer [2023-12-21 14:49:26,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 14:49:26,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 14:49:26,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 14:49:26,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 14:49:26,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:49:25" (1/3) ... [2023-12-21 14:49:26,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564f34fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:49:26, skipping insertion in model container [2023-12-21 14:49:26,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:25" (2/3) ... [2023-12-21 14:49:26,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564f34fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:49:26, skipping insertion in model container [2023-12-21 14:49:26,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:49:26" (3/3) ... [2023-12-21 14:49:26,404 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-008.c [2023-12-21 14:49:26,418 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 14:49:26,419 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 14:49:26,474 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 14:49:26,483 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;@5464dcf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 14:49:26,483 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 14:49:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-21 14:49:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2023-12-21 14:49:26,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:49:26,512 INFO L195 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:49:26,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:49:26,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:49:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1018465269, now seen corresponding path program 1 times [2023-12-21 14:49:26,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:49:26,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460321541] [2023-12-21 14:49:26,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:49:26,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:49:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:49:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 14:49:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 14:49:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 14:49:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 14:49:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-21 14:49:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 14:49:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 14:49:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 14:49:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:49:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 14:49:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-21 14:49:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-21 14:49:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-21 14:49:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-21 14:49:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 14:49:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 14:49:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-21 14:49:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-21 14:49:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 14:49:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-21 14:49:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 14:49:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 14:49:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-12-21 14:49:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-12-21 14:49:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-21 14:49:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-12-21 14:49:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:26,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-12-21 14:49:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-12-21 14:49:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-12-21 14:49:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-12-21 14:49:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-12-21 14:49:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-21 14:49:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-12-21 14:49:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-12-21 14:49:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-12-21 14:49:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 14:49:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-12-21 14:49:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-21 14:49:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-21 14:49:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-12-21 14:49:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-12-21 14:49:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-12-21 14:49:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 14:49:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 14:49:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-21 14:49:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-12-21 14:49:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-12-21 14:49:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2023-12-21 14:49:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-21 14:49:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2023-12-21 14:49:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-12-21 14:49:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2023-12-21 14:49:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2023-12-21 14:49:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2023-12-21 14:49:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2023-12-21 14:49:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2023-12-21 14:49:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2023-12-21 14:49:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2023-12-21 14:49:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2023-12-21 14:49:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2023-12-21 14:49:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2023-12-21 14:49:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-12-21 14:49:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2023-12-21 14:49:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2023-12-21 14:49:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2023-12-21 14:49:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2023-12-21 14:49:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2023-12-21 14:49:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2023-12-21 14:49:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2023-12-21 14:49:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2023-12-21 14:49:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2023-12-21 14:49:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2023-12-21 14:49:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2023-12-21 14:49:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2023-12-21 14:49:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2023-12-21 14:49:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 396 [2023-12-21 14:49:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 401 [2023-12-21 14:49:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2023-12-21 14:49:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2023-12-21 14:49:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 418 [2023-12-21 14:49:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2023-12-21 14:49:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 430 [2023-12-21 14:49:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2023-12-21 14:49:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2023-12-21 14:49:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 448 [2023-12-21 14:49:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2023-12-21 14:49:27,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:49:27,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460321541] [2023-12-21 14:49:27,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460321541] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:49:27,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 14:49:27,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 14:49:27,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664521169] [2023-12-21 14:49:27,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:49:27,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 14:49:27,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:49:27,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 14:49:27,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 14:49:27,253 INFO L87 Difference]: Start difference. First operand has 116 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2023-12-21 14:49:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:49:27,303 INFO L93 Difference]: Finished difference Result 229 states and 485 transitions. [2023-12-21 14:49:27,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 14:49:27,305 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) Word has length 454 [2023-12-21 14:49:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:49:27,314 INFO L225 Difference]: With dead ends: 229 [2023-12-21 14:49:27,314 INFO L226 Difference]: Without dead ends: 115 [2023-12-21 14:49:27,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 260 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-21 14:49:27,321 INFO L413 NwaCegarLoop]: 198 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, 198 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-21 14:49:27,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 14:49:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-21 14:49:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-12-21 14:49:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 27 states have (on average 1.0) internal successors, (27), 27 states have internal predecessors, (27), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-21 14:49:27,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 199 transitions. [2023-12-21 14:49:27,396 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 199 transitions. Word has length 454 [2023-12-21 14:49:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:49:27,396 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 199 transitions. [2023-12-21 14:49:27,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2023-12-21 14:49:27,397 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 199 transitions. [2023-12-21 14:49:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2023-12-21 14:49:27,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:49:27,409 INFO L195 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 14:49:27,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 14:49:27,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:49:27,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:49:27,410 INFO L85 PathProgramCache]: Analyzing trace with hash -406206299, now seen corresponding path program 1 times [2023-12-21 14:49:27,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:49:27,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865683484] [2023-12-21 14:49:27,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:49:27,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:49:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 14:49:28,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 14:49:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 14:49:30,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 14:49:30,074 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 14:49:30,075 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 14:49:30,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 14:49:30,080 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-21 14:49:30,084 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 14:49:30,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:49:30 BoogieIcfgContainer [2023-12-21 14:49:30,204 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 14:49:30,205 INFO L158 Benchmark]: Toolchain (without parser) took 4546.01ms. Allocated memory was 201.3MB in the beginning and 337.6MB in the end (delta: 136.3MB). Free memory was 156.4MB in the beginning and 207.2MB in the end (delta: -50.8MB). Peak memory consumption was 178.7MB. Max. memory is 8.0GB. [2023-12-21 14:49:30,205 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 158.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 14:49:30,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.34ms. Allocated memory is still 201.3MB. Free memory was 156.4MB in the beginning and 143.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 14:49:30,206 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.80ms. Allocated memory is still 201.3MB. Free memory was 143.5MB in the beginning and 141.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 14:49:30,207 INFO L158 Benchmark]: Boogie Preprocessor took 43.74ms. Allocated memory is still 201.3MB. Free memory was 141.1MB in the beginning and 139.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 14:49:30,207 INFO L158 Benchmark]: RCFGBuilder took 363.27ms. Allocated memory is still 201.3MB. Free memory was 139.3MB in the beginning and 119.8MB in the end (delta: 19.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-21 14:49:30,208 INFO L158 Benchmark]: TraceAbstraction took 3829.45ms. Allocated memory was 201.3MB in the beginning and 337.6MB in the end (delta: 136.3MB). Free memory was 119.1MB in the beginning and 207.2MB in the end (delta: -88.1MB). Peak memory consumption was 142.0MB. Max. memory is 8.0GB. [2023-12-21 14:49:30,210 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 158.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.34ms. Allocated memory is still 201.3MB. Free memory was 156.4MB in the beginning and 143.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.80ms. Allocated memory is still 201.3MB. Free memory was 143.5MB in the beginning and 141.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.74ms. Allocated memory is still 201.3MB. Free memory was 141.1MB in the beginning and 139.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 363.27ms. Allocated memory is still 201.3MB. Free memory was 139.3MB in the beginning and 119.8MB in the end (delta: 19.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 3829.45ms. Allocated memory was 201.3MB in the beginning and 337.6MB in the end (delta: 136.3MB). Free memory was 119.1MB in the beginning and 207.2MB in the end (delta: -88.1MB). Peak memory consumption was 142.0MB. 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: 159]: 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 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 7) 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=3] [L34] CALL assume(var1 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 7) VAL [dummy=0, var0=4, var1=3] [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=3, var2=5] [L38] CALL assume(var2 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 7) VAL [dummy=0, var0=4, var1=3, var2=5] [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=3, var2=5, var3=2] [L42] CALL assume(var3 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 7) VAL [dummy=0, var0=4, var1=3, var2=5, var3=2] [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=3, var2=5, var3=2, var4=6] [L46] CALL assume(var4 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 7) VAL [dummy=0, var0=4, var1=3, var2=5, var3=2, var4=6] [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=3, var2=5, var3=2, var4=6, var5=1] [L50] CALL assume(var5 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 7) VAL [dummy=0, var0=4, var1=3, var2=5, var3=2, var4=6, var5=1] [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=3, var2=5, var3=2, var4=6, var5=1, var6=7] [L54] CALL assume(var6 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 7) VAL [dummy=0, var0=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7] [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=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0] [L58] CALL assume(var7 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 7) VAL [dummy=0, var0=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0] [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=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1] [L62] CALL assume(var8 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 7) VAL [dummy=0, var0=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1] [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=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L66] CALL assume(var9 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var9 <= 7) VAL [dummy=0, var0=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [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=3, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L70] CALL assume(var10 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var10 <= 7) VAL [dummy=0, var0=4, var10=3, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [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=3, var11=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L74] CALL assume(var11 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var11 <= 7) VAL [dummy=0, var0=4, var10=3, var11=4, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [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=3, var11=4, var12=5, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L78] CALL assume(var12 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var12 <= 7) VAL [dummy=0, var0=4, var10=3, var11=4, var12=5, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [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=4, var10=3, var11=4, var12=5, var13=6, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L82] CALL assume(var13 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume(var13 <= 7) VAL [dummy=0, var0=4, var10=3, var11=4, var12=5, var13=6, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [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=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L86] CALL assume(var14 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var14 <= 7) VAL [dummy=0, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L87] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L88] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L89] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L89] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L90] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L91] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L92] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var0 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L93] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L93] RET assume(var0 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L94] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L94] RET assume(var0 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L95] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L95] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L96] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L96] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L97] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L97] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L98] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L98] RET assume(var1 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L99] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L99] RET assume(var1 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L100] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L100] RET assume(var1 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L101] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L101] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L102] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L102] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L103] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L103] RET assume(var2 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L104] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L104] RET assume(var2 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L105] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L105] RET assume(var2 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L106] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L106] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L107] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L107] RET assume(var3 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L108] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L108] RET assume(var3 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L109] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L109] RET assume(var3 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L110] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L110] RET assume(var4 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L111] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L111] RET assume(var4 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L112] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var4 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L113] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L113] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L114] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L114] RET assume(var5 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L115] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L115] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L116] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L116] RET assume(var8 != var9) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L117] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L117] RET assume(var8 != var10) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L118] CALL assume(var8 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L118] RET assume(var8 != var11) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L119] CALL assume(var8 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L119] RET assume(var8 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L120] CALL assume(var8 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L120] RET assume(var8 != var13) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L121] CALL assume(var8 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L121] RET assume(var8 != var14) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L122] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L122] RET assume(var9 != var10) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L123] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L123] RET assume(var9 != var11) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L124] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L124] RET assume(var9 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L125] CALL assume(var9 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L125] RET assume(var9 != var13) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L126] CALL assume(var9 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L126] RET assume(var9 != var14) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L127] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L127] RET assume(var10 != var11) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L128] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L128] RET assume(var10 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L129] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L129] RET assume(var10 != var13) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L130] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L130] RET assume(var10 != var14) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L131] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L131] RET assume(var11 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L132] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L132] RET assume(var11 != var13) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L133] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L133] RET assume(var11 != var14) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L134] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L134] RET assume(var12 != var13) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L135] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L135] RET assume(var12 != var14) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L136] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L136] RET assume(var13 != var14) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2] [L137] int var_for_abs; [L138] var_for_abs = var0 - var1 [L139] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=1] [L140] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L140] RET assume(var8 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=1] [L141] var_for_abs = var1 - var2 [L142] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=2] [L143] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L143] RET assume(var9 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=2] [L144] var_for_abs = var2 - var3 [L145] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=3] [L146] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L146] RET assume(var10 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=3] [L147] var_for_abs = var3 - var4 [L148] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=4] [L149] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L149] RET assume(var11 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=4] [L150] var_for_abs = var4 - var5 [L151] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=5] [L152] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L152] RET assume(var12 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=5] [L153] var_for_abs = var5 - var6 [L154] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=6] [L155] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L155] RET assume(var13 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=6] [L156] var_for_abs = var6 - var7 [L157] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=7] [L158] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L158] RET assume(var14 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=7] [L159] reach_error() VAL [dummy=0, myvar0=1, var0=4, var10=3, var11=4, var12=5, var13=6, var14=7, var1=3, var2=5, var3=2, var4=6, var5=1, var6=7, var7=0, var8=1, var9=2, var_for_abs=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 2, TraceHistogramMax: 86, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, 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, 198 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, 198 mSDtfsCounter, 1 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred 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.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 908 NumberOfCodeBlocks, 908 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 14620/14620 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-21 14:49:30,237 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...