./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.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_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/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_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/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_07d7beed-1174-4b25-9c21-75c46745075d/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 2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:19:30,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:19:30,851 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:19:30,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:19:30,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:19:30,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:19:30,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:19:30,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:19:30,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:19:30,893 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:19:30,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:19:30,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:19:30,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:19:30,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:19:30,894 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:19:30,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:19:30,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:19:30,896 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:19:30,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:19:30,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:19:30,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:19:30,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:19:30,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:19:30,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:19:30,899 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:19:30,899 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:19:30,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:19:30,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:19:30,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:19:30,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:19:30,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:19:30,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:19:30,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:19:30,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:19:30,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:19:30,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:19:30,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:19:30,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:19:30,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:19:30,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:19:30,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:19:30,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:19:30,901 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_07d7beed-1174-4b25-9c21-75c46745075d/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 -> 2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2 [2024-11-13 14:19:31,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:19:31,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:19:31,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:19:31,468 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:19:31,469 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:19:31,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c Unable to find full path for "g++" [2024-11-13 14:19:34,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:19:34,765 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:19:34,766 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2024-11-13 14:19:34,776 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/data/1f29e696a/c3e852238d54475e9e8005cd3578ab26/FLAGead150169 [2024-11-13 14:19:34,797 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/data/1f29e696a/c3e852238d54475e9e8005cd3578ab26 [2024-11-13 14:19:34,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:19:34,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:19:34,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:19:34,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:19:34,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:19:34,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:19:34" (1/1) ... [2024-11-13 14:19:34,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20ee585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:34, skipping insertion in model container [2024-11-13 14:19:34,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:19:34" (1/1) ... [2024-11-13 14:19:34,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:19:35,085 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_07d7beed-1174-4b25-9c21-75c46745075d/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c[489,502] [2024-11-13 14:19:35,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:19:35,139 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:19:35,155 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_07d7beed-1174-4b25-9c21-75c46745075d/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c[489,502] [2024-11-13 14:19:35,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:19:35,201 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:19:35,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:35 WrapperNode [2024-11-13 14:19:35,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:19:35,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:19:35,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:19:35,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:19:35,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:35" (1/1) ... [2024-11-13 14:19:35,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:35" (1/1) ... [2024-11-13 14:19:35,248 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2024-11-13 14:19:35,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:19:35,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:19:35,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:19:35,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:19:35,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:35" (1/1) ... [2024-11-13 14:19:35,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:35" (1/1) ... [2024-11-13 14:19:35,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:35" (1/1) ... [2024-11-13 14:19:35,279 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 14:19:35,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:35" (1/1) ... [2024-11-13 14:19:35,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:35" (1/1) ... [2024-11-13 14:19:35,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:35" (1/1) ... [2024-11-13 14:19:35,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:35" (1/1) ... [2024-11-13 14:19:35,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:35" (1/1) ... [2024-11-13 14:19:35,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:35" (1/1) ... [2024-11-13 14:19:35,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:19:35,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:19:35,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:19:35,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:19:35,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:35" (1/1) ... [2024-11-13 14:19:35,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:19:35,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:19:35,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:19:35,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:19:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:19:35,394 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:19:35,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:19:35,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:19:35,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:19:35,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:19:35,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 14:19:35,396 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 14:19:35,503 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:19:35,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:19:35,709 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-13 14:19:35,709 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:19:35,722 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:19:35,723 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:19:35,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:19:35 BoogieIcfgContainer [2024-11-13 14:19:35,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:19:35,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:19:35,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:19:35,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:19:35,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:19:34" (1/3) ... [2024-11-13 14:19:35,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6cc044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:19:35, skipping insertion in model container [2024-11-13 14:19:35,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:35" (2/3) ... [2024-11-13 14:19:35,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6cc044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:19:35, skipping insertion in model container [2024-11-13 14:19:35,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:19:35" (3/3) ... [2024-11-13 14:19:35,742 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound50.c [2024-11-13 14:19:35,768 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:19:35,774 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG egcd-ll_unwindbound50.c that has 3 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:19:35,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:19:35,895 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;@5a501a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:19:35,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:19:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 14:19:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 14:19:35,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:35,917 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:35,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:35,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:35,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2008432909, now seen corresponding path program 1 times [2024-11-13 14:19:35,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:35,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461904586] [2024-11-13 14:19:35,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:35,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:36,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:19:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:36,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:19:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:36,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 14:19:36,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:36,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461904586] [2024-11-13 14:19:36,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461904586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:36,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:36,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:19:36,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189880487] [2024-11-13 14:19:36,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:36,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:19:36,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:36,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:19:36,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:19:36,270 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:19:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:36,297 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2024-11-13 14:19:36,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:19:36,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-11-13 14:19:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:36,309 INFO L225 Difference]: With dead ends: 57 [2024-11-13 14:19:36,309 INFO L226 Difference]: Without dead ends: 26 [2024-11-13 14:19:36,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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 14:19:36,317 INFO L432 NwaCegarLoop]: 39 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, 39 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 14:19:36,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:19:36,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-13 14:19:36,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-13 14:19:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 14:19:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-11-13 14:19:36,377 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2024-11-13 14:19:36,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:36,379 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-11-13 14:19:36,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 14:19:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2024-11-13 14:19:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 14:19:36,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:36,383 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:36,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:19:36,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:36,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:36,386 INFO L85 PathProgramCache]: Analyzing trace with hash -194242802, now seen corresponding path program 1 times [2024-11-13 14:19:36,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:36,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868738086] [2024-11-13 14:19:36,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:36,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:36,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:19:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:36,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:19:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 14:19:36,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:36,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868738086] [2024-11-13 14:19:36,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868738086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:36,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:36,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:19:36,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978622062] [2024-11-13 14:19:36,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:36,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:19:36,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:36,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:19:36,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:19:36,624 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 14:19:36,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:36,661 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2024-11-13 14:19:36,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:19:36,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-13 14:19:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:36,664 INFO L225 Difference]: With dead ends: 38 [2024-11-13 14:19:36,664 INFO L226 Difference]: Without dead ends: 28 [2024-11-13 14:19:36,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:19:36,666 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:36,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:19:36,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-13 14:19:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-13 14:19:36,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 14:19:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2024-11-13 14:19:36,677 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2024-11-13 14:19:36,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:36,678 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2024-11-13 14:19:36,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 14:19:36,679 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2024-11-13 14:19:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 14:19:36,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:36,680 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:36,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:19:36,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:36,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:36,681 INFO L85 PathProgramCache]: Analyzing trace with hash -192574506, now seen corresponding path program 1 times [2024-11-13 14:19:36,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:36,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357347719] [2024-11-13 14:19:36,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:36,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:19:36,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [455377483] [2024-11-13 14:19:36,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:36,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:36,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:19:36,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:19:36,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:19:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:36,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 14:19:36,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:19:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 14:19:37,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:19:37,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:37,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357347719] [2024-11-13 14:19:37,036 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:19:37,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455377483] [2024-11-13 14:19:37,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455377483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:37,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:37,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:19:37,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484407748] [2024-11-13 14:19:37,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:37,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:19:37,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:37,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:19:37,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:19:37,039 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 14:19:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:37,152 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2024-11-13 14:19:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:19:37,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-13 14:19:37,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:37,154 INFO L225 Difference]: With dead ends: 45 [2024-11-13 14:19:37,154 INFO L226 Difference]: Without dead ends: 43 [2024-11-13 14:19:37,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:19:37,156 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:37,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 118 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:19:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-13 14:19:37,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-11-13 14:19:37,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:19:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-11-13 14:19:37,175 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2024-11-13 14:19:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:37,175 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-11-13 14:19:37,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 14:19:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-11-13 14:19:37,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 14:19:37,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:37,177 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:37,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:19:37,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-13 14:19:37,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:37,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:37,378 INFO L85 PathProgramCache]: Analyzing trace with hash -904793029, now seen corresponding path program 1 times [2024-11-13 14:19:37,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:37,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948765498] [2024-11-13 14:19:37,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:37,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:19:37,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [823603129] [2024-11-13 14:19:37,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:37,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:37,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:19:37,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:19:37,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:19:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 14:19:37,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:19:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 14:19:37,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:19:37,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:37,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948765498] [2024-11-13 14:19:37,753 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:19:37,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823603129] [2024-11-13 14:19:37,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823603129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:37,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:37,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:19:37,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402709811] [2024-11-13 14:19:37,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:37,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:19:37,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:37,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:19:37,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:19:37,755 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 14:19:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:37,904 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2024-11-13 14:19:37,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:19:37,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-11-13 14:19:37,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:37,907 INFO L225 Difference]: With dead ends: 49 [2024-11-13 14:19:37,907 INFO L226 Difference]: Without dead ends: 47 [2024-11-13 14:19:37,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:19:37,912 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:37,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 132 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:19:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-13 14:19:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-13 14:19:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 14:19:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2024-11-13 14:19:37,930 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2024-11-13 14:19:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:37,930 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2024-11-13 14:19:37,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 14:19:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2024-11-13 14:19:37,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 14:19:37,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:37,935 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:37,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:19:38,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:38,136 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:38,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:38,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1333978442, now seen corresponding path program 1 times [2024-11-13 14:19:38,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:38,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114348837] [2024-11-13 14:19:38,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:38,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:19:38,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1222555984] [2024-11-13 14:19:38,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:38,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:38,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:19:38,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:19:38,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:19:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:38,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 14:19:38,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:19:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 14:19:38,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:19:38,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:38,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114348837] [2024-11-13 14:19:38,446 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:19:38,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222555984] [2024-11-13 14:19:38,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222555984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:38,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:38,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:19:38,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415662127] [2024-11-13 14:19:38,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:38,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:19:38,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:38,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:19:38,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:19:38,450 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 14:19:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:38,574 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2024-11-13 14:19:38,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:19:38,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-11-13 14:19:38,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:38,579 INFO L225 Difference]: With dead ends: 71 [2024-11-13 14:19:38,579 INFO L226 Difference]: Without dead ends: 67 [2024-11-13 14:19:38,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:19:38,581 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:38,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 111 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:19:38,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-13 14:19:38,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-13 14:19:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 39 states have internal predecessors, (47), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 14:19:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2024-11-13 14:19:38,608 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 29 [2024-11-13 14:19:38,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:38,608 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2024-11-13 14:19:38,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 14:19:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2024-11-13 14:19:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 14:19:38,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:38,610 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:38,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 14:19:38,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:38,811 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:38,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:38,812 INFO L85 PathProgramCache]: Analyzing trace with hash 563624787, now seen corresponding path program 1 times [2024-11-13 14:19:38,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:38,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786481165] [2024-11-13 14:19:38,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:38,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:39,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:19:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:39,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:19:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:39,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 14:19:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:39,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:19:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:39,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 14:19:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:19:39,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:39,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786481165] [2024-11-13 14:19:39,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786481165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:39,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:39,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:19:39,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029411354] [2024-11-13 14:19:39,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:39,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:19:39,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:39,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:19:39,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:19:39,365 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-13 14:19:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:39,470 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2024-11-13 14:19:39,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:19:39,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2024-11-13 14:19:39,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:39,474 INFO L225 Difference]: With dead ends: 83 [2024-11-13 14:19:39,474 INFO L226 Difference]: Without dead ends: 81 [2024-11-13 14:19:39,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:19:39,479 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:39,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 135 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:19:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-13 14:19:39,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2024-11-13 14:19:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 45 states have internal predecessors, (50), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-13 14:19:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2024-11-13 14:19:39,518 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 35 [2024-11-13 14:19:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:39,518 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2024-11-13 14:19:39,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-13 14:19:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2024-11-13 14:19:39,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 14:19:39,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:39,522 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:39,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:19:39,522 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:39,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash -437963263, now seen corresponding path program 1 times [2024-11-13 14:19:39,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:39,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944656708] [2024-11-13 14:19:39,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:39,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:39,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:19:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:39,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:19:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:39,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 14:19:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:39,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:19:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:39,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 14:19:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:39,825 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:19:39,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:39,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944656708] [2024-11-13 14:19:39,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944656708] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:19:39,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245964172] [2024-11-13 14:19:39,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:39,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:39,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:19:39,832 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:19:39,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:19:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:39,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:19:39,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:19:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:19:40,073 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:19:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:19:40,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245964172] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:19:40,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:19:40,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-13 14:19:40,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282324034] [2024-11-13 14:19:40,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:19:40,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:19:40,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:40,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:19:40,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:19:40,256 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-13 14:19:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:40,623 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2024-11-13 14:19:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:19:40,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 38 [2024-11-13 14:19:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:40,629 INFO L225 Difference]: With dead ends: 218 [2024-11-13 14:19:40,630 INFO L226 Difference]: Without dead ends: 196 [2024-11-13 14:19:40,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:19:40,632 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 47 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:40,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 156 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:19:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-13 14:19:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2024-11-13 14:19:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 119 states have internal predecessors, (132), 61 states have call successors, (61), 21 states have call predecessors, (61), 20 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 14:19:40,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2024-11-13 14:19:40,747 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 38 [2024-11-13 14:19:40,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:40,749 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2024-11-13 14:19:40,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-13 14:19:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2024-11-13 14:19:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 14:19:40,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:40,755 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:40,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:19:40,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-13 14:19:40,956 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:40,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash -436294967, now seen corresponding path program 1 times [2024-11-13 14:19:40,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:40,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338295170] [2024-11-13 14:19:40,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:40,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:19:41,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1435543578] [2024-11-13 14:19:41,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:41,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:41,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:19:41,011 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:19:41,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:19:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:41,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 14:19:41,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:19:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 14:19:41,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:19:41,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:41,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338295170] [2024-11-13 14:19:41,334 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:19:41,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435543578] [2024-11-13 14:19:41,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435543578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:41,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:41,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:19:41,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956960698] [2024-11-13 14:19:41,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:41,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:19:41,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:41,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:19:41,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:19:41,337 INFO L87 Difference]: Start difference. First operand 190 states and 247 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:19:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:41,478 INFO L93 Difference]: Finished difference Result 204 states and 260 transitions. [2024-11-13 14:19:41,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:19:41,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2024-11-13 14:19:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:41,485 INFO L225 Difference]: With dead ends: 204 [2024-11-13 14:19:41,485 INFO L226 Difference]: Without dead ends: 199 [2024-11-13 14:19:41,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:19:41,487 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:41,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 112 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:19:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-13 14:19:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-13 14:19:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 117 states have (on average 1.205128205128205) internal successors, (141), 128 states have internal predecessors, (141), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-13 14:19:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2024-11-13 14:19:41,572 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2024-11-13 14:19:41,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:41,575 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2024-11-13 14:19:41,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-13 14:19:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2024-11-13 14:19:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 14:19:41,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:41,580 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:41,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:19:41,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:41,784 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:41,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:41,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1845080606, now seen corresponding path program 1 times [2024-11-13 14:19:41,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:41,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136053257] [2024-11-13 14:19:41,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:41,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:42,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:19:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:42,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:19:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:42,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 14:19:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:42,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:19:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:42,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 14:19:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:42,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-13 14:19:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 14:19:42,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:42,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136053257] [2024-11-13 14:19:42,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136053257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:19:42,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057922298] [2024-11-13 14:19:42,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:42,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:42,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:19:42,188 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:19:42,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:19:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:42,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 14:19:42,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:19:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 14:19:42,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:19:42,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057922298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:42,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:19:42,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-13 14:19:42,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910703616] [2024-11-13 14:19:42,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:42,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:19:42,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:42,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:19:42,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:19:42,512 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-13 14:19:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:42,745 INFO L93 Difference]: Finished difference Result 230 states and 279 transitions. [2024-11-13 14:19:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:19:42,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-11-13 14:19:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:42,754 INFO L225 Difference]: With dead ends: 230 [2024-11-13 14:19:42,754 INFO L226 Difference]: Without dead ends: 220 [2024-11-13 14:19:42,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:19:42,756 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:42,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 136 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:19:42,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-13 14:19:42,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2024-11-13 14:19:42,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 130 states have (on average 1.176923076923077) internal successors, (153), 141 states have internal predecessors, (153), 57 states have call successors, (57), 28 states have call predecessors, (57), 28 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-13 14:19:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 261 transitions. [2024-11-13 14:19:42,823 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 261 transitions. Word has length 40 [2024-11-13 14:19:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:42,823 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 261 transitions. [2024-11-13 14:19:42,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-13 14:19:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 261 transitions. [2024-11-13 14:19:42,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 14:19:42,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:42,827 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:42,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 14:19:43,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:43,032 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:43,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:43,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1404750552, now seen corresponding path program 2 times [2024-11-13 14:19:43,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:43,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22287064] [2024-11-13 14:19:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:43,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:19:43,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2110133490] [2024-11-13 14:19:43,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:19:43,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:43,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:19:43,082 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:19:43,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:19:43,164 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:19:43,164 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:19:43,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 14:19:43,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:19:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:19:43,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:19:45,315 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 14:19:45,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:45,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22287064] [2024-11-13 14:19:45,316 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:19:45,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110133490] [2024-11-13 14:19:45,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110133490] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:19:45,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:19:45,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2024-11-13 14:19:45,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183927026] [2024-11-13 14:19:45,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:19:45,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 14:19:45,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:45,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 14:19:45,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:19:45,321 INFO L87 Difference]: Start difference. First operand 216 states and 261 transitions. Second operand has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-13 14:19:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:47,218 INFO L93 Difference]: Finished difference Result 266 states and 335 transitions. [2024-11-13 14:19:47,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 14:19:47,219 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 43 [2024-11-13 14:19:47,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:47,222 INFO L225 Difference]: With dead ends: 266 [2024-11-13 14:19:47,223 INFO L226 Difference]: Without dead ends: 264 [2024-11-13 14:19:47,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:19:47,225 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 45 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:47,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 258 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 14:19:47,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-13 14:19:47,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 228. [2024-11-13 14:19:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 139 states have (on average 1.1654676258992807) internal successors, (162), 150 states have internal predecessors, (162), 57 states have call successors, (57), 31 states have call predecessors, (57), 31 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-13 14:19:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 270 transitions. [2024-11-13 14:19:47,311 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 270 transitions. Word has length 43 [2024-11-13 14:19:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:47,312 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 270 transitions. [2024-11-13 14:19:47,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-13 14:19:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 270 transitions. [2024-11-13 14:19:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 14:19:47,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:47,314 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:47,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 14:19:47,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 14:19:47,518 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:47,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:47,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1575869973, now seen corresponding path program 1 times [2024-11-13 14:19:47,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:47,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255967796] [2024-11-13 14:19:47,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:47,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:19:47,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [371978783] [2024-11-13 14:19:47,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:47,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:47,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:19:47,555 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:19:47,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 14:19:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 14:19:47,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:19:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 14:19:48,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:19:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 14:19:48,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:48,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255967796] [2024-11-13 14:19:48,880 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:19:48,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371978783] [2024-11-13 14:19:48,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371978783] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:19:48,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:19:48,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-11-13 14:19:48,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199756057] [2024-11-13 14:19:48,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:19:48,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 14:19:48,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:48,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 14:19:48,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:19:48,883 INFO L87 Difference]: Start difference. First operand 228 states and 270 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-13 14:19:51,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:51,447 INFO L93 Difference]: Finished difference Result 277 states and 342 transitions. [2024-11-13 14:19:51,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 14:19:51,448 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 48 [2024-11-13 14:19:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:51,450 INFO L225 Difference]: With dead ends: 277 [2024-11-13 14:19:51,451 INFO L226 Difference]: Without dead ends: 235 [2024-11-13 14:19:51,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:19:51,454 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 26 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:51,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 290 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 14:19:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-13 14:19:51,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 200. [2024-11-13 14:19:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 129 states have (on average 1.1472868217054264) internal successors, (148), 135 states have internal predecessors, (148), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 14:19:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 229 transitions. [2024-11-13 14:19:51,519 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 229 transitions. Word has length 48 [2024-11-13 14:19:51,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:51,520 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 229 transitions. [2024-11-13 14:19:51,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-13 14:19:51,521 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 229 transitions. [2024-11-13 14:19:51,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 14:19:51,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:51,525 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:51,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 14:19:51,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-13 14:19:51,728 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:51,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:51,729 INFO L85 PathProgramCache]: Analyzing trace with hash -412106888, now seen corresponding path program 1 times [2024-11-13 14:19:51,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:51,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324527557] [2024-11-13 14:19:51,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:51,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:19:51,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1343717366] [2024-11-13 14:19:51,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:51,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:51,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:19:51,774 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:19:51,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 14:19:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:51,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 14:19:51,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:19:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-13 14:19:52,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:19:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-13 14:19:52,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:52,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324527557] [2024-11-13 14:19:52,578 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:19:52,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343717366] [2024-11-13 14:19:52,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343717366] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:19:52,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:19:52,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-13 14:19:52,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436461537] [2024-11-13 14:19:52,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:19:52,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 14:19:52,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:52,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 14:19:52,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:19:52,581 INFO L87 Difference]: Start difference. First operand 200 states and 229 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 14 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-13 14:19:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:53,149 INFO L93 Difference]: Finished difference Result 220 states and 255 transitions. [2024-11-13 14:19:53,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:19:53,149 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 14 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 57 [2024-11-13 14:19:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:53,151 INFO L225 Difference]: With dead ends: 220 [2024-11-13 14:19:53,152 INFO L226 Difference]: Without dead ends: 213 [2024-11-13 14:19:53,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:19:53,153 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 41 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:53,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 343 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:19:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-13 14:19:53,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 191. [2024-11-13 14:19:53,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 129 states have (on average 1.1395348837209303) internal successors, (147), 131 states have internal predecessors, (147), 34 states have call successors, (34), 28 states have call predecessors, (34), 27 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 14:19:53,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2024-11-13 14:19:53,207 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 57 [2024-11-13 14:19:53,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:53,207 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2024-11-13 14:19:53,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 14 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-13 14:19:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2024-11-13 14:19:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 14:19:53,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:53,209 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:53,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 14:19:53,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 14:19:53,413 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:53,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:53,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1360037621, now seen corresponding path program 1 times [2024-11-13 14:19:53,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:53,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504489720] [2024-11-13 14:19:53,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:53,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:53,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:19:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:53,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:19:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:53,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 14:19:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:53,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:19:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:53,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 14:19:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:53,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:19:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:53,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 14:19:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:53,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:19:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:53,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 14:19:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-13 14:19:53,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:53,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504489720] [2024-11-13 14:19:53,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504489720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:19:53,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395765120] [2024-11-13 14:19:53,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:53,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:53,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:19:53,690 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:19:53,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 14:19:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:53,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 14:19:53,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:19:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-13 14:19:53,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:19:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-13 14:19:54,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395765120] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:19:54,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:19:54,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 13 [2024-11-13 14:19:54,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306297827] [2024-11-13 14:19:54,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:19:54,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 14:19:54,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:54,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 14:19:54,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:19:54,003 INFO L87 Difference]: Start difference. First operand 191 states and 213 transitions. Second operand has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-13 14:19:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:54,259 INFO L93 Difference]: Finished difference Result 217 states and 242 transitions. [2024-11-13 14:19:54,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:19:54,260 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 59 [2024-11-13 14:19:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:54,262 INFO L225 Difference]: With dead ends: 217 [2024-11-13 14:19:54,262 INFO L226 Difference]: Without dead ends: 197 [2024-11-13 14:19:54,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:19:54,263 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:54,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:19:54,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-13 14:19:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 98. [2024-11-13 14:19:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.106060606060606) internal successors, (73), 68 states have internal predecessors, (73), 17 states have call successors, (17), 14 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-13 14:19:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2024-11-13 14:19:54,301 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 59 [2024-11-13 14:19:54,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:54,301 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2024-11-13 14:19:54,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-13 14:19:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-11-13 14:19:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 14:19:54,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:54,304 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:54,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 14:19:54,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 14:19:54,509 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:54,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash 529578318, now seen corresponding path program 2 times [2024-11-13 14:19:54,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:54,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957572613] [2024-11-13 14:19:54,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:54,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:54,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:19:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:54,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:19:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:54,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 14:19:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:54,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:19:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:54,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 14:19:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:54,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:19:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:54,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 14:19:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:54,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:19:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:54,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:19:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:54,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-13 14:19:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:54,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 14:19:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:54,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 14:19:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:54,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:19:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:54,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:19:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-13 14:19:54,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:54,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957572613] [2024-11-13 14:19:54,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957572613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:19:54,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817493889] [2024-11-13 14:19:54,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:19:54,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:54,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:19:54,766 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:19:54,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 14:19:54,847 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:19:54,848 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:19:54,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 14:19:54,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:19:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-13 14:19:54,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:19:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-13 14:19:55,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817493889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:19:55,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:19:55,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-13 14:19:55,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764355228] [2024-11-13 14:19:55,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:19:55,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 14:19:55,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:55,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 14:19:55,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:19:55,208 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2024-11-13 14:19:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:55,588 INFO L93 Difference]: Finished difference Result 233 states and 258 transitions. [2024-11-13 14:19:55,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 14:19:55,588 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) Word has length 95 [2024-11-13 14:19:55,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:55,590 INFO L225 Difference]: With dead ends: 233 [2024-11-13 14:19:55,590 INFO L226 Difference]: Without dead ends: 224 [2024-11-13 14:19:55,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:19:55,591 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:55,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 138 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:19:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-13 14:19:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 212. [2024-11-13 14:19:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 144 states have (on average 1.0902777777777777) internal successors, (157), 146 states have internal predecessors, (157), 35 states have call successors, (35), 32 states have call predecessors, (35), 32 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-13 14:19:55,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 225 transitions. [2024-11-13 14:19:55,645 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 225 transitions. Word has length 95 [2024-11-13 14:19:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:55,645 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 225 transitions. [2024-11-13 14:19:55,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2024-11-13 14:19:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 225 transitions. [2024-11-13 14:19:55,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 14:19:55,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:55,648 INFO L215 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:55,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 14:19:55,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:55,853 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:55,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:55,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1167042386, now seen corresponding path program 3 times [2024-11-13 14:19:55,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:55,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007134397] [2024-11-13 14:19:55,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:55,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:19:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:19:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 14:19:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:19:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 14:19:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:19:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 14:19:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:19:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:19:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-13 14:19:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 14:19:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 14:19:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:19:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:19:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 14:19:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:19:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:19:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:19:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-13 14:19:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 14:19:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 14:19:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 14:19:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-13 14:19:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 14:19:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 14:19:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 14:19:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-13 14:19:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 14:19:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-13 14:19:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-13 14:19:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-13 14:19:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 14:19:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2024-11-13 14:19:56,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:56,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007134397] [2024-11-13 14:19:56,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007134397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:19:56,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463629213] [2024-11-13 14:19:56,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 14:19:56,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:19:56,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:19:56,792 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:19:56,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 14:19:57,135 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2024-11-13 14:19:57,136 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:19:57,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 14:19:57,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:19:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 1955 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 14:19:57,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:19:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2024-11-13 14:19:57,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463629213] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:19:57,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:19:57,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 26 [2024-11-13 14:19:57,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296801761] [2024-11-13 14:19:57,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:19:57,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 14:19:57,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:57,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 14:19:57,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2024-11-13 14:19:57,940 INFO L87 Difference]: Start difference. First operand 212 states and 225 transitions. Second operand has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (97), 13 states have call predecessors, (97), 12 states have return successors, (96), 22 states have call predecessors, (96), 22 states have call successors, (96) [2024-11-13 14:19:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:58,765 INFO L93 Difference]: Finished difference Result 473 states and 522 transitions. [2024-11-13 14:19:58,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-13 14:19:58,766 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (97), 13 states have call predecessors, (97), 12 states have return successors, (96), 22 states have call predecessors, (96), 22 states have call successors, (96) Word has length 209 [2024-11-13 14:19:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:58,768 INFO L225 Difference]: With dead ends: 473 [2024-11-13 14:19:58,768 INFO L226 Difference]: Without dead ends: 464 [2024-11-13 14:19:58,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2024-11-13 14:19:58,770 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 155 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:58,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 242 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:19:58,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-13 14:19:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 440. [2024-11-13 14:19:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 300 states have (on average 1.0833333333333333) internal successors, (325), 302 states have internal predecessors, (325), 71 states have call successors, (71), 68 states have call predecessors, (71), 68 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-13 14:19:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 465 transitions. [2024-11-13 14:19:58,882 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 465 transitions. Word has length 209 [2024-11-13 14:19:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:58,882 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 465 transitions. [2024-11-13 14:19:58,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (97), 13 states have call predecessors, (97), 12 states have return successors, (96), 22 states have call predecessors, (96), 22 states have call successors, (96) [2024-11-13 14:19:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 465 transitions. [2024-11-13 14:19:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-11-13 14:19:58,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:58,890 INFO L215 NwaCegarLoop]: trace histogram [67, 66, 66, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:58,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 14:19:59,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 14:19:59,091 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:59,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash 812961646, now seen corresponding path program 4 times [2024-11-13 14:19:59,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:59,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774597279] [2024-11-13 14:19:59,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:59,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:20:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:20:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 14:20:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:20:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 14:20:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:20:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 14:20:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:20:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:20:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-13 14:20:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 14:20:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 14:20:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:20:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:20:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 14:20:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:20:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:20:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:20:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-13 14:20:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 14:20:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 14:20:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 14:20:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-13 14:20:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 14:20:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 14:20:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 14:20:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-13 14:20:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 14:20:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-13 14:20:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-13 14:20:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-13 14:20:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 14:20:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-13 14:20:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-13 14:20:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-13 14:20:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-13 14:20:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 14:20:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-13 14:20:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-13 14:20:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-13 14:20:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-13 14:20:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-13 14:20:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-13 14:20:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-13 14:20:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-13 14:20:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 14:20:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-13 14:20:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-13 14:20:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-11-13 14:20:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2024-11-13 14:20:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2024-11-13 14:20:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-11-13 14:20:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-11-13 14:20:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-11-13 14:20:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-11-13 14:20:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-13 14:20:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-13 14:20:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-13 14:20:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-13 14:20:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-11-13 14:20:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-11-13 14:20:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2024-11-13 14:20:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2024-11-13 14:20:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2024-11-13 14:20:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2024-11-13 14:20:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2024-11-13 14:20:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-11-13 14:20:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2024-11-13 14:20:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 1661 refuted. 0 times theorem prover too weak. 8584 trivial. 0 not checked. [2024-11-13 14:20:01,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:01,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774597279] [2024-11-13 14:20:01,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774597279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:20:01,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454756321] [2024-11-13 14:20:01,583 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 14:20:01,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:20:01,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:20:01,586 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:20:01,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 14:20:01,847 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 14:20:01,847 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:20:01,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-13 14:20:01,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:20:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 9977 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-13 14:20:02,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:20:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 1661 refuted. 0 times theorem prover too weak. 8584 trivial. 0 not checked. [2024-11-13 14:20:04,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454756321] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:20:04,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:20:04,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 26] total 50 [2024-11-13 14:20:04,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003631956] [2024-11-13 14:20:04,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:20:04,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-13 14:20:04,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:04,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-13 14:20:04,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2024-11-13 14:20:04,123 INFO L87 Difference]: Start difference. First operand 440 states and 465 transitions. Second operand has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (205), 25 states have call predecessors, (205), 24 states have return successors, (204), 46 states have call predecessors, (204), 46 states have call successors, (204) [2024-11-13 14:20:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:07,473 INFO L93 Difference]: Finished difference Result 953 states and 1050 transitions. [2024-11-13 14:20:07,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-11-13 14:20:07,475 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (205), 25 states have call predecessors, (205), 24 states have return successors, (204), 46 states have call predecessors, (204), 46 states have call successors, (204) Word has length 437 [2024-11-13 14:20:07,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:07,484 INFO L225 Difference]: With dead ends: 953 [2024-11-13 14:20:07,484 INFO L226 Difference]: Without dead ends: 944 [2024-11-13 14:20:07,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1078 GetRequests, 985 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2024-11-13 14:20:07,491 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 441 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:07,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 354 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 14:20:07,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-11-13 14:20:07,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 896. [2024-11-13 14:20:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 612 states have (on average 1.0800653594771241) internal successors, (661), 614 states have internal predecessors, (661), 143 states have call successors, (143), 140 states have call predecessors, (143), 140 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2024-11-13 14:20:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 945 transitions. [2024-11-13 14:20:07,720 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 945 transitions. Word has length 437 [2024-11-13 14:20:07,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:07,721 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 945 transitions. [2024-11-13 14:20:07,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (205), 25 states have call predecessors, (205), 24 states have return successors, (204), 46 states have call predecessors, (204), 46 states have call successors, (204) [2024-11-13 14:20:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 945 transitions. [2024-11-13 14:20:07,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2024-11-13 14:20:07,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:07,764 INFO L215 NwaCegarLoop]: trace histogram [139, 138, 138, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:07,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 14:20:07,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 14:20:07,968 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:20:07,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:07,970 INFO L85 PathProgramCache]: Analyzing trace with hash 444243182, now seen corresponding path program 5 times [2024-11-13 14:20:07,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:07,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451958157] [2024-11-13 14:20:07,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:07,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:20:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:20:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 14:20:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:20:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 14:20:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:20:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 14:20:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:20:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:20:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-13 14:20:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 14:20:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 14:20:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:20:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:20:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 14:20:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:20:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 14:20:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:20:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-13 14:20:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 14:20:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 14:20:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 14:20:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-13 14:20:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 14:20:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 14:20:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 14:20:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-13 14:20:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 14:20:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-13 14:20:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-13 14:20:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-13 14:20:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 14:20:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-13 14:20:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-13 14:20:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-13 14:20:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-13 14:20:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 14:20:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-13 14:20:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-13 14:20:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-13 14:20:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-13 14:20:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-13 14:20:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-13 14:20:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-13 14:20:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-13 14:20:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 14:20:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-13 14:20:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-13 14:20:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-11-13 14:20:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2024-11-13 14:20:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2024-11-13 14:20:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-11-13 14:20:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-11-13 14:20:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-11-13 14:20:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-11-13 14:20:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-13 14:20:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-13 14:20:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-13 14:20:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-13 14:20:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-11-13 14:20:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-11-13 14:20:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2024-11-13 14:20:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2024-11-13 14:20:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2024-11-13 14:20:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2024-11-13 14:20:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2024-11-13 14:20:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-11-13 14:20:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2024-11-13 14:20:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2024-11-13 14:20:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 438 [2024-11-13 14:20:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2024-11-13 14:20:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2024-11-13 14:20:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2024-11-13 14:20:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:17,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 462 [2024-11-13 14:20:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 471 [2024-11-13 14:20:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 476 [2024-11-13 14:20:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 481 [2024-11-13 14:20:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 490 [2024-11-13 14:20:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 495 [2024-11-13 14:20:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2024-11-13 14:20:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2024-11-13 14:20:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2024-11-13 14:20:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 519 [2024-11-13 14:20:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 528 [2024-11-13 14:20:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2024-11-13 14:20:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 538 [2024-11-13 14:20:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2024-11-13 14:20:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2024-11-13 14:20:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 557 [2024-11-13 14:20:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 566 [2024-11-13 14:20:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 571 [2024-11-13 14:20:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 576 [2024-11-13 14:20:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 585 [2024-11-13 14:20:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 590 [2024-11-13 14:20:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 595 [2024-11-13 14:20:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 604 [2024-11-13 14:20:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 609 [2024-11-13 14:20:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 614 [2024-11-13 14:20:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2024-11-13 14:20:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 628 [2024-11-13 14:20:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 633 [2024-11-13 14:20:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 642 [2024-11-13 14:20:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 647 [2024-11-13 14:20:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 652 [2024-11-13 14:20:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 661 [2024-11-13 14:20:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 666 [2024-11-13 14:20:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 671 [2024-11-13 14:20:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 680 [2024-11-13 14:20:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 685 [2024-11-13 14:20:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 690 [2024-11-13 14:20:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 699 [2024-11-13 14:20:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 704 [2024-11-13 14:20:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 709 [2024-11-13 14:20:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 718 [2024-11-13 14:20:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 723 [2024-11-13 14:20:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 728 [2024-11-13 14:20:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 737 [2024-11-13 14:20:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 742 [2024-11-13 14:20:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 747 [2024-11-13 14:20:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2024-11-13 14:20:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 761 [2024-11-13 14:20:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 766 [2024-11-13 14:20:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 775 [2024-11-13 14:20:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 780 [2024-11-13 14:20:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 785 [2024-11-13 14:20:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 794 [2024-11-13 14:20:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 799 [2024-11-13 14:20:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 804 [2024-11-13 14:20:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 813 [2024-11-13 14:20:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 818 [2024-11-13 14:20:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 823 [2024-11-13 14:20:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 832 [2024-11-13 14:20:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 837 [2024-11-13 14:20:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 842 [2024-11-13 14:20:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 851 [2024-11-13 14:20:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 856 [2024-11-13 14:20:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 861 [2024-11-13 14:20:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 870 [2024-11-13 14:20:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 875 [2024-11-13 14:20:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 880 [2024-11-13 14:20:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:18,386 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 7337 refuted. 0 times theorem prover too weak. 37816 trivial. 0 not checked. [2024-11-13 14:20:18,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:18,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451958157] [2024-11-13 14:20:18,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451958157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:20:18,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634650858] [2024-11-13 14:20:18,387 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 14:20:18,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:20:18,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:20:18,390 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:20:18,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 14:21:06,143 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2024-11-13 14:21:06,143 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:21:06,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-13 14:21:06,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:21:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 44597 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-13 14:21:07,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:21:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 7337 refuted. 0 times theorem prover too weak. 37816 trivial. 0 not checked. [2024-11-13 14:21:10,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634650858] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:21:10,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:21:10,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 50] total 54 [2024-11-13 14:21:10,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951143858] [2024-11-13 14:21:10,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:21:10,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-13 14:21:10,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:10,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-13 14:21:10,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2024-11-13 14:21:10,823 INFO L87 Difference]: Start difference. First operand 896 states and 945 transitions. Second operand has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (292), 49 states have call predecessors, (292), 48 states have return successors, (291), 50 states have call predecessors, (291), 50 states have call successors, (291) [2024-11-13 14:21:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:13,871 INFO L93 Difference]: Finished difference Result 989 states and 1050 transitions. [2024-11-13 14:21:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-13 14:21:13,872 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (292), 49 states have call predecessors, (292), 48 states have return successors, (291), 50 states have call predecessors, (291), 50 states have call successors, (291) Word has length 893 [2024-11-13 14:21:13,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:13,879 INFO L225 Difference]: With dead ends: 989 [2024-11-13 14:21:13,879 INFO L226 Difference]: Without dead ends: 980 [2024-11-13 14:21:13,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2162 GetRequests, 2017 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2024-11-13 14:21:13,884 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 183 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:13,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 384 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 14:21:13,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2024-11-13 14:21:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 972. [2024-11-13 14:21:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 664 states have (on average 1.0798192771084338) internal successors, (717), 666 states have internal predecessors, (717), 155 states have call successors, (155), 152 states have call predecessors, (155), 152 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2024-11-13 14:21:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1025 transitions. [2024-11-13 14:21:14,130 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1025 transitions. Word has length 893 [2024-11-13 14:21:14,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:14,132 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1025 transitions. [2024-11-13 14:21:14,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (292), 49 states have call predecessors, (292), 48 states have return successors, (291), 50 states have call predecessors, (291), 50 states have call successors, (291) [2024-11-13 14:21:14,133 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1025 transitions. [2024-11-13 14:21:14,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2024-11-13 14:21:14,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:14,172 INFO L215 NwaCegarLoop]: trace histogram [151, 150, 150, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:21:14,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 14:21:14,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 14:21:14,373 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:21:14,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:14,373 INFO L85 PathProgramCache]: Analyzing trace with hash 755396398, now seen corresponding path program 6 times [2024-11-13 14:21:14,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:14,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443785162] [2024-11-13 14:21:14,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:14,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:21:15,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [576056448] [2024-11-13 14:21:15,081 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-13 14:21:15,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:21:15,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:21:15,084 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:21:15,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 14:21:18,991 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 98 check-sat command(s) [2024-11-13 14:21:18,991 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 14:21:18,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:21:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:21:19,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:21:19,710 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:21:19,711 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:21:19,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 14:21:19,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 14:21:19,917 INFO L407 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:21:20,211 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:21:20,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:21:20 BoogieIcfgContainer [2024-11-13 14:21:20,218 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:21:20,219 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:21:20,222 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:21:20,223 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:21:20,224 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:19:35" (3/4) ... [2024-11-13 14:21:20,225 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 14:21:20,529 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 14:21:20,530 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:21:20,531 INFO L158 Benchmark]: Toolchain (without parser) took 105728.41ms. Allocated memory was 117.4MB in the beginning and 679.5MB in the end (delta: 562.0MB). Free memory was 92.8MB in the beginning and 500.4MB in the end (delta: -407.7MB). Peak memory consumption was 149.9MB. Max. memory is 16.1GB. [2024-11-13 14:21:20,531 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 117.4MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:21:20,531 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.31ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 81.3MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:21:20,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.07ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 80.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:21:20,532 INFO L158 Benchmark]: Boogie Preprocessor took 42.75ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 78.7MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:21:20,532 INFO L158 Benchmark]: RCFGBuilder took 430.51ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 67.9MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:21:20,533 INFO L158 Benchmark]: TraceAbstraction took 104492.44ms. Allocated memory was 117.4MB in the beginning and 679.5MB in the end (delta: 562.0MB). Free memory was 67.4MB in the beginning and 529.8MB in the end (delta: -462.4MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. [2024-11-13 14:21:20,533 INFO L158 Benchmark]: Witness Printer took 310.29ms. Allocated memory is still 679.5MB. Free memory was 529.8MB in the beginning and 500.4MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:21:20,535 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 117.4MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.31ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 81.3MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.07ms. Allocated memory is still 117.4MB. Free memory was 81.3MB in the beginning and 80.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.75ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 78.7MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 430.51ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 67.9MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 104492.44ms. Allocated memory was 117.4MB in the beginning and 679.5MB in the end (delta: 562.0MB). Free memory was 67.4MB in the beginning and 529.8MB in the end (delta: -462.4MB). Peak memory consumption was 99.6MB. Max. memory is 16.1GB. * Witness Printer took 310.29ms. Allocated memory is still 679.5MB. Free memory was 529.8MB in the beginning and 500.4MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. 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: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=52, y=1] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=52, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=52, b=1, counter=0, p=1, q=0, r=0, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=51, b=1, counter=1, p=1, q=0, r=-1, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=50, b=1, counter=2, p=1, q=0, r=-2, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=49, b=1, counter=3, p=1, q=0, r=-3, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=48, b=1, counter=4, p=1, q=0, r=-4, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=47, b=1, counter=5, p=1, q=0, r=-5, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=46, b=1, counter=6, p=1, q=0, r=-6, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=45, b=1, counter=7, p=1, q=0, r=-7, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=44, b=1, counter=8, p=1, q=0, r=-8, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=43, b=1, counter=9, p=1, q=0, r=-9, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=42, b=1, counter=10, p=1, q=0, r=-10, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=41, b=1, counter=11, p=1, q=0, r=-11, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=40, b=1, counter=12, p=1, q=0, r=-12, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=39, b=1, counter=13, p=1, q=0, r=-13, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=38, b=1, counter=14, p=1, q=0, r=-14, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=37, b=1, counter=15, p=1, q=0, r=-15, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=36, b=1, counter=16, p=1, q=0, r=-16, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=35, b=1, counter=17, p=1, q=0, r=-17, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=34, b=1, counter=18, p=1, q=0, r=-18, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=33, b=1, counter=19, p=1, q=0, r=-19, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=32, b=1, counter=20, p=1, q=0, r=-20, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=31, b=1, counter=21, p=1, q=0, r=-21, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=30, b=1, counter=22, p=1, q=0, r=-22, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=29, b=1, counter=23, p=1, q=0, r=-23, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=28, b=1, counter=24, p=1, q=0, r=-24, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=27, b=1, counter=25, p=1, q=0, r=-25, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=26, b=1, counter=26, p=1, q=0, r=-26, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=25, b=1, counter=27, p=1, q=0, r=-27, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=24, b=1, counter=28, p=1, q=0, r=-28, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=23, b=1, counter=29, p=1, q=0, r=-29, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=22, b=1, counter=30, p=1, q=0, r=-30, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=21, b=1, counter=31, p=1, q=0, r=-31, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=20, b=1, counter=32, p=1, q=0, r=-32, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=19, b=1, counter=33, p=1, q=0, r=-33, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=18, b=1, counter=34, p=1, q=0, r=-34, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=17, b=1, counter=35, p=1, q=0, r=-35, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=16, b=1, counter=36, p=1, q=0, r=-36, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=15, b=1, counter=37, p=1, q=0, r=-37, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=14, b=1, counter=38, p=1, q=0, r=-38, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=13, b=1, counter=39, p=1, q=0, r=-39, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=12, b=1, counter=40, p=1, q=0, r=-40, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=11, b=1, counter=41, p=1, q=0, r=-41, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=10, b=1, counter=42, p=1, q=0, r=-42, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=9, b=1, counter=43, p=1, q=0, r=-43, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=8, b=1, counter=44, p=1, q=0, r=-44, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=7, b=1, counter=45, p=1, q=0, r=-45, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=6, b=1, counter=46, p=1, q=0, r=-46, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=5, b=1, counter=47, p=1, q=0, r=-47, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=4, b=1, counter=48, p=1, q=0, r=-48, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=3, b=1, counter=49, p=1, q=0, r=-49, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=2, b=1, counter=50, p=1, q=0, r=-50, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=2, b=1, counter=51, p=1, q=0, r=-50, s=1, x=52, y=1] [L34] COND FALSE !(counter++<50) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=51] [L11] COND TRUE !(cond) VAL [\old(cond)=0, counter=51] [L13] reach_error() VAL [\old(cond)=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 104.1s, OverallIterations: 18, TraceHistogramMax: 151, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1080 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1049 mSDsluCounter, 3141 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2603 mSDsCounter, 356 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2146 IncrementalHoareTripleChecker+Invalid, 2502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 356 mSolverCounterUnsat, 538 mSDtfsCounter, 2146 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4732 GetRequests, 4308 SyntacticMatches, 46 SemanticMatches, 378 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4226 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=972occurred in iteration=17, InterpolantAutomatonStates: 364, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 303 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 53.4s SatisfiabilityAnalysisTime, 28.9s InterpolantComputationTime, 6068 NumberOfCodeBlocks, 6053 NumberOfCodeBlocksAsserted, 241 NumberOfCheckSat, 5718 ConstructedInterpolants, 0 QuantifiedInterpolants, 13658 SizeOfPredicates, 104 NumberOfNonLiveVariables, 4657 ConjunctsInSsa, 351 ConjunctsInUnsatCore, 33 InterpolantComputations, 8 PerfectInterpolantSequences, 100119/175782 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 14:21:20,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d7beed-1174-4b25-9c21-75c46745075d/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