./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-008.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-008.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/bin/uautomizer-verify-qhAvR1uOyd --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.3.0-dev-826ab2b [2024-11-13 13:18:46,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:18:46,236 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:18:46,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:18:46,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:18:46,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:18:46,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:18:46,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:18:46,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:18:46,304 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:18:46,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:18:46,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:18:46,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:18:46,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:18:46,308 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:18:46,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:18:46,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:18:46,309 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:18:46,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:18:46,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:18:46,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:18:46,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:18:46,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:18:46,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:18:46,309 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:18:46,310 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:18:46,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:18:46,310 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:18:46,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:18:46,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:18:46,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:18:46,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:18:46,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:18:46,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:18:46,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:18:46,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:18:46,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:18:46,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:18:46,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:18:46,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:18:46,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:18:46,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:18:46,313 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/bin/uautomizer-verify-qhAvR1uOyd 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-11-13 13:18:46,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:18:46,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:18:46,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:18:46,847 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:18:46,848 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:18:46,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/xcsp/AllInterval-008.c Unable to find full path for "g++" [2024-11-13 13:18:49,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:18:50,000 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:18:50,006 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/sv-benchmarks/c/xcsp/AllInterval-008.c [2024-11-13 13:18:50,018 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/bin/uautomizer-verify-qhAvR1uOyd/data/2a504530e/34a67ac82f0e4bd799d3f5e8baf55d18/FLAGa2547d7d2 [2024-11-13 13:18:50,039 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/bin/uautomizer-verify-qhAvR1uOyd/data/2a504530e/34a67ac82f0e4bd799d3f5e8baf55d18 [2024-11-13 13:18:50,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:18:50,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:18:50,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:18:50,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:18:50,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:18:50,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:18:50" (1/1) ... [2024-11-13 13:18:50,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604fb9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:50, skipping insertion in model container [2024-11-13 13:18:50,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:18:50" (1/1) ... [2024-11-13 13:18:50,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:18:50,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/sv-benchmarks/c/xcsp/AllInterval-008.c[4334,4347] [2024-11-13 13:18:50,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:18:50,351 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:18:50,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/sv-benchmarks/c/xcsp/AllInterval-008.c[4334,4347] [2024-11-13 13:18:50,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:18:50,424 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:18:50,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:50 WrapperNode [2024-11-13 13:18:50,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:18:50,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:18:50,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:18:50,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:18:50,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:50" (1/1) ... [2024-11-13 13:18:50,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:50" (1/1) ... [2024-11-13 13:18:50,516 INFO L138 Inliner]: procedures = 13, calls = 93, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 192 [2024-11-13 13:18:50,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:18:50,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:18:50,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:18:50,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:18:50,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:50" (1/1) ... [2024-11-13 13:18:50,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:50" (1/1) ... [2024-11-13 13:18:50,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:50" (1/1) ... [2024-11-13 13:18:50,570 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-13 13:18:50,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:50" (1/1) ... [2024-11-13 13:18:50,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:50" (1/1) ... [2024-11-13 13:18:50,584 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:50" (1/1) ... [2024-11-13 13:18:50,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:50" (1/1) ... [2024-11-13 13:18:50,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:50" (1/1) ... [2024-11-13 13:18:50,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:50" (1/1) ... [2024-11-13 13:18:50,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:18:50,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:18:50,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:18:50,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:18:50,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:50" (1/1) ... [2024-11-13 13:18:50,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:18:50,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:18:50,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:18:50,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:18:50,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:18:50,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:18:50,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:18:50,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:18:50,741 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2024-11-13 13:18:50,741 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2024-11-13 13:18:50,878 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:18:50,880 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:18:51,534 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-13 13:18:51,535 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:18:51,556 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:18:51,556 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 13:18:51,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:18:51 BoogieIcfgContainer [2024-11-13 13:18:51,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:18:51,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:18:51,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:18:51,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:18:51,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:18:50" (1/3) ... [2024-11-13 13:18:51,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22364ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:18:51, skipping insertion in model container [2024-11-13 13:18:51,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:50" (2/3) ... [2024-11-13 13:18:51,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22364ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:18:51, skipping insertion in model container [2024-11-13 13:18:51,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:18:51" (3/3) ... [2024-11-13 13:18:51,573 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-008.c [2024-11-13 13:18:51,597 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:18:51,601 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG AllInterval-008.c that has 2 procedures, 119 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-13 13:18:51,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:18:51,743 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;@72a5c373, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:18:51,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:18:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 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-11-13 13:18:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-13 13:18:51,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:18:51,805 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, 1] [2024-11-13 13:18:51,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:18:51,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:51,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1564691013, now seen corresponding path program 1 times [2024-11-13 13:18:51,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:18:51,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552640661] [2024-11-13 13:18:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:51,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:18:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:18:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:18:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:18:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 13:18:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 13:18:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:18:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:18:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:18:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 13:18:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 13:18:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 13:18:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:18:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:18:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 13:18:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-13 13:18:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:18:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 13:18:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 13:18:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:18:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 13:18:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-13 13:18:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-13 13:18:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-13 13:18:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:18:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:18:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-13 13:18:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-13 13:18:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-13 13:18:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-13 13:18:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-13 13:18:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-13 13:18:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 13:18:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-13 13:18:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-13 13:18:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-13 13:18:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-13 13:18:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-13 13:18:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-13 13:18:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-13 13:18:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-13 13:18:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-13 13:18:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-13 13:18:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:52,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-13 13:18:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-13 13:18:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-13 13:18:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-13 13:18:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-13 13:18:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-13 13:18:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-13 13:18:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-13 13:18:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-13 13:18:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-13 13:18:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-13 13:18:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-13 13:18:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-13 13:18:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-13 13:18:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-11-13 13:18:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-11-13 13:18:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-11-13 13:18:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-11-13 13:18:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-11-13 13:18:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2024-11-13 13:18:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2024-11-13 13:18:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2024-11-13 13:18:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2024-11-13 13:18:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2024-11-13 13:18:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-11-13 13:18:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-11-13 13:18:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-13 13:18:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-13 13:18:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-13 13:18:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2024-11-13 13:18:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2024-11-13 13:18:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2024-11-13 13:18:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2024-11-13 13:18:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2024-11-13 13:18:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2024-11-13 13:18:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2024-11-13 13:18:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2024-11-13 13:18:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-13 13:18:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-11-13 13:18:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 425 [2024-11-13 13:18:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2024-11-13 13:18:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 437 [2024-11-13 13:18:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2024-11-13 13:18:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2024-11-13 13:18:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:53,374 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2024-11-13 13:18:53,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:18:53,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552640661] [2024-11-13 13:18:53,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552640661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:18:53,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:18:53,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:18:53,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268391440] [2024-11-13 13:18:53,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:18:53,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:18:53,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:18:53,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:18:53,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:18:53,423 INFO L87 Difference]: Start difference. First operand has 119 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-11-13 13:18:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:18:53,490 INFO L93 Difference]: Finished difference Result 232 states and 488 transitions. [2024-11-13 13:18:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:18:53,493 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (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 455 [2024-11-13 13:18:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:18:53,505 INFO L225 Difference]: With dead ends: 232 [2024-11-13 13:18:53,505 INFO L226 Difference]: Without dead ends: 116 [2024-11-13 13:18:53,512 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-11-13 13:18:53,516 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:18:53,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:18:53,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-13 13:18:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-13 13:18:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 28 states have (on average 1.0) internal successors, (28), 28 states have internal predecessors, (28), 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-11-13 13:18:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 200 transitions. [2024-11-13 13:18:53,644 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 200 transitions. Word has length 455 [2024-11-13 13:18:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:18:53,645 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 200 transitions. [2024-11-13 13:18:53,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (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-11-13 13:18:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 200 transitions. [2024-11-13 13:18:53,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-13 13:18:53,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:18:53,671 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, 1] [2024-11-13 13:18:53,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:18:53,672 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:18:53,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:53,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1305604715, now seen corresponding path program 1 times [2024-11-13 13:18:53,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:18:53,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534572843] [2024-11-13 13:18:53,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:53,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:18:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:18:56,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:19:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:19:00,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:19:00,125 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:19:00,126 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:19:00,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:19:00,132 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-13 13:19:00,320 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:19:00,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:19:00 BoogieIcfgContainer [2024-11-13 13:19:00,325 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:19:00,326 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:19:00,326 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:19:00,326 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:19:00,327 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:18:51" (3/4) ... [2024-11-13 13:19:00,328 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 13:19:00,485 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 13:19:00,486 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:19:00,488 INFO L158 Benchmark]: Toolchain (without parser) took 10439.56ms. Allocated memory was 109.1MB in the beginning and 310.4MB in the end (delta: 201.3MB). Free memory was 83.6MB in the beginning and 209.2MB in the end (delta: -125.6MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2024-11-13 13:19:00,489 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 83.9MB. Free memory is still 41.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:19:00,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.37ms. Allocated memory is still 109.1MB. Free memory was 83.6MB in the beginning and 70.7MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:19:00,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.76ms. Allocated memory is still 109.1MB. Free memory was 70.7MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:19:00,492 INFO L158 Benchmark]: Boogie Preprocessor took 94.48ms. Allocated memory is still 109.1MB. Free memory was 68.7MB in the beginning and 67.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:19:00,493 INFO L158 Benchmark]: RCFGBuilder took 944.75ms. Allocated memory is still 109.1MB. Free memory was 67.0MB in the beginning and 48.2MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:19:00,493 INFO L158 Benchmark]: TraceAbstraction took 8764.71ms. Allocated memory was 109.1MB in the beginning and 310.4MB in the end (delta: 201.3MB). Free memory was 47.5MB in the beginning and 219.3MB in the end (delta: -171.8MB). Peak memory consumption was 154.9MB. Max. memory is 16.1GB. [2024-11-13 13:19:00,493 INFO L158 Benchmark]: Witness Printer took 160.77ms. Allocated memory is still 310.4MB. Free memory was 219.3MB in the beginning and 209.2MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:19:00,497 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.49ms. Allocated memory is still 83.9MB. Free memory is still 41.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.37ms. Allocated memory is still 109.1MB. Free memory was 83.6MB in the beginning and 70.7MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.76ms. Allocated memory is still 109.1MB. Free memory was 70.7MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.48ms. Allocated memory is still 109.1MB. Free memory was 68.7MB in the beginning and 67.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 944.75ms. Allocated memory is still 109.1MB. Free memory was 67.0MB in the beginning and 48.2MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8764.71ms. Allocated memory was 109.1MB in the beginning and 310.4MB in the end (delta: 201.3MB). Free memory was 47.5MB in the beginning and 219.3MB in the end (delta: -171.8MB). Peak memory consumption was 154.9MB. Max. memory is 16.1GB. * Witness Printer took 160.77ms. Allocated memory is still 310.4MB. Free memory was 219.3MB in the beginning and 209.2MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. 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=2] [L30] CALL assume(var0 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L30] RET assume(var0 <= 7) VAL [var0=2] [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=2, var1=6] [L34] CALL assume(var1 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L34] RET assume(var1 <= 7) VAL [var0=2, var1=6] [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=2, var1=6, var2=1] [L38] CALL assume(var2 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L38] RET assume(var2 <= 7) VAL [var0=2, var1=6, var2=1] [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=2, var1=6, var2=1, 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=2, var1=6, var2=1, 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=2, var1=6, var2=1, 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=2, var1=6, var2=1, 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=2, var1=6, var2=1, var3=7, var4=0, var5=3] [L50] CALL assume(var5 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L50] RET assume(var5 <= 7) VAL [var0=2, var1=6, var2=1, var3=7, var4=0, 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=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5] [L54] CALL assume(var6 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L54] RET assume(var6 <= 7) VAL [var0=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5] [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=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4] [L58] CALL assume(var7 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET assume(var7 <= 7) VAL [var0=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L61] RET assume(var8 >= 1) VAL [var0=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4] [L62] CALL assume(var8 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L62] RET assume(var8 <= 7) VAL [var0=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4] [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=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L66] CALL assume(var9 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L66] RET assume(var9 <= 7) VAL [var0=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L69] RET assume(var10 >= 1) VAL [var0=2, var10=6, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L70] CALL assume(var10 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L70] RET assume(var10 <= 7) VAL [var0=2, var10=6, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L73] RET assume(var11 >= 1) VAL [var0=2, var10=6, var11=7, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L74] CALL assume(var11 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L74] RET assume(var11 <= 7) VAL [var0=2, var10=6, var11=7, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L77] RET assume(var12 >= 1) VAL [var0=2, var10=6, var11=7, var12=3, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L78] CALL assume(var12 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L78] RET assume(var12 <= 7) VAL [var0=2, var10=6, var11=7, var12=3, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [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=2, var10=6, var11=7, var12=3, var13=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L82] CALL assume(var13 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L82] RET assume(var13 <= 7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [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=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L86] CALL assume(var14 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L86] RET assume(var14 <= 7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L87] int myvar0 = 1; VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L88] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L88] RET assume(var0 != var1) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L89] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L89] RET assume(var0 != var2) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L90] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L90] RET assume(var0 != var3) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L91] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L91] RET assume(var0 != var4) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L92] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L92] RET assume(var0 != var5) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L93] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L93] RET assume(var0 != var6) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L94] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L94] RET assume(var0 != var7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L95] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L95] RET assume(var1 != var2) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L96] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L96] RET assume(var1 != var3) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L97] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L97] RET assume(var1 != var4) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L98] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L98] RET assume(var1 != var5) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L99] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L99] RET assume(var1 != var6) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L100] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L100] RET assume(var1 != var7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L101] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L101] RET assume(var2 != var3) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L102] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L102] RET assume(var2 != var4) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L103] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L103] RET assume(var2 != var5) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L104] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L104] RET assume(var2 != var6) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L105] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L105] RET assume(var2 != var7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L106] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L106] RET assume(var3 != var4) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L107] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L107] RET assume(var3 != var5) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L108] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L108] RET assume(var3 != var6) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L109] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L109] RET assume(var3 != var7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L110] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L110] RET assume(var4 != var5) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L111] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L111] RET assume(var4 != var6) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L112] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L112] RET assume(var4 != var7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L113] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L113] RET assume(var5 != var6) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L114] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L114] RET assume(var5 != var7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L115] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L115] RET assume(var6 != var7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L116] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L116] RET assume(var8 != var9) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L117] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L117] RET assume(var8 != var10) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L118] CALL assume(var8 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L118] RET assume(var8 != var11) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L119] CALL assume(var8 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L119] RET assume(var8 != var12) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L120] CALL assume(var8 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L120] RET assume(var8 != var13) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L121] CALL assume(var8 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L121] RET assume(var8 != var14) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L122] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L122] RET assume(var9 != var10) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L123] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L123] RET assume(var9 != var11) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L124] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L124] RET assume(var9 != var12) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L125] CALL assume(var9 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L125] RET assume(var9 != var13) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L126] CALL assume(var9 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L126] RET assume(var9 != var14) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L127] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L127] RET assume(var10 != var11) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L128] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L128] RET assume(var10 != var12) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L129] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L129] RET assume(var10 != var13) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L130] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L130] RET assume(var10 != var14) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L131] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L131] RET assume(var11 != var12) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L132] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L132] RET assume(var11 != var13) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L133] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L133] RET assume(var11 != var14) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L134] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L134] RET assume(var12 != var13) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L135] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L135] RET assume(var12 != var14) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L136] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L136] RET assume(var13 != var14) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [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=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=4] [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=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=4] [L141] var_for_abs = var1 - var2 [L142] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=5] [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=6, var11=7, var12=3, var13=2, var14=1, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=5] [L144] var_for_abs = var2 - var3 [L145] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=6] [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=6, var11=7, var12=3, var13=2, var14=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=6] [L147] var_for_abs = var3 - var4 [L148] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5, 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=6, var11=7, var12=3, var13=2, var14=1, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5, 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=6, var11=7, var12=3, var13=2, var14=1, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=3] [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=6, var11=7, var12=3, var13=2, var14=1, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=3] [L153] var_for_abs = var5 - var6 [L154] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var6=5, var7=4, var8=4, var9=5, var_for_abs=2] [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=6, var11=7, var12=3, var13=2, var14=1, var6=5, var7=4, var8=4, var9=5, var_for_abs=2] [L156] var_for_abs = var6 - var7 [L157] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var8=4, var9=5, var_for_abs=1] [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=6, var11=7, var12=3, var13=2, var14=1, var8=4, var9=5, var_for_abs=1] [L159] reach_error() VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var8=4, var9=5, var_for_abs=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 2, TraceHistogramMax: 86, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 200 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 200 mSDtfsCounter, 0 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=119occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 910 NumberOfCodeBlocks, 910 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 454 ConstructedInterpolants, 0 QuantifiedInterpolants, 454 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-11-13 13:19:00,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d97424-4163-4e41-b0f6-cc671261db5b/bin/uautomizer-verify-qhAvR1uOyd/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