./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-008.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-008.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 8f1a1519dc3ac954bb27ae35f40dd4ee3500f707e2df097fc14441b899353328 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:08:17,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:08:17,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:08:17,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:08:17,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:08:17,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:08:17,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:08:17,993 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:08:17,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:08:17,995 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:08:17,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:08:17,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:08:17,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:08:17,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:08:17,999 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:08:18,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:08:18,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:08:18,000 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:08:18,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:08:18,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:08:18,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:08:18,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:08:18,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:08:18,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:08:18,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:08:18,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:08:18,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:08:18,007 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:08:18,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:08:18,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:08:18,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:08:18,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:08:18,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:08:18,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:08:18,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:08:18,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:08:18,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:08:18,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:08:18,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:08:18,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:08:18,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:08:18,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:08:18,012 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 -> 8f1a1519dc3ac954bb27ae35f40dd4ee3500f707e2df097fc14441b899353328 [2024-10-14 04:08:18,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:08:18,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:08:18,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:08:18,304 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:08:18,305 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:08:18,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-008.c [2024-10-14 04:08:19,808 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:08:20,015 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:08:20,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-008.c [2024-10-14 04:08:20,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c487bbd5/fa735a8bee17446986137d23bc221bcc/FLAGab55a1682 [2024-10-14 04:08:20,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c487bbd5/fa735a8bee17446986137d23bc221bcc [2024-10-14 04:08:20,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:08:20,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:08:20,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:08:20,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:08:20,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:08:20,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:08:20" (1/1) ... [2024-10-14 04:08:20,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73cdc715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:20, skipping insertion in model container [2024-10-14 04:08:20,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:08:20" (1/1) ... [2024-10-14 04:08:20,086 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:08:20,270 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-008.c[4334,4347] [2024-10-14 04:08:20,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:08:20,291 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:08:20,329 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-008.c[4334,4347] [2024-10-14 04:08:20,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:08:20,351 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:08:20,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:20 WrapperNode [2024-10-14 04:08:20,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:08:20,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:08:20,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:08:20,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:08:20,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:20" (1/1) ... [2024-10-14 04:08:20,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:20" (1/1) ... [2024-10-14 04:08:20,402 INFO L138 Inliner]: procedures = 13, calls = 93, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 192 [2024-10-14 04:08:20,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:08:20,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:08:20,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:08:20,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:08:20,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:20" (1/1) ... [2024-10-14 04:08:20,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:20" (1/1) ... [2024-10-14 04:08:20,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:20" (1/1) ... [2024-10-14 04:08:20,429 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 04:08:20,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:20" (1/1) ... [2024-10-14 04:08:20,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:20" (1/1) ... [2024-10-14 04:08:20,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:20" (1/1) ... [2024-10-14 04:08:20,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:20" (1/1) ... [2024-10-14 04:08:20,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:20" (1/1) ... [2024-10-14 04:08:20,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:20" (1/1) ... [2024-10-14 04:08:20,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:08:20,442 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:08:20,443 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:08:20,443 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:08:20,444 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:20" (1/1) ... [2024-10-14 04:08:20,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:08:20,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:08:20,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 04:08:20,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 04:08:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:08:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:08:20,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:08:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:08:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2024-10-14 04:08:20,569 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2024-10-14 04:08:20,683 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:08:20,687 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:08:20,971 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-14 04:08:20,971 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:08:21,003 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:08:21,003 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 04:08:21,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:08:21 BoogieIcfgContainer [2024-10-14 04:08:21,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:08:21,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:08:21,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:08:21,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:08:21,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:08:20" (1/3) ... [2024-10-14 04:08:21,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45855645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:08:21, skipping insertion in model container [2024-10-14 04:08:21,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:20" (2/3) ... [2024-10-14 04:08:21,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45855645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:08:21, skipping insertion in model container [2024-10-14 04:08:21,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:08:21" (3/3) ... [2024-10-14 04:08:21,012 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-008.c [2024-10-14 04:08:21,026 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:08:21,027 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 04:08:21,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:08:21,093 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;@2106b09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:08:21,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 04:08:21,097 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) [2024-10-14 04:08:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2024-10-14 04:08:21,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:08:21,127 INFO L215 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] [2024-10-14 04:08:21,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:08:21,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:08:21,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1018465269, now seen corresponding path program 1 times [2024-10-14 04:08:21,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:08:21,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887189053] [2024-10-14 04:08:21,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:08:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:08:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 04:08:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 04:08:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 04:08:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:08:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 04:08:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 04:08:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:08:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 04:08:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 04:08:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 04:08:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 04:08:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 04:08:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 04:08:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 04:08:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 04:08:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 04:08:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 04:08:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 04:08:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 04:08:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 04:08:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 04:08:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 04:08:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 04:08:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 04:08:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 04:08:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 04:08:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 04:08:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 04:08:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 04:08:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 04:08:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 04:08:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-14 04:08:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-14 04:08:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-14 04:08:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-14 04:08:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 04:08:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 04:08:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-14 04:08:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 04:08:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 04:08:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-10-14 04:08:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-14 04:08:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-10-14 04:08:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-14 04:08:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-14 04:08:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-14 04:08:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-14 04:08:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-14 04:08:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-14 04:08:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-14 04:08:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-14 04:08:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-14 04:08:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-14 04:08:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-10-14 04:08:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-14 04:08:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-10-14 04:08:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2024-10-14 04:08:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2024-10-14 04:08:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2024-10-14 04:08:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-10-14 04:08:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2024-10-14 04:08:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2024-10-14 04:08:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-10-14 04:08:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2024-10-14 04:08:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2024-10-14 04:08:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2024-10-14 04:08:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2024-10-14 04:08:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2024-10-14 04:08:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-14 04:08:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2024-10-14 04:08:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2024-10-14 04:08:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2024-10-14 04:08:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-10-14 04:08:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-10-14 04:08:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2024-10-14 04:08:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2024-10-14 04:08:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 396 [2024-10-14 04:08:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 401 [2024-10-14 04:08:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2024-10-14 04:08:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2024-10-14 04:08:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 418 [2024-10-14 04:08:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2024-10-14 04:08:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 430 [2024-10-14 04:08:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2024-10-14 04:08:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2024-10-14 04:08:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 448 [2024-10-14 04:08:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2024-10-14 04:08:21,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:08:21,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887189053] [2024-10-14 04:08:21,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887189053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:08:21,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:08:21,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 04:08:21,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143805600] [2024-10-14 04:08:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:08:21,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 04:08:21,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:08:21,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 04:08:21,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 04:08:21,981 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) [2024-10-14 04:08:22,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:08:22,086 INFO L93 Difference]: Finished difference Result 229 states and 485 transitions. [2024-10-14 04:08:22,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 04:08:22,089 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 [2024-10-14 04:08:22,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:08:22,100 INFO L225 Difference]: With dead ends: 229 [2024-10-14 04:08:22,100 INFO L226 Difference]: Without dead ends: 115 [2024-10-14 04:08:22,110 INFO L431 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 [2024-10-14 04:08:22,113 INFO L432 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 [2024-10-14 04:08:22,117 INFO L433 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] [2024-10-14 04:08:22,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-14 04:08:22,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-14 04:08:22,189 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) [2024-10-14 04:08:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 199 transitions. [2024-10-14 04:08:22,195 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 199 transitions. Word has length 454 [2024-10-14 04:08:22,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:08:22,196 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 199 transitions. [2024-10-14 04:08:22,198 INFO L472 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) [2024-10-14 04:08:22,198 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 199 transitions. [2024-10-14 04:08:22,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2024-10-14 04:08:22,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:08:22,211 INFO L215 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] [2024-10-14 04:08:22,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:08:22,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:08:22,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:08:22,213 INFO L85 PathProgramCache]: Analyzing trace with hash -406206299, now seen corresponding path program 1 times [2024-10-14 04:08:22,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:08:22,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681062746] [2024-10-14 04:08:22,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:08:22,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:08:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 04:08:23,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 04:08:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 04:08:24,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 04:08:24,438 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 04:08:24,439 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 04:08:24,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:08:24,445 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-14 04:08:24,576 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 04:08:24,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 04:08:24 BoogieIcfgContainer [2024-10-14 04:08:24,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 04:08:24,583 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 04:08:24,584 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 04:08:24,584 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 04:08:24,584 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:08:21" (3/4) ... [2024-10-14 04:08:24,585 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 04:08:24,711 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 04:08:24,711 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 04:08:24,712 INFO L158 Benchmark]: Toolchain (without parser) took 4666.35ms. Allocated memory was 178.3MB in the beginning and 260.0MB in the end (delta: 81.8MB). Free memory was 110.5MB in the beginning and 138.5MB in the end (delta: -28.0MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2024-10-14 04:08:24,712 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 178.3MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 04:08:24,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.22ms. Allocated memory is still 178.3MB. Free memory was 110.3MB in the beginning and 96.9MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 04:08:24,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.98ms. Allocated memory is still 178.3MB. Free memory was 96.9MB in the beginning and 94.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 04:08:24,713 INFO L158 Benchmark]: Boogie Preprocessor took 38.30ms. Allocated memory is still 178.3MB. Free memory was 94.6MB in the beginning and 92.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 04:08:24,713 INFO L158 Benchmark]: RCFGBuilder took 561.68ms. Allocated memory is still 178.3MB. Free memory was 92.5MB in the beginning and 130.6MB in the end (delta: -38.1MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-10-14 04:08:24,713 INFO L158 Benchmark]: TraceAbstraction took 3576.75ms. Allocated memory was 178.3MB in the beginning and 260.0MB in the end (delta: 81.8MB). Free memory was 129.4MB in the beginning and 152.1MB in the end (delta: -22.8MB). Peak memory consumption was 137.8MB. Max. memory is 16.1GB. [2024-10-14 04:08:24,713 INFO L158 Benchmark]: Witness Printer took 128.04ms. Allocated memory is still 260.0MB. Free memory was 152.1MB in the beginning and 138.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 04:08:24,715 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.23ms. Allocated memory is still 178.3MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.22ms. Allocated memory is still 178.3MB. Free memory was 110.3MB in the beginning and 96.9MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.98ms. Allocated memory is still 178.3MB. Free memory was 96.9MB in the beginning and 94.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.30ms. Allocated memory is still 178.3MB. Free memory was 94.6MB in the beginning and 92.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 561.68ms. Allocated memory is still 178.3MB. Free memory was 92.5MB in the beginning and 130.6MB in the end (delta: -38.1MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3576.75ms. Allocated memory was 178.3MB in the beginning and 260.0MB in the end (delta: 81.8MB). Free memory was 129.4MB in the beginning and 152.1MB in the end (delta: -22.8MB). Peak memory consumption was 137.8MB. Max. memory is 16.1GB. * Witness Printer took 128.04ms. Allocated memory is still 260.0MB. Free memory was 152.1MB in the beginning and 138.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. 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: 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] [L29] RET assume(var0 >= 0) VAL [var0=3] [L30] CALL assume(var0 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L30] RET assume(var0 <= 7) VAL [var0=3] [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=3, var1=2] [L34] CALL assume(var1 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L34] RET assume(var1 <= 7) VAL [var0=3, var1=2] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L37] RET assume(var2 >= 0) VAL [var0=3, var1=2, var2=4] [L38] CALL assume(var2 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L38] RET assume(var2 <= 7) VAL [var0=3, var1=2, var2=4] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L41] RET assume(var3 >= 0) VAL [var0=3, var1=2, var2=4, var3=7] [L42] CALL assume(var3 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L42] RET assume(var3 <= 7) VAL [var0=3, var1=2, var2=4, var3=7] [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=3, var1=2, var2=4, var3=7, var4=0] [L46] CALL assume(var4 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L46] RET assume(var4 <= 7) VAL [var0=3, var1=2, var2=4, var3=7, var4=0] [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=3, var1=2, var2=4, var3=7, var4=0, var5=6] [L50] CALL assume(var5 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L50] RET assume(var5 <= 7) VAL [var0=3, var1=2, var2=4, var3=7, var4=0, var5=6] [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=3, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1] [L54] CALL assume(var6 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L54] RET assume(var6 <= 7) VAL [var0=3, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1] [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=3, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5] [L58] CALL assume(var7 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET assume(var7 <= 7) VAL [var0=3, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5] [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] [L61] RET assume(var8 >= 1) VAL [var0=3, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1] [L62] CALL assume(var8 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L62] RET assume(var8 <= 7) VAL [var0=3, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, 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] [L65] RET assume(var9 >= 1) VAL [var0=3, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L66] CALL assume(var9 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L66] RET assume(var9 <= 7) VAL [var0=3, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, 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] [L69] RET assume(var10 >= 1) VAL [var0=3, var10=3, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L70] CALL assume(var10 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L70] RET assume(var10 <= 7) VAL [var0=3, var10=3, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, 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] [L73] RET assume(var11 >= 1) VAL [var0=3, var10=3, var11=7, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L74] CALL assume(var11 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L74] RET assume(var11 <= 7) VAL [var0=3, var10=3, var11=7, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, 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] [L77] RET assume(var12 >= 1) VAL [var0=3, var10=3, var11=7, var12=6, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L78] CALL assume(var12 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L78] RET assume(var12 <= 7) VAL [var0=3, var10=3, var11=7, var12=6, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, 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] [L81] RET assume(var13 >= 1) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L82] CALL assume(var13 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L82] RET assume(var13 <= 7) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, 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] [L85] RET assume(var14 >= 1) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L86] CALL assume(var14 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L86] RET assume(var14 <= 7) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L87] int myvar0 = 1; VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L88] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L88] RET assume(var0 != var1) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L89] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L89] RET assume(var0 != var2) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L90] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L90] RET assume(var0 != var3) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L91] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L91] RET assume(var0 != var4) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L92] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L92] RET assume(var0 != var5) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L93] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L93] RET assume(var0 != var6) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L94] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L94] RET assume(var0 != var7) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L95] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L95] RET assume(var1 != var2) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L96] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L96] RET assume(var1 != var3) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L97] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L97] RET assume(var1 != var4) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L98] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L98] RET assume(var1 != var5) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L99] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L99] RET assume(var1 != var6) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L100] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L100] RET assume(var1 != var7) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L101] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L101] RET assume(var2 != var3) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L102] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L102] RET assume(var2 != var4) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L103] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L103] RET assume(var2 != var5) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L104] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L104] RET assume(var2 != var6) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L105] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L105] RET assume(var2 != var7) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L106] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L106] RET assume(var3 != var4) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L107] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L107] RET assume(var3 != var5) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L108] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L108] RET assume(var3 != var6) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L109] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L109] RET assume(var3 != var7) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L110] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L110] RET assume(var4 != var5) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L111] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L111] RET assume(var4 != var6) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L112] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L112] RET assume(var4 != var7) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L113] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L113] RET assume(var5 != var6) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L114] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L114] RET assume(var5 != var7) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L115] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L115] RET assume(var6 != var7) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L116] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L116] RET assume(var8 != var9) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L117] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L117] RET assume(var8 != var10) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L118] CALL assume(var8 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L118] RET assume(var8 != var11) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L119] CALL assume(var8 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L119] RET assume(var8 != var12) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L120] CALL assume(var8 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L120] RET assume(var8 != var13) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L121] CALL assume(var8 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L121] RET assume(var8 != var14) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L122] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L122] RET assume(var9 != var10) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L123] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L123] RET assume(var9 != var11) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L124] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L124] RET assume(var9 != var12) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L125] CALL assume(var9 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L125] RET assume(var9 != var13) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L126] CALL assume(var9 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L126] RET assume(var9 != var14) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L127] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L127] RET assume(var10 != var11) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L128] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L128] RET assume(var10 != var12) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L129] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L129] RET assume(var10 != var13) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L130] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L130] RET assume(var10 != var14) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L131] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L131] RET assume(var11 != var12) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L132] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L132] RET assume(var11 != var13) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L133] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L133] RET assume(var11 != var14) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L134] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L134] RET assume(var12 != var13) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L135] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L135] RET assume(var12 != var14) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2] [L136] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L136] RET assume(var13 != var14) VAL [var0=3, var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, 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 [var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, 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] [L140] RET assume(var8 == var_for_abs) VAL [var10=3, var11=7, var12=6, var13=5, var14=4, var1=2, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, 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 [var10=3, var11=7, var12=6, var13=5, var14=4, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, 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] [L143] RET assume(var9 == var_for_abs) VAL [var10=3, var11=7, var12=6, var13=5, var14=4, var2=4, var3=7, var4=0, var5=6, var6=1, var7=5, 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 [var10=3, var11=7, var12=6, var13=5, var14=4, var3=7, var4=0, var5=6, var6=1, var7=5, 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] [L146] RET assume(var10 == var_for_abs) VAL [var10=3, var11=7, var12=6, var13=5, var14=4, var3=7, var4=0, var5=6, var6=1, var7=5, 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 [var10=3, var11=7, var12=6, var13=5, var14=4, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2, var_for_abs=7] [L149] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L149] RET assume(var11 == var_for_abs) VAL [var10=3, var11=7, var12=6, var13=5, var14=4, var4=0, var5=6, var6=1, var7=5, var8=1, var9=2, var_for_abs=7] [L150] var_for_abs = var4 - var5 [L151] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=3, var11=7, var12=6, var13=5, var14=4, var5=6, var6=1, var7=5, var8=1, var9=2, var_for_abs=6] [L152] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L152] RET assume(var12 == var_for_abs) VAL [var10=3, var11=7, var12=6, var13=5, var14=4, var5=6, var6=1, var7=5, var8=1, var9=2, var_for_abs=6] [L153] var_for_abs = var5 - var6 [L154] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=3, var11=7, var12=6, var13=5, var14=4, var6=1, var7=5, var8=1, var9=2, var_for_abs=5] [L155] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L155] RET assume(var13 == var_for_abs) VAL [var10=3, var11=7, var12=6, var13=5, var14=4, var6=1, var7=5, var8=1, var9=2, var_for_abs=5] [L156] var_for_abs = var6 - var7 [L157] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=3, var11=7, var12=6, var13=5, var14=4, var8=1, var9=2, var_for_abs=4] [L158] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L158] RET assume(var14 == var_for_abs) VAL [var10=3, var11=7, var12=6, var13=5, var14=4, var8=1, var9=2, var_for_abs=4] [L159] reach_error() VAL [var10=3, var11=7, var12=6, var13=5, var14=4, var8=1, var9=2, var_for_abs=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 2, TraceHistogramMax: 86, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 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.3s SatisfiabilityAnalysisTime, 0.6s 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! [2024-10-14 04:08:24,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE