./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-009.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-009.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 467fcaafa9af0a00772f5009c99943c6cb7078cb0bca94a00a243b41a6183129 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 23:05:03,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 23:05:03,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 23:05:03,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 23:05:03,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 23:05:03,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 23:05:03,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 23:05:03,934 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 23:05:03,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 23:05:03,934 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 23:05:03,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 23:05:03,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 23:05:03,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 23:05:03,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 23:05:03,936 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 23:05:03,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 23:05:03,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 23:05:03,937 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 23:05:03,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 23:05:03,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 23:05:03,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 23:05:03,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 23:05:03,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 23:05:03,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 23:05:03,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 23:05:03,941 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 23:05:03,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 23:05:03,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 23:05:03,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 23:05:03,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 23:05:03,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 23:05:03,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 23:05:03,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 23:05:03,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 23:05:03,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 23:05:03,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 23:05:03,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 23:05:03,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 23:05:03,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 23:05:03,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 23:05:03,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 23:05:03,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 23:05:03,945 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 467fcaafa9af0a00772f5009c99943c6cb7078cb0bca94a00a243b41a6183129 [2024-11-19 23:05:04,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 23:05:04,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 23:05:04,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 23:05:04,187 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 23:05:04,188 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 23:05:04,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-009.c [2024-11-19 23:05:05,324 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 23:05:05,533 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 23:05:05,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-009.c [2024-11-19 23:05:05,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00031143f/2bb462edad884d649e4b07c60890a624/FLAGb4da4a4fa [2024-11-19 23:05:05,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00031143f/2bb462edad884d649e4b07c60890a624 [2024-11-19 23:05:05,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 23:05:05,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 23:05:05,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 23:05:05,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 23:05:05,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 23:05:05,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:05:05" (1/1) ... [2024-11-19 23:05:05,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c388ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:05, skipping insertion in model container [2024-11-19 23:05:05,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:05:05" (1/1) ... [2024-11-19 23:05:05,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 23:05:06,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-009.c[5030,5043] [2024-11-19 23:05:06,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 23:05:06,150 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 23:05:06,182 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-009.c[5030,5043] [2024-11-19 23:05:06,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 23:05:06,195 INFO L204 MainTranslator]: Completed translation [2024-11-19 23:05:06,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:06 WrapperNode [2024-11-19 23:05:06,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 23:05:06,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 23:05:06,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 23:05:06,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 23:05:06,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:06" (1/1) ... [2024-11-19 23:05:06,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:06" (1/1) ... [2024-11-19 23:05:06,228 INFO L138 Inliner]: procedures = 13, calls = 113, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 224 [2024-11-19 23:05:06,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 23:05:06,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 23:05:06,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 23:05:06,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 23:05:06,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:06" (1/1) ... [2024-11-19 23:05:06,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:06" (1/1) ... [2024-11-19 23:05:06,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:06" (1/1) ... [2024-11-19 23:05:06,249 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 23:05:06,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:06" (1/1) ... [2024-11-19 23:05:06,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:06" (1/1) ... [2024-11-19 23:05:06,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:06" (1/1) ... [2024-11-19 23:05:06,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:06" (1/1) ... [2024-11-19 23:05:06,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:06" (1/1) ... [2024-11-19 23:05:06,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:06" (1/1) ... [2024-11-19 23:05:06,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 23:05:06,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 23:05:06,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 23:05:06,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 23:05:06,258 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:06" (1/1) ... [2024-11-19 23:05:06,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 23:05:06,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 23:05:06,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 23:05:06,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 23:05:06,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 23:05:06,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 23:05:06,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 23:05:06,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 23:05:06,342 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2024-11-19 23:05:06,342 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2024-11-19 23:05:06,396 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 23:05:06,398 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 23:05:06,677 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-19 23:05:06,678 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 23:05:06,695 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 23:05:06,697 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 23:05:06,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:05:06 BoogieIcfgContainer [2024-11-19 23:05:06,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 23:05:06,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 23:05:06,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 23:05:06,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 23:05:06,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:05:05" (1/3) ... [2024-11-19 23:05:06,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a02f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:05:06, skipping insertion in model container [2024-11-19 23:05:06,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:05:06" (2/3) ... [2024-11-19 23:05:06,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a02f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:05:06, skipping insertion in model container [2024-11-19 23:05:06,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:05:06" (3/3) ... [2024-11-19 23:05:06,704 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-009.c [2024-11-19 23:05:06,715 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 23:05:06,715 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 23:05:06,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 23:05:06,763 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64c354cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 23:05:06,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 23:05:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-19 23:05:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2024-11-19 23:05:06,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:05:06,792 INFO L215 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:05:06,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:05:06,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:05:06,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1062357624, now seen corresponding path program 1 times [2024-11-19 23:05:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:05:06,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196389345] [2024-11-19 23:05:06,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:05:06,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:05:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 23:05:09,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 23:05:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 23:05:11,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 23:05:11,367 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 23:05:11,368 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 23:05:11,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 23:05:11,373 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-19 23:05:11,480 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 23:05:11,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:05:11 BoogieIcfgContainer [2024-11-19 23:05:11,482 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 23:05:11,482 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 23:05:11,483 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 23:05:11,483 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 23:05:11,483 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:05:06" (3/4) ... [2024-11-19 23:05:11,484 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 23:05:11,583 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 23:05:11,583 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 23:05:11,584 INFO L158 Benchmark]: Toolchain (without parser) took 5646.67ms. Allocated memory was 190.8MB in the beginning and 683.7MB in the end (delta: 492.8MB). Free memory was 160.1MB in the beginning and 525.9MB in the end (delta: -365.8MB). Peak memory consumption was 125.6MB. Max. memory is 16.1GB. [2024-11-19 23:05:11,584 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 109.1MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 23:05:11,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.49ms. Allocated memory is still 190.8MB. Free memory was 160.1MB in the beginning and 145.0MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 23:05:11,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.56ms. Allocated memory is still 190.8MB. Free memory was 145.0MB in the beginning and 142.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 23:05:11,585 INFO L158 Benchmark]: Boogie Preprocessor took 28.12ms. Allocated memory is still 190.8MB. Free memory was 142.9MB in the beginning and 140.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 23:05:11,585 INFO L158 Benchmark]: RCFGBuilder took 439.51ms. Allocated memory is still 190.8MB. Free memory was 139.8MB in the beginning and 145.4MB in the end (delta: -5.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 23:05:11,585 INFO L158 Benchmark]: TraceAbstraction took 4783.46ms. Allocated memory was 190.8MB in the beginning and 683.7MB in the end (delta: 492.8MB). Free memory was 144.3MB in the beginning and 543.7MB in the end (delta: -399.4MB). Peak memory consumption was 408.0MB. Max. memory is 16.1GB. [2024-11-19 23:05:11,585 INFO L158 Benchmark]: Witness Printer took 100.87ms. Allocated memory is still 683.7MB. Free memory was 543.7MB in the beginning and 525.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 23:05:11,586 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 109.1MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.49ms. Allocated memory is still 190.8MB. Free memory was 160.1MB in the beginning and 145.0MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.56ms. Allocated memory is still 190.8MB. Free memory was 145.0MB in the beginning and 142.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.12ms. Allocated memory is still 190.8MB. Free memory was 142.9MB in the beginning and 140.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 439.51ms. Allocated memory is still 190.8MB. Free memory was 139.8MB in the beginning and 145.4MB in the end (delta: -5.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4783.46ms. Allocated memory was 190.8MB in the beginning and 683.7MB in the end (delta: 492.8MB). Free memory was 144.3MB in the beginning and 543.7MB in the end (delta: -399.4MB). Peak memory consumption was 408.0MB. Max. memory is 16.1GB. * Witness Printer took 100.87ms. Allocated memory is still 683.7MB. Free memory was 543.7MB in the beginning and 525.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 185]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L29] RET assume(var0 >= 0) VAL [var0=1] [L30] CALL assume(var0 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L30] RET assume(var0 <= 8) VAL [var0=1] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L33] RET assume(var1 >= 0) VAL [var0=1, var1=8] [L34] CALL assume(var1 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L34] RET assume(var1 <= 8) VAL [var0=1, var1=8] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L37] RET assume(var2 >= 0) VAL [var0=1, var1=8, var2=0] [L38] CALL assume(var2 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L38] RET assume(var2 <= 8) VAL [var0=1, var1=8, var2=0] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L41] RET assume(var3 >= 0) VAL [var0=1, var1=8, var2=0, var3=6] [L42] CALL assume(var3 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L42] RET assume(var3 <= 8) VAL [var0=1, var1=8, var2=0, var3=6] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L45] RET assume(var4 >= 0) VAL [var0=1, var1=8, var2=0, var3=6, var4=4] [L46] CALL assume(var4 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L46] RET assume(var4 <= 8) VAL [var0=1, var1=8, var2=0, var3=6, var4=4] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L49] RET assume(var5 >= 0) VAL [var0=1, var1=8, var2=0, var3=6, var4=4, var5=3] [L50] CALL assume(var5 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L50] RET assume(var5 <= 8) VAL [var0=1, var1=8, var2=0, var3=6, var4=4, var5=3] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L53] RET assume(var6 >= 0) VAL [var0=1, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7] [L54] CALL assume(var6 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L54] RET assume(var6 <= 8) VAL [var0=1, var1=8, var2=0, var3=6, var4=4, var5=3, 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] [L57] RET assume(var7 >= 0) VAL [var0=1, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2] [L58] CALL assume(var7 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET assume(var7 <= 8) VAL [var0=1, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L61] RET assume(var8 >= 0) VAL [var0=1, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5] [L62] CALL assume(var8 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L62] RET assume(var8 <= 8) VAL [var0=1, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5] [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] [L65] RET assume(var9 >= 1) VAL [var0=1, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L66] CALL assume(var9 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L66] RET assume(var9 <= 8) VAL [var0=1, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [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] [L69] RET assume(var10 >= 1) VAL [var0=1, var10=8, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L70] CALL assume(var10 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L70] RET assume(var10 <= 8) VAL [var0=1, var10=8, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L73] RET assume(var11 >= 1) VAL [var0=1, var10=8, var11=6, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L74] CALL assume(var11 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L74] RET assume(var11 <= 8) VAL [var0=1, var10=8, var11=6, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L77] RET assume(var12 >= 1) VAL [var0=1, var10=8, var11=6, var12=2, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L78] CALL assume(var12 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L78] RET assume(var12 <= 8) VAL [var0=1, var10=8, var11=6, var12=2, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L79] int var13; [L80] var13 = __VERIFIER_nondet_int() [L81] CALL assume(var13 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L81] RET assume(var13 >= 1) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L82] CALL assume(var13 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L82] RET assume(var13 <= 8) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L83] int var14; [L84] var14 = __VERIFIER_nondet_int() [L85] CALL assume(var14 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L85] RET assume(var14 >= 1) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L86] CALL assume(var14 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L86] RET assume(var14 <= 8) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L87] int var15; [L88] var15 = __VERIFIER_nondet_int() [L89] CALL assume(var15 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L89] RET assume(var15 >= 1) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L90] CALL assume(var15 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L90] RET assume(var15 <= 8) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L91] int var16; [L92] var16 = __VERIFIER_nondet_int() [L93] CALL assume(var16 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L93] RET assume(var16 >= 1) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L94] CALL assume(var16 <= 8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L94] RET assume(var16 <= 8) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L95] int myvar0 = 1; VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L96] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L96] RET assume(var0 != var1) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L97] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L97] RET assume(var0 != var2) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L98] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L98] RET assume(var0 != var3) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L99] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L99] RET assume(var0 != var4) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L100] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L100] RET assume(var0 != var5) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L101] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L101] RET assume(var0 != var6) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L102] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L102] RET assume(var0 != var7) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L103] CALL assume(var0 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L103] RET assume(var0 != var8) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L104] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L104] RET assume(var1 != var2) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L105] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L105] RET assume(var1 != var3) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L106] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L106] RET assume(var1 != var4) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L107] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L107] RET assume(var1 != var5) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L108] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L108] RET assume(var1 != var6) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L109] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L109] RET assume(var1 != var7) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L110] CALL assume(var1 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L110] RET assume(var1 != var8) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L111] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L111] RET assume(var2 != var3) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L112] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L112] RET assume(var2 != var4) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L113] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L113] RET assume(var2 != var5) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L114] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L114] RET assume(var2 != var6) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L115] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L115] RET assume(var2 != var7) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L116] CALL assume(var2 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L116] RET assume(var2 != var8) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L117] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L117] RET assume(var3 != var4) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L118] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L118] RET assume(var3 != var5) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L119] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L119] RET assume(var3 != var6) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L120] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L120] RET assume(var3 != var7) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L121] CALL assume(var3 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L121] RET assume(var3 != var8) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L122] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L122] RET assume(var4 != var5) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L123] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L123] RET assume(var4 != var6) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L124] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L124] RET assume(var4 != var7) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L125] CALL assume(var4 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L125] RET assume(var4 != var8) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L126] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L126] RET assume(var5 != var6) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L127] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L127] RET assume(var5 != var7) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L128] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L128] RET assume(var5 != var8) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L129] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L129] RET assume(var6 != var7) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L130] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L130] RET assume(var6 != var8) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L131] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L131] RET assume(var7 != var8) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L132] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L132] RET assume(var9 != var10) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L133] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L133] RET assume(var9 != var11) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L134] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L134] RET assume(var9 != var12) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L135] CALL assume(var9 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L135] RET assume(var9 != var13) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L136] CALL assume(var9 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L136] RET assume(var9 != var14) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L137] CALL assume(var9 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L137] RET assume(var9 != var15) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L138] CALL assume(var9 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L138] RET assume(var9 != var16) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L139] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L139] RET assume(var10 != var11) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L140] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L140] RET assume(var10 != var12) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L141] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L141] RET assume(var10 != var13) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L142] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L142] RET assume(var10 != var14) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L143] CALL assume(var10 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L143] RET assume(var10 != var15) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L144] CALL assume(var10 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L144] RET assume(var10 != var16) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L145] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L145] RET assume(var11 != var12) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L146] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L146] RET assume(var11 != var13) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L147] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L147] RET assume(var11 != var14) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L148] CALL assume(var11 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L148] RET assume(var11 != var15) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L149] CALL assume(var11 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L149] RET assume(var11 != var16) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L150] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L150] RET assume(var12 != var13) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L151] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L151] RET assume(var12 != var14) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L152] CALL assume(var12 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L152] RET assume(var12 != var15) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L153] CALL assume(var12 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L153] RET assume(var12 != var16) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L154] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L154] RET assume(var13 != var14) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L155] CALL assume(var13 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L155] RET assume(var13 != var15) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L156] CALL assume(var13 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L156] RET assume(var13 != var16) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L157] CALL assume(var14 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L157] RET assume(var14 != var15) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L158] CALL assume(var14 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L158] RET assume(var14 != var16) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L159] CALL assume(var15 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L159] RET assume(var15 != var16) VAL [var0=1, var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7] [L160] int var_for_abs; [L161] var_for_abs = var0 - var1 [L162] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7, var_for_abs=7] [L163] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L163] RET assume(var9 == var_for_abs) VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var1=8, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7, var_for_abs=7] [L164] var_for_abs = var1 - var2 [L165] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7, var_for_abs=8] [L166] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L166] RET assume(var10 == var_for_abs) VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var2=0, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7, var_for_abs=8] [L167] var_for_abs = var2 - var3 [L168] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7, var_for_abs=6] [L169] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L169] RET assume(var11 == var_for_abs) VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var3=6, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7, var_for_abs=6] [L170] var_for_abs = var3 - var4 [L171] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7, var_for_abs=2] [L172] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L172] RET assume(var12 == var_for_abs) VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var4=4, var5=3, var6=7, var7=2, var8=5, var9=7, var_for_abs=2] [L173] var_for_abs = var4 - var5 [L174] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var5=3, var6=7, var7=2, var8=5, var9=7, var_for_abs=1] [L175] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L175] RET assume(var13 == var_for_abs) VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var5=3, var6=7, var7=2, var8=5, var9=7, var_for_abs=1] [L176] var_for_abs = var5 - var6 [L177] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var6=7, var7=2, var8=5, var9=7, var_for_abs=4] [L178] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L178] RET assume(var14 == var_for_abs) VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var6=7, var7=2, var8=5, var9=7, var_for_abs=4] [L179] var_for_abs = var6 - var7 [L180] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var7=2, var8=5, var9=7, var_for_abs=5] [L181] CALL assume(var15 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L181] RET assume(var15 == var_for_abs) VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var7=2, var8=5, var9=7, var_for_abs=5] [L182] var_for_abs = var7 - var8 [L183] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var9=7, var_for_abs=3] [L184] CALL assume(var16 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L184] RET assume(var16 == var_for_abs) VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var9=7, var_for_abs=3] [L185] reach_error() VAL [var10=8, var11=6, var12=2, var13=1, var14=4, var15=5, var16=3, var9=7, var_for_abs=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 142 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 1, TraceHistogramMax: 106, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 558 NumberOfCodeBlocks, 558 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-19 23:05:11,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE