./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.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_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/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_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/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_151c2661-ba14-44e3-a31d-327ec3509e67/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 f5161832faa85efa7698287d22f9a23de4fa8b958c1b2d2c225d3d8c999a24ce --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:44:24,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:44:24,623 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 12:44:24,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:44:24,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:44:24,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:44:24,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:44:24,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:44:24,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:44:24,668 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:44:24,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:44:24,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:44:24,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:44:24,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:44:24,669 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:44:24,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:44:24,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:44:24,670 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:44:24,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:44:24,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:44:24,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:44:24,670 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:44:24,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:44:24,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:44:24,671 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:44:24,671 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:44:24,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:44:24,671 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:44:24,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:44:24,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:44:24,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:44:24,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:44:24,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:44:24,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:44:24,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:44:24,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:44:24,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:44:24,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:44:24,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:44:24,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:44:24,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:44:24,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:44:24,674 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_151c2661-ba14-44e3-a31d-327ec3509e67/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 -> f5161832faa85efa7698287d22f9a23de4fa8b958c1b2d2c225d3d8c999a24ce [2024-11-13 12:44:25,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:44:25,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:44:25,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:44:25,069 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:44:25,069 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:44:25,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c Unable to find full path for "g++" [2024-11-13 12:44:27,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:44:27,319 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:44:27,322 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c [2024-11-13 12:44:27,333 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/data/8247b8f87/7bfab24f26d44de1813beec77b807bc6/FLAG5bd630fae [2024-11-13 12:44:27,635 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/data/8247b8f87/7bfab24f26d44de1813beec77b807bc6 [2024-11-13 12:44:27,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:44:27,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:44:27,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:44:27,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:44:27,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:44:27,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:44:27" (1/1) ... [2024-11-13 12:44:27,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@333782b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:27, skipping insertion in model container [2024-11-13 12:44:27,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:44:27" (1/1) ... [2024-11-13 12:44:27,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:44:27,827 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_151c2661-ba14-44e3-a31d-327ec3509e67/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c[489,502] [2024-11-13 12:44:27,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:44:27,870 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:44:27,883 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_151c2661-ba14-44e3-a31d-327ec3509e67/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c[489,502] [2024-11-13 12:44:27,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:44:27,910 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:44:27,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:27 WrapperNode [2024-11-13 12:44:27,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:44:27,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:44:27,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:44:27,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:44:27,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:27" (1/1) ... [2024-11-13 12:44:27,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:27" (1/1) ... [2024-11-13 12:44:27,955 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2024-11-13 12:44:27,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:44:27,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:44:27,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:44:27,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:44:27,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:27" (1/1) ... [2024-11-13 12:44:27,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:27" (1/1) ... [2024-11-13 12:44:27,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:27" (1/1) ... [2024-11-13 12:44:27,999 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 12:44:28,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:27" (1/1) ... [2024-11-13 12:44:28,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:27" (1/1) ... [2024-11-13 12:44:28,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:27" (1/1) ... [2024-11-13 12:44:28,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:27" (1/1) ... [2024-11-13 12:44:28,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:27" (1/1) ... [2024-11-13 12:44:28,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:27" (1/1) ... [2024-11-13 12:44:28,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:44:28,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:44:28,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:44:28,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:44:28,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:27" (1/1) ... [2024-11-13 12:44:28,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:44:28,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:28,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:28,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:44:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:44:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 12:44:28,121 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 12:44:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:44:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:44:28,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:44:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 12:44:28,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 12:44:28,215 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:44:28,220 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:44:28,460 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-13 12:44:28,460 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:44:28,478 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:44:28,480 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 12:44:28,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:28 BoogieIcfgContainer [2024-11-13 12:44:28,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:44:28,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:44:28,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:44:28,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:44:28,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:44:27" (1/3) ... [2024-11-13 12:44:28,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509247f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:44:28, skipping insertion in model container [2024-11-13 12:44:28,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:27" (2/3) ... [2024-11-13 12:44:28,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509247f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:44:28, skipping insertion in model container [2024-11-13 12:44:28,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:28" (3/3) ... [2024-11-13 12:44:28,499 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound100.c [2024-11-13 12:44:28,519 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:44:28,521 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG egcd-ll_unwindbound100.c that has 3 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 12:44:28,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:44:28,606 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;@75059be1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:44:28,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:44:28,611 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 12:44:28,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 12:44:28,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:28,621 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:28,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:28,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:28,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2008432909, now seen corresponding path program 1 times [2024-11-13 12:44:28,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:28,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030137904] [2024-11-13 12:44:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:28,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 12:44:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:28,836 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 12:44:28,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:28,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030137904] [2024-11-13 12:44:28,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030137904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:28,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:28,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:44:28,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674583352] [2024-11-13 12:44:28,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:28,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 12:44:28,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:28,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 12:44:28,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:44:28,876 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 12:44:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:28,905 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2024-11-13 12:44:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:44:28,908 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 12:44:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:28,914 INFO L225 Difference]: With dead ends: 57 [2024-11-13 12:44:28,914 INFO L226 Difference]: Without dead ends: 26 [2024-11-13 12:44:28,917 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 12:44:28,920 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 12:44:28,921 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 12:44:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-13 12:44:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-13 12:44:28,956 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 12:44:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-11-13 12:44:28,966 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2024-11-13 12:44:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:28,967 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-11-13 12:44:28,968 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 12:44:28,968 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2024-11-13 12:44:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 12:44:28,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:28,970 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:28,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:44:28,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:28,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash -194242802, now seen corresponding path program 1 times [2024-11-13 12:44:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:28,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455020846] [2024-11-13 12:44:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:28,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 12:44:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,189 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 12:44:29,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:29,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455020846] [2024-11-13 12:44:29,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455020846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:29,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:29,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:44:29,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993318084] [2024-11-13 12:44:29,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:29,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:44:29,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:29,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:44:29,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:44:29,193 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 12:44:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:29,220 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2024-11-13 12:44:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:44:29,221 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 12:44:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:29,222 INFO L225 Difference]: With dead ends: 38 [2024-11-13 12:44:29,222 INFO L226 Difference]: Without dead ends: 28 [2024-11-13 12:44:29,223 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 12:44:29,224 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 12:44:29,224 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 12:44:29,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-13 12:44:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-13 12:44:29,239 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 12:44:29,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2024-11-13 12:44:29,242 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2024-11-13 12:44:29,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:29,243 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2024-11-13 12:44:29,243 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 12:44:29,244 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2024-11-13 12:44:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 12:44:29,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:29,247 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:29,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:44:29,248 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:29,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:29,249 INFO L85 PathProgramCache]: Analyzing trace with hash -192574506, now seen corresponding path program 1 times [2024-11-13 12:44:29,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:29,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685525141] [2024-11-13 12:44:29,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:29,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:44:29,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [608572043] [2024-11-13 12:44:29,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:29,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:29,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:29,298 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:29,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 12:44:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:29,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 12:44:29,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:29,624 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 12:44:29,625 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:44:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685525141] [2024-11-13 12:44:29,626 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 12:44:29,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608572043] [2024-11-13 12:44:29,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608572043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:29,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:29,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:29,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890415814] [2024-11-13 12:44:29,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:29,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:29,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:29,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:29,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:29,628 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 12:44:29,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:29,771 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2024-11-13 12:44:29,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:29,772 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 12:44:29,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:29,773 INFO L225 Difference]: With dead ends: 45 [2024-11-13 12:44:29,773 INFO L226 Difference]: Without dead ends: 43 [2024-11-13 12:44:29,774 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 12:44:29,775 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 12:44:29,776 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 12:44:29,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-13 12:44:29,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-11-13 12:44:29,789 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 12:44:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-11-13 12:44:29,790 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2024-11-13 12:44:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:29,791 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-11-13 12:44:29,791 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 12:44:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-11-13 12:44:29,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 12:44:29,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:29,793 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 12:44:29,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 12:44:29,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:29,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:29,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:29,998 INFO L85 PathProgramCache]: Analyzing trace with hash -904793029, now seen corresponding path program 1 times [2024-11-13 12:44:29,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:29,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340336340] [2024-11-13 12:44:29,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:29,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:44:30,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1702154652] [2024-11-13 12:44:30,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:30,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:30,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:30,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:30,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:44:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 12:44:30,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:30,272 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 12:44:30,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:44:30,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:30,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340336340] [2024-11-13 12:44:30,273 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 12:44:30,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702154652] [2024-11-13 12:44:30,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702154652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:30,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:30,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:30,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966256293] [2024-11-13 12:44:30,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:30,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:30,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:30,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:30,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:30,276 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 12:44:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:30,398 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2024-11-13 12:44:30,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:30,399 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 12:44:30,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:30,400 INFO L225 Difference]: With dead ends: 49 [2024-11-13 12:44:30,401 INFO L226 Difference]: Without dead ends: 47 [2024-11-13 12:44:30,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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 12:44:30,402 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 12:44:30,403 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 12:44:30,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-13 12:44:30,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-13 12:44:30,413 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 12:44:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2024-11-13 12:44:30,415 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2024-11-13 12:44:30,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:30,416 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2024-11-13 12:44:30,416 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 12:44:30,416 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2024-11-13 12:44:30,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 12:44:30,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:30,417 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 12:44:30,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 12:44:30,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-13 12:44:30,622 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:30,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:30,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1333978442, now seen corresponding path program 1 times [2024-11-13 12:44:30,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:30,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602953497] [2024-11-13 12:44:30,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:30,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:44:30,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434571727] [2024-11-13 12:44:30,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:30,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:30,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:30,677 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:30,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 12:44:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:30,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 12:44:30,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:30,871 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 12:44:30,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:44:30,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:30,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602953497] [2024-11-13 12:44:30,871 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 12:44:30,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434571727] [2024-11-13 12:44:30,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434571727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:30,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:30,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:30,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610246614] [2024-11-13 12:44:30,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:30,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:30,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:30,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:30,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:30,877 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 12:44:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:30,970 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2024-11-13 12:44:30,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:30,973 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 12:44:30,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:30,978 INFO L225 Difference]: With dead ends: 71 [2024-11-13 12:44:30,978 INFO L226 Difference]: Without dead ends: 67 [2024-11-13 12:44:30,978 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 12:44:30,979 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 12:44:30,979 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 12:44:30,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-13 12:44:31,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-13 12:44:31,010 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 12:44:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2024-11-13 12:44:31,014 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 29 [2024-11-13 12:44:31,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:31,014 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2024-11-13 12:44:31,014 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 12:44:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2024-11-13 12:44:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 12:44:31,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:31,015 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 12:44:31,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 12:44:31,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:31,216 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:31,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:31,216 INFO L85 PathProgramCache]: Analyzing trace with hash 563624787, now seen corresponding path program 1 times [2024-11-13 12:44:31,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:31,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667436974] [2024-11-13 12:44:31,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:31,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 12:44:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 12:44:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 12:44:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:44:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,387 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 12:44:31,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:31,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667436974] [2024-11-13 12:44:31,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667436974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:31,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:31,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:31,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585192325] [2024-11-13 12:44:31,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:31,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:31,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:31,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:31,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:31,390 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 12:44:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:31,479 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2024-11-13 12:44:31,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:31,480 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 12:44:31,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:31,484 INFO L225 Difference]: With dead ends: 83 [2024-11-13 12:44:31,484 INFO L226 Difference]: Without dead ends: 81 [2024-11-13 12:44:31,484 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 12:44:31,487 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.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:31,488 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.0s Time] [2024-11-13 12:44:31,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-13 12:44:31,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2024-11-13 12:44:31,517 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 12:44:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2024-11-13 12:44:31,519 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 35 [2024-11-13 12:44:31,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:31,520 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2024-11-13 12:44:31,521 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 12:44:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2024-11-13 12:44:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 12:44:31,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:31,523 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 12:44:31,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 12:44:31,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:31,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:31,527 INFO L85 PathProgramCache]: Analyzing trace with hash -437963263, now seen corresponding path program 1 times [2024-11-13 12:44:31,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:31,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194950326] [2024-11-13 12:44:31,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:31,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 12:44:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 12:44:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 12:44:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:44:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,706 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 12:44:31,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:31,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194950326] [2024-11-13 12:44:31,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194950326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:31,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469450570] [2024-11-13 12:44:31,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:31,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:31,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:31,709 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:31,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 12:44:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:31,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 12:44:31,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:31,862 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 12:44:31,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:31,955 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 12:44:31,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469450570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:31,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:44:31,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-13 12:44:31,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934094923] [2024-11-13 12:44:31,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:31,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:44:31,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:31,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:44:31,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:44:31,958 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 12:44:32,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:32,169 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2024-11-13 12:44:32,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:44:32,170 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 12:44:32,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:32,176 INFO L225 Difference]: With dead ends: 218 [2024-11-13 12:44:32,176 INFO L226 Difference]: Without dead ends: 196 [2024-11-13 12:44:32,177 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 12:44:32,178 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 47 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:32,178 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.1s Time] [2024-11-13 12:44:32,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-13 12:44:32,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2024-11-13 12:44:32,219 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 12:44:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2024-11-13 12:44:32,224 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 38 [2024-11-13 12:44:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:32,225 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2024-11-13 12:44:32,225 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 12:44:32,225 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2024-11-13 12:44:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 12:44:32,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:32,226 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 12:44:32,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 12:44:32,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-13 12:44:32,427 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:32,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash -436294967, now seen corresponding path program 1 times [2024-11-13 12:44:32,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:32,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083031983] [2024-11-13 12:44:32,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:32,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:44:32,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [3859642] [2024-11-13 12:44:32,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:32,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:32,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:32,449 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:32,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 12:44:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:32,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 12:44:32,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:32,649 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 12:44:32,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:44:32,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:32,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083031983] [2024-11-13 12:44:32,650 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 12:44:32,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3859642] [2024-11-13 12:44:32,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3859642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:32,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:32,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:32,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986576208] [2024-11-13 12:44:32,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:32,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:32,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:32,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:32,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:32,652 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 12:44:32,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:32,753 INFO L93 Difference]: Finished difference Result 204 states and 260 transitions. [2024-11-13 12:44:32,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:32,755 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 12:44:32,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:32,757 INFO L225 Difference]: With dead ends: 204 [2024-11-13 12:44:32,757 INFO L226 Difference]: Without dead ends: 199 [2024-11-13 12:44:32,759 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 12:44:32,760 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:32,760 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.0s Time] [2024-11-13 12:44:32,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-13 12:44:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-13 12:44:32,805 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 12:44:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2024-11-13 12:44:32,809 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2024-11-13 12:44:32,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:32,810 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2024-11-13 12:44:32,810 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 12:44:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2024-11-13 12:44:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 12:44:32,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:32,814 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 12:44:32,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-13 12:44:33,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:33,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:33,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:33,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1845080606, now seen corresponding path program 1 times [2024-11-13 12:44:33,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:33,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35612423] [2024-11-13 12:44:33,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:33,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 12:44:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 12:44:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 12:44:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:44:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-13 12:44:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,282 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 12:44:33,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:33,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35612423] [2024-11-13 12:44:33,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35612423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:33,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356066429] [2024-11-13 12:44:33,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:33,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:33,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:33,285 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:33,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 12:44:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:33,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 12:44:33,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:33,523 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 12:44:33,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:44:33,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356066429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:33,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:44:33,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-13 12:44:33,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174037874] [2024-11-13 12:44:33,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:33,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:44:33,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:33,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:44:33,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:44:33,525 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 12:44:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:33,690 INFO L93 Difference]: Finished difference Result 230 states and 279 transitions. [2024-11-13 12:44:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:44:33,691 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 12:44:33,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:33,693 INFO L225 Difference]: With dead ends: 230 [2024-11-13 12:44:33,693 INFO L226 Difference]: Without dead ends: 220 [2024-11-13 12:44:33,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:44:33,698 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 12:44:33,699 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 12:44:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-13 12:44:33,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2024-11-13 12:44:33,748 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 12:44:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 261 transitions. [2024-11-13 12:44:33,751 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 261 transitions. Word has length 40 [2024-11-13 12:44:33,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:33,751 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 261 transitions. [2024-11-13 12:44:33,751 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 12:44:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 261 transitions. [2024-11-13 12:44:33,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 12:44:33,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:33,752 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 12:44:33,774 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 12:44:33,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:33,956 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:33,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:33,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1404750552, now seen corresponding path program 2 times [2024-11-13 12:44:33,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:33,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993079169] [2024-11-13 12:44:33,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:33,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:44:33,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [311996859] [2024-11-13 12:44:33,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:44:33,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:33,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:33,976 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:33,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 12:44:34,044 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:44:34,044 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:44:34,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 12:44:34,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:34,512 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 12:44:34,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:35,563 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 12:44:35,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:35,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993079169] [2024-11-13 12:44:35,563 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 12:44:35,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311996859] [2024-11-13 12:44:35,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311996859] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:35,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:44:35,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2024-11-13 12:44:35,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634523978] [2024-11-13 12:44:35,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:35,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 12:44:35,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:35,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 12:44:35,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-13 12:44:35,566 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 12:44:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:37,259 INFO L93 Difference]: Finished difference Result 266 states and 335 transitions. [2024-11-13 12:44:37,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 12:44:37,261 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 12:44:37,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:37,266 INFO L225 Difference]: With dead ends: 266 [2024-11-13 12:44:37,266 INFO L226 Difference]: Without dead ends: 264 [2024-11-13 12:44:37,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2024-11-13 12:44:37,269 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 45 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:37,270 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.0s Time] [2024-11-13 12:44:37,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-13 12:44:37,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 228. [2024-11-13 12:44:37,400 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 12:44:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 270 transitions. [2024-11-13 12:44:37,405 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 270 transitions. Word has length 43 [2024-11-13 12:44:37,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:37,405 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 270 transitions. [2024-11-13 12:44:37,406 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 12:44:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 270 transitions. [2024-11-13 12:44:37,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 12:44:37,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:37,408 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 12:44:37,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 12:44:37,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:37,613 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:37,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:37,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1575869973, now seen corresponding path program 1 times [2024-11-13 12:44:37,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:37,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093995571] [2024-11-13 12:44:37,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:37,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:44:37,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2042904688] [2024-11-13 12:44:37,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:37,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:37,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:37,651 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:37,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 12:44:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:37,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 12:44:37,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:38,319 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 12:44:38,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:38,965 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 12:44:38,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:38,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093995571] [2024-11-13 12:44:38,966 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 12:44:38,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042904688] [2024-11-13 12:44:38,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042904688] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:38,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:44:38,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-11-13 12:44:38,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161224387] [2024-11-13 12:44:38,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:38,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 12:44:38,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:38,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 12:44:38,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-13 12:44:38,969 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 12:44:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:41,038 INFO L93 Difference]: Finished difference Result 277 states and 342 transitions. [2024-11-13 12:44:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:44:41,039 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 12:44:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:41,043 INFO L225 Difference]: With dead ends: 277 [2024-11-13 12:44:41,045 INFO L226 Difference]: Without dead ends: 235 [2024-11-13 12:44:41,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2024-11-13 12:44:41,047 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 26 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:41,047 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.5s Time] [2024-11-13 12:44:41,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-13 12:44:41,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 200. [2024-11-13 12:44:41,106 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 12:44:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 229 transitions. [2024-11-13 12:44:41,109 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 229 transitions. Word has length 48 [2024-11-13 12:44:41,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:41,110 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 229 transitions. [2024-11-13 12:44:41,110 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 12:44:41,110 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 229 transitions. [2024-11-13 12:44:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 12:44:41,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:41,114 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 12:44:41,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 12:44:41,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-13 12:44:41,315 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:41,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:41,316 INFO L85 PathProgramCache]: Analyzing trace with hash -412106888, now seen corresponding path program 1 times [2024-11-13 12:44:41,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:41,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106633889] [2024-11-13 12:44:41,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:41,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:44:41,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625222253] [2024-11-13 12:44:41,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:41,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:41,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:41,353 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:41,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 12:44:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:41,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 12:44:41,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:41,797 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 12:44:41,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:42,199 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 12:44:42,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:42,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106633889] [2024-11-13 12:44:42,200 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 12:44:42,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625222253] [2024-11-13 12:44:42,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625222253] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:42,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:44:42,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-13 12:44:42,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421032831] [2024-11-13 12:44:42,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:42,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 12:44:42,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:42,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 12:44:42,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-13 12:44:42,203 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 12:44:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:42,781 INFO L93 Difference]: Finished difference Result 220 states and 255 transitions. [2024-11-13 12:44:42,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:44:42,782 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 12:44:42,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:42,785 INFO L225 Difference]: With dead ends: 220 [2024-11-13 12:44:42,786 INFO L226 Difference]: Without dead ends: 213 [2024-11-13 12:44:42,787 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 12:44:42,788 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.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:42,789 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.4s Time] [2024-11-13 12:44:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-13 12:44:42,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 191. [2024-11-13 12:44:42,849 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 12:44:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2024-11-13 12:44:42,854 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 57 [2024-11-13 12:44:42,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:42,855 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2024-11-13 12:44:42,855 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 12:44:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2024-11-13 12:44:42,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 12:44:42,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:42,856 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 12:44:42,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 12:44:43,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:43,057 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:43,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1360037621, now seen corresponding path program 1 times [2024-11-13 12:44:43,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:43,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184986158] [2024-11-13 12:44:43,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:43,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:43,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:43,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 12:44:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:43,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 12:44:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:43,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 12:44:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:43,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:44:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:43,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 12:44:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:43,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 12:44:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:43,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 12:44:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:43,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 12:44:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:43,397 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 12:44:43,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:43,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184986158] [2024-11-13 12:44:43,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184986158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:43,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376638402] [2024-11-13 12:44:43,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:43,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:43,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:43,400 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:43,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 12:44:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:43,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 12:44:43,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:43,571 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 12:44:43,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:43,721 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 12:44:43,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376638402] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:43,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:44:43,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 13 [2024-11-13 12:44:43,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130377808] [2024-11-13 12:44:43,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:43,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 12:44:43,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:43,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:44:43,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:44:43,725 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 12:44:43,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:43,983 INFO L93 Difference]: Finished difference Result 217 states and 242 transitions. [2024-11-13 12:44:43,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:44:43,984 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 12:44:43,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:43,986 INFO L225 Difference]: With dead ends: 217 [2024-11-13 12:44:43,986 INFO L226 Difference]: Without dead ends: 197 [2024-11-13 12:44:43,986 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 12:44:43,987 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 12:44:43,987 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 12:44:43,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-13 12:44:44,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 98. [2024-11-13 12:44:44,028 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 12:44:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2024-11-13 12:44:44,029 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 59 [2024-11-13 12:44:44,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:44,030 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2024-11-13 12:44:44,030 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 12:44:44,030 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-11-13 12:44:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 12:44:44,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:44,033 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 12:44:44,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-13 12:44:44,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 12:44:44,234 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:44,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:44,234 INFO L85 PathProgramCache]: Analyzing trace with hash 529578318, now seen corresponding path program 2 times [2024-11-13 12:44:44,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:44,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598724669] [2024-11-13 12:44:44,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:44,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 12:44:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 12:44:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 12:44:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:44:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 12:44:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 12:44:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 12:44:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-13 12:44:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 12:44:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 12:44:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:44:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,552 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 12:44:44,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:44,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598724669] [2024-11-13 12:44:44,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598724669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:44,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458236684] [2024-11-13 12:44:44,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:44:44,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:44,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:44,557 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:44,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 12:44:44,634 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:44:44,634 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:44:44,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 12:44:44,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:44,769 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 12:44:44,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:44,956 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 12:44:44,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458236684] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:44,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:44:44,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-13 12:44:44,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373928923] [2024-11-13 12:44:44,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:44,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 12:44:44,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:44,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 12:44:44,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:44:44,960 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 12:44:45,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:45,305 INFO L93 Difference]: Finished difference Result 233 states and 258 transitions. [2024-11-13 12:44:45,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 12:44:45,306 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 12:44:45,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:45,308 INFO L225 Difference]: With dead ends: 233 [2024-11-13 12:44:45,308 INFO L226 Difference]: Without dead ends: 224 [2024-11-13 12:44:45,309 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 12:44:45,309 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 12:44:45,310 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 12:44:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-13 12:44:45,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 212. [2024-11-13 12:44:45,361 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 12:44:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 225 transitions. [2024-11-13 12:44:45,362 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 225 transitions. Word has length 95 [2024-11-13 12:44:45,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:45,363 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 225 transitions. [2024-11-13 12:44:45,363 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 12:44:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 225 transitions. [2024-11-13 12:44:45,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 12:44:45,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:45,365 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 12:44:45,383 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 12:44:45,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:45,566 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:45,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:45,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1167042386, now seen corresponding path program 3 times [2024-11-13 12:44:45,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:45,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011824842] [2024-11-13 12:44:45,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:45,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 12:44:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 12:44:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 12:44:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:44:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 12:44:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 12:44:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 12:44:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-13 12:44:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 12:44:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 12:44:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:44:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 12:44:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 12:44:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 12:44:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-13 12:44:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 12:44:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 12:44:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 12:44:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-13 12:44:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 12:44:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 12:44:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 12:44:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-13 12:44:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 12:44:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-13 12:44:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-13 12:44:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-13 12:44:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 12:44:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,360 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 12:44:46,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:46,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011824842] [2024-11-13 12:44:46,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011824842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:46,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133400910] [2024-11-13 12:44:46,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 12:44:46,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:46,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:46,364 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:46,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 12:44:46,551 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2024-11-13 12:44:46,551 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:44:46,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 12:44:46,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:46,909 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 12:44:46,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:47,491 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 12:44:47,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133400910] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:47,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:44:47,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 26 [2024-11-13 12:44:47,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904192869] [2024-11-13 12:44:47,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:47,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 12:44:47,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:47,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 12:44:47,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2024-11-13 12:44:47,495 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 12:44:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:48,486 INFO L93 Difference]: Finished difference Result 473 states and 522 transitions. [2024-11-13 12:44:48,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-13 12:44:48,486 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 12:44:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:48,490 INFO L225 Difference]: With dead ends: 473 [2024-11-13 12:44:48,490 INFO L226 Difference]: Without dead ends: 464 [2024-11-13 12:44:48,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2024-11-13 12:44:48,491 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 12:44:48,492 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 12:44:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-13 12:44:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 440. [2024-11-13 12:44:48,602 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 12:44:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 465 transitions. [2024-11-13 12:44:48,605 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 465 transitions. Word has length 209 [2024-11-13 12:44:48,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:48,606 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 465 transitions. [2024-11-13 12:44:48,606 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 12:44:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 465 transitions. [2024-11-13 12:44:48,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-11-13 12:44:48,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:48,613 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 12:44:48,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-13 12:44:48,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:48,813 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:48,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:48,814 INFO L85 PathProgramCache]: Analyzing trace with hash 812961646, now seen corresponding path program 4 times [2024-11-13 12:44:48,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:48,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307630800] [2024-11-13 12:44:48,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:48,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 12:44:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 12:44:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 12:44:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:44:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 12:44:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 12:44:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 12:44:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:44:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-13 12:44:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 12:44:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 12:44:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:44:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:44:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 12:44:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 12:44:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 12:44:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:44:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-13 12:44:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 12:44:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 12:44:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 12:44:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-13 12:44:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 12:44:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 12:44:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 12:44:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-13 12:44:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 12:44:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-13 12:44:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-13 12:44:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-13 12:44:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 12:44:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-13 12:44:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-13 12:44:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-13 12:44:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-13 12:44:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 12:44:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-13 12:44:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-13 12:44:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-13 12:44:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-13 12:44:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-13 12:44:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-13 12:44:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-13 12:44:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-13 12:44:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 12:44:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-13 12:44:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-13 12:44:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-11-13 12:44:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2024-11-13 12:44:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2024-11-13 12:44:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-11-13 12:44:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-11-13 12:44:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-11-13 12:44:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-11-13 12:44:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-13 12:44:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-13 12:44:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-13 12:44:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-13 12:44:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-11-13 12:44:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-11-13 12:44:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2024-11-13 12:44:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2024-11-13 12:44:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2024-11-13 12:44:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2024-11-13 12:44:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2024-11-13 12:44:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-11-13 12:44:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2024-11-13 12:44:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:51,453 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 12:44:51,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:51,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307630800] [2024-11-13 12:44:51,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307630800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:51,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646065316] [2024-11-13 12:44:51,454 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 12:44:51,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:51,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:51,457 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:51,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 12:44:51,788 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 12:44:51,788 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:44:51,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-13 12:44:51,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:52,525 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 12:44:52,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:53,890 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 12:44:53,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646065316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:53,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:44:53,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 26] total 50 [2024-11-13 12:44:53,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208754017] [2024-11-13 12:44:53,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:53,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-13 12:44:53,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:53,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-13 12:44:53,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2024-11-13 12:44:53,897 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 12:44:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:56,864 INFO L93 Difference]: Finished difference Result 953 states and 1050 transitions. [2024-11-13 12:44:56,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-11-13 12:44:56,865 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 12:44:56,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:56,873 INFO L225 Difference]: With dead ends: 953 [2024-11-13 12:44:56,874 INFO L226 Difference]: Without dead ends: 944 [2024-11-13 12:44:56,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1078 GetRequests, 985 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2024-11-13 12:44:56,878 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 441 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:56,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 354 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 12:44:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-11-13 12:44:57,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 896. [2024-11-13 12:44:57,080 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 12:44:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 945 transitions. [2024-11-13 12:44:57,086 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 945 transitions. Word has length 437 [2024-11-13 12:44:57,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:57,087 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 945 transitions. [2024-11-13 12:44:57,088 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 12:44:57,088 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 945 transitions. [2024-11-13 12:44:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2024-11-13 12:44:57,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:57,117 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 12:44:57,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 12:44:57,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 12:44:57,321 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:57,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:57,321 INFO L85 PathProgramCache]: Analyzing trace with hash 444243182, now seen corresponding path program 5 times [2024-11-13 12:44:57,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:57,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017809679] [2024-11-13 12:44:57,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:57,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:45:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 12:45:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 12:45:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 12:45:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:45:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 12:45:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 12:45:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 12:45:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:45:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-13 12:45:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 12:45:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 12:45:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:45:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:45:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 12:45:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 12:45:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 12:45:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:45:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-13 12:45:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 12:45:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 12:45:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 12:45:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-13 12:45:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 12:45:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 12:45:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 12:45:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-13 12:45:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 12:45:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-13 12:45:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-13 12:45:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-13 12:45:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 12:45:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-13 12:45:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-13 12:45:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-13 12:45:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-13 12:45:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 12:45:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-13 12:45:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-13 12:45:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-13 12:45:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-13 12:45:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-13 12:45:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-13 12:45:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-13 12:45:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-13 12:45:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 12:45:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-13 12:45:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-13 12:45:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-11-13 12:45:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2024-11-13 12:45:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2024-11-13 12:45:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-11-13 12:45:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-11-13 12:45:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-11-13 12:45:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-11-13 12:45:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-13 12:45:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-13 12:45:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-13 12:45:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-13 12:45:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-11-13 12:45:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-11-13 12:45:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2024-11-13 12:45:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2024-11-13 12:45:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2024-11-13 12:45:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2024-11-13 12:45:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2024-11-13 12:45:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-11-13 12:45:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2024-11-13 12:45:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2024-11-13 12:45:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 438 [2024-11-13 12:45:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2024-11-13 12:45:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2024-11-13 12:45:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2024-11-13 12:45:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 462 [2024-11-13 12:45:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 471 [2024-11-13 12:45:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 476 [2024-11-13 12:45:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 481 [2024-11-13 12:45:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 490 [2024-11-13 12:45:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 495 [2024-11-13 12:45:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2024-11-13 12:45:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2024-11-13 12:45:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2024-11-13 12:45:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 519 [2024-11-13 12:45:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 528 [2024-11-13 12:45:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2024-11-13 12:45:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 538 [2024-11-13 12:45:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2024-11-13 12:45:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2024-11-13 12:45:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 557 [2024-11-13 12:45:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 566 [2024-11-13 12:45:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 571 [2024-11-13 12:45:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 576 [2024-11-13 12:45:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 585 [2024-11-13 12:45:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 590 [2024-11-13 12:45:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 595 [2024-11-13 12:45:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 604 [2024-11-13 12:45:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 609 [2024-11-13 12:45:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 614 [2024-11-13 12:45:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2024-11-13 12:45:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 628 [2024-11-13 12:45:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 633 [2024-11-13 12:45:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 642 [2024-11-13 12:45:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 647 [2024-11-13 12:45:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 652 [2024-11-13 12:45:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 661 [2024-11-13 12:45:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 666 [2024-11-13 12:45:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 671 [2024-11-13 12:45:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 680 [2024-11-13 12:45:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 685 [2024-11-13 12:45:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 690 [2024-11-13 12:45:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 699 [2024-11-13 12:45:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 704 [2024-11-13 12:45:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 709 [2024-11-13 12:45:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 718 [2024-11-13 12:45:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 723 [2024-11-13 12:45:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 728 [2024-11-13 12:45:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 737 [2024-11-13 12:45:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 742 [2024-11-13 12:45:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 747 [2024-11-13 12:45:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2024-11-13 12:45:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 761 [2024-11-13 12:45:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 766 [2024-11-13 12:45:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 775 [2024-11-13 12:45:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 780 [2024-11-13 12:45:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 785 [2024-11-13 12:45:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 794 [2024-11-13 12:45:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 799 [2024-11-13 12:45:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 804 [2024-11-13 12:45:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 813 [2024-11-13 12:45:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 818 [2024-11-13 12:45:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 823 [2024-11-13 12:45:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 832 [2024-11-13 12:45:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 837 [2024-11-13 12:45:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 842 [2024-11-13 12:45:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 851 [2024-11-13 12:45:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 856 [2024-11-13 12:45:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 861 [2024-11-13 12:45:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 870 [2024-11-13 12:45:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 875 [2024-11-13 12:45:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 880 [2024-11-13 12:45:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:04,953 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 12:45:04,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:04,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017809679] [2024-11-13 12:45:04,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017809679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:04,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83289533] [2024-11-13 12:45:04,954 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 12:45:04,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:04,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:04,956 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:04,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 12:46:46,236 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2024-11-13 12:46:46,236 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:46:46,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-13 12:46:46,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:46:47,487 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 12:46:47,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:46:51,497 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 12:46:51,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83289533] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:46:51,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:46:51,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 50] total 98 [2024-11-13 12:46:51,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797634053] [2024-11-13 12:46:51,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:46:51,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2024-11-13 12:46:51,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:46:51,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2024-11-13 12:46:51,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2024-11-13 12:46:51,509 INFO L87 Difference]: Start difference. First operand 896 states and 945 transitions. Second operand has 98 states, 98 states have (on average 5.387755102040816) internal successors, (528), 98 states have internal predecessors, (528), 95 states have call successors, (421), 49 states have call predecessors, (421), 48 states have return successors, (420), 94 states have call predecessors, (420), 94 states have call successors, (420) [2024-11-13 12:46:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:46:59,999 INFO L93 Difference]: Finished difference Result 1913 states and 2106 transitions. [2024-11-13 12:46:59,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2024-11-13 12:47:00,000 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 5.387755102040816) internal successors, (528), 98 states have internal predecessors, (528), 95 states have call successors, (421), 49 states have call predecessors, (421), 48 states have return successors, (420), 94 states have call predecessors, (420), 94 states have call successors, (420) Word has length 893 [2024-11-13 12:47:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:47:00,015 INFO L225 Difference]: With dead ends: 1913 [2024-11-13 12:47:00,015 INFO L226 Difference]: Without dead ends: 1904 [2024-11-13 12:47:00,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2206 GetRequests, 2017 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2024-11-13 12:47:00,025 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1060 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:47:00,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 642 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 12:47:00,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2024-11-13 12:47:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1808. [2024-11-13 12:47:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1236 states have (on average 1.0784789644012944) internal successors, (1333), 1238 states have internal predecessors, (1333), 287 states have call successors, (287), 284 states have call predecessors, (287), 284 states have return successors, (285), 285 states have call predecessors, (285), 285 states have call successors, (285) [2024-11-13 12:47:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 1905 transitions. [2024-11-13 12:47:00,453 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 1905 transitions. Word has length 893 [2024-11-13 12:47:00,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:47:00,455 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 1905 transitions. [2024-11-13 12:47:00,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 5.387755102040816) internal successors, (528), 98 states have internal predecessors, (528), 95 states have call successors, (421), 49 states have call predecessors, (421), 48 states have return successors, (420), 94 states have call predecessors, (420), 94 states have call successors, (420) [2024-11-13 12:47:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 1905 transitions. [2024-11-13 12:47:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1806 [2024-11-13 12:47:00,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:47:00,528 INFO L215 NwaCegarLoop]: trace histogram [283, 282, 282, 95, 94, 94, 94, 94, 94, 94, 94, 94, 94, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:47:00,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-13 12:47:00,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 12:47:00,729 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:47:00,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:47:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1639561198, now seen corresponding path program 6 times [2024-11-13 12:47:00,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:47:00,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061041439] [2024-11-13 12:47:00,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:47:00,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:47:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:47:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 12:47:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 12:47:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 12:47:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:47:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 12:47:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 12:47:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 12:47:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 12:47:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-13 12:47:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 12:47:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 12:47:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 12:47:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 12:47:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 12:47:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 12:47:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 12:47:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 12:47:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-13 12:47:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 12:47:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 12:47:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 12:47:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-13 12:47:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-13 12:47:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 12:47:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-13 12:47:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-13 12:47:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 12:47:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-13 12:47:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-13 12:47:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-13 12:47:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-13 12:47:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-13 12:47:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-13 12:47:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-13 12:47:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-13 12:47:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-13 12:47:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-13 12:47:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-13 12:47:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-13 12:47:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-13 12:47:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-13 12:47:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-13 12:47:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-13 12:47:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-13 12:47:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-13 12:47:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-13 12:47:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-13 12:47:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-11-13 12:47:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2024-11-13 12:47:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2024-11-13 12:47:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-11-13 12:47:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-11-13 12:47:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-11-13 12:47:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-11-13 12:47:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-13 12:47:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-13 12:47:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-13 12:47:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-13 12:47:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-11-13 12:47:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-11-13 12:47:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2024-11-13 12:47:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2024-11-13 12:47:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2024-11-13 12:47:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2024-11-13 12:47:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2024-11-13 12:47:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-11-13 12:47:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2024-11-13 12:47:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2024-11-13 12:47:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 438 [2024-11-13 12:47:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2024-11-13 12:47:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2024-11-13 12:47:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2024-11-13 12:47:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 462 [2024-11-13 12:47:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 471 [2024-11-13 12:47:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 476 [2024-11-13 12:47:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 481 [2024-11-13 12:47:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 490 [2024-11-13 12:47:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 495 [2024-11-13 12:47:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2024-11-13 12:47:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2024-11-13 12:47:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2024-11-13 12:47:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 519 [2024-11-13 12:47:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 528 [2024-11-13 12:47:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2024-11-13 12:47:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 538 [2024-11-13 12:47:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2024-11-13 12:47:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2024-11-13 12:47:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 557 [2024-11-13 12:47:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 566 [2024-11-13 12:47:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 571 [2024-11-13 12:47:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 576 [2024-11-13 12:47:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 585 [2024-11-13 12:47:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 590 [2024-11-13 12:47:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 595 [2024-11-13 12:47:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 604 [2024-11-13 12:47:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 609 [2024-11-13 12:47:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 614 [2024-11-13 12:47:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2024-11-13 12:47:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 628 [2024-11-13 12:47:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 633 [2024-11-13 12:47:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 642 [2024-11-13 12:47:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 647 [2024-11-13 12:47:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 652 [2024-11-13 12:47:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 661 [2024-11-13 12:47:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 666 [2024-11-13 12:47:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 671 [2024-11-13 12:47:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 680 [2024-11-13 12:47:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 685 [2024-11-13 12:47:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 690 [2024-11-13 12:47:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 699 [2024-11-13 12:47:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 704 [2024-11-13 12:47:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 709 [2024-11-13 12:47:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 718 [2024-11-13 12:47:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 723 [2024-11-13 12:47:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 728 [2024-11-13 12:47:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 737 [2024-11-13 12:47:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 742 [2024-11-13 12:47:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 747 [2024-11-13 12:47:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2024-11-13 12:47:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 761 [2024-11-13 12:47:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 766 [2024-11-13 12:47:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 775 [2024-11-13 12:47:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 780 [2024-11-13 12:47:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 785 [2024-11-13 12:47:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 794 [2024-11-13 12:47:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 799 [2024-11-13 12:47:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 804 [2024-11-13 12:47:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 813 [2024-11-13 12:47:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 818 [2024-11-13 12:47:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 823 [2024-11-13 12:47:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 832 [2024-11-13 12:47:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 837 [2024-11-13 12:47:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 842 [2024-11-13 12:47:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 851 [2024-11-13 12:47:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 856 [2024-11-13 12:47:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 861 [2024-11-13 12:47:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 870 [2024-11-13 12:47:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 875 [2024-11-13 12:47:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 880 [2024-11-13 12:47:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 889 [2024-11-13 12:47:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 894 [2024-11-13 12:47:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 899 [2024-11-13 12:47:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 908 [2024-11-13 12:47:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 913 [2024-11-13 12:47:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 918 [2024-11-13 12:47:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 927 [2024-11-13 12:47:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 932 [2024-11-13 12:47:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 937 [2024-11-13 12:47:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 946 [2024-11-13 12:47:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 951 [2024-11-13 12:47:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 956 [2024-11-13 12:47:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 965 [2024-11-13 12:47:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 970 [2024-11-13 12:47:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 975 [2024-11-13 12:47:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 984 [2024-11-13 12:47:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 989 [2024-11-13 12:47:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 994 [2024-11-13 12:47:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1003 [2024-11-13 12:47:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1008 [2024-11-13 12:47:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1013 [2024-11-13 12:47:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1022 [2024-11-13 12:47:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1027 [2024-11-13 12:47:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1032 [2024-11-13 12:47:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1041 [2024-11-13 12:47:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1046 [2024-11-13 12:47:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1051 [2024-11-13 12:47:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1060 [2024-11-13 12:47:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1065 [2024-11-13 12:47:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1070 [2024-11-13 12:47:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1079 [2024-11-13 12:47:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1084 [2024-11-13 12:47:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1089 [2024-11-13 12:47:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1098 [2024-11-13 12:47:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1103 [2024-11-13 12:47:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1108 [2024-11-13 12:47:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1117 [2024-11-13 12:47:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1122 [2024-11-13 12:47:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1127 [2024-11-13 12:47:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1136 [2024-11-13 12:47:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1141 [2024-11-13 12:47:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1146 [2024-11-13 12:47:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1155 [2024-11-13 12:47:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1160 [2024-11-13 12:47:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1165 [2024-11-13 12:47:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1174 [2024-11-13 12:47:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1179 [2024-11-13 12:47:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1184 [2024-11-13 12:47:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1193 [2024-11-13 12:47:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1198 [2024-11-13 12:47:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1203 [2024-11-13 12:47:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1212 [2024-11-13 12:47:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1217 [2024-11-13 12:47:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1222 [2024-11-13 12:47:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1231 [2024-11-13 12:47:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1236 [2024-11-13 12:47:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1241 [2024-11-13 12:47:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1250 [2024-11-13 12:47:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1255 [2024-11-13 12:47:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1260 [2024-11-13 12:47:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1269 [2024-11-13 12:47:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1274 [2024-11-13 12:47:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1279 [2024-11-13 12:47:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1288 [2024-11-13 12:47:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1293 [2024-11-13 12:47:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1298 [2024-11-13 12:47:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1307 [2024-11-13 12:47:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1312 [2024-11-13 12:47:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1317 [2024-11-13 12:47:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1326 [2024-11-13 12:47:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1331 [2024-11-13 12:47:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1336 [2024-11-13 12:47:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1345 [2024-11-13 12:47:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1350 [2024-11-13 12:47:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1355 [2024-11-13 12:47:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1364 [2024-11-13 12:47:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1369 [2024-11-13 12:47:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1374 [2024-11-13 12:47:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1383 [2024-11-13 12:47:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1388 [2024-11-13 12:47:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1393 [2024-11-13 12:47:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1402 [2024-11-13 12:47:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1407 [2024-11-13 12:47:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1412 [2024-11-13 12:47:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1421 [2024-11-13 12:47:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1426 [2024-11-13 12:47:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1431 [2024-11-13 12:47:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1440 [2024-11-13 12:47:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1445 [2024-11-13 12:47:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1450 [2024-11-13 12:47:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1459 [2024-11-13 12:47:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1464 [2024-11-13 12:47:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1469 [2024-11-13 12:47:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1478 [2024-11-13 12:47:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1483 [2024-11-13 12:47:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1488 [2024-11-13 12:47:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1497 [2024-11-13 12:47:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1502 [2024-11-13 12:47:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1507 [2024-11-13 12:47:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1516 [2024-11-13 12:47:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1521 [2024-11-13 12:47:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1526 [2024-11-13 12:47:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1535 [2024-11-13 12:47:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1540 [2024-11-13 12:47:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1545 [2024-11-13 12:47:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1554 [2024-11-13 12:47:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1559 [2024-11-13 12:47:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1564 [2024-11-13 12:47:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1573 [2024-11-13 12:47:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1578 [2024-11-13 12:47:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1583 [2024-11-13 12:47:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1592 [2024-11-13 12:47:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1597 [2024-11-13 12:47:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1602 [2024-11-13 12:47:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1611 [2024-11-13 12:47:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1616 [2024-11-13 12:47:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1621 [2024-11-13 12:47:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1630 [2024-11-13 12:47:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1635 [2024-11-13 12:47:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1640 [2024-11-13 12:47:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1649 [2024-11-13 12:47:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1654 [2024-11-13 12:47:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1659 [2024-11-13 12:47:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1668 [2024-11-13 12:47:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1673 [2024-11-13 12:47:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1678 [2024-11-13 12:47:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1687 [2024-11-13 12:47:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1692 [2024-11-13 12:47:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1697 [2024-11-13 12:47:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1706 [2024-11-13 12:47:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1711 [2024-11-13 12:47:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1716 [2024-11-13 12:47:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1725 [2024-11-13 12:47:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1730 [2024-11-13 12:47:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1735 [2024-11-13 12:47:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1744 [2024-11-13 12:47:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1749 [2024-11-13 12:47:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1754 [2024-11-13 12:47:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1763 [2024-11-13 12:47:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1768 [2024-11-13 12:47:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1773 [2024-11-13 12:47:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1782 [2024-11-13 12:47:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1787 [2024-11-13 12:47:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1792 [2024-11-13 12:47:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 189837 backedges. 564 proven. 30785 refuted. 0 times theorem prover too weak. 158488 trivial. 0 not checked. [2024-11-13 12:47:29,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:47:29,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061041439] [2024-11-13 12:47:29,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061041439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:47:29,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833461265] [2024-11-13 12:47:29,227 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-13 12:47:29,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:47:29,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:47:29,230 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:47:29,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 12:48:54,486 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 179 check-sat command(s) [2024-11-13 12:48:54,486 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:48:54,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 3822 conjuncts, 191 conjuncts are in the unsatisfiable core [2024-11-13 12:48:54,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:48:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 189837 backedges. 564 proven. 188141 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2024-11-13 12:48:56,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:49:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 189837 backedges. 564 proven. 30785 refuted. 0 times theorem prover too weak. 158488 trivial. 0 not checked. [2024-11-13 12:49:04,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833461265] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:49:04,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:49:04,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 97, 98] total 104 [2024-11-13 12:49:04,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323919617] [2024-11-13 12:49:04,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:49:04,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2024-11-13 12:49:04,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:49:04,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2024-11-13 12:49:04,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2024-11-13 12:49:04,212 INFO L87 Difference]: Start difference. First operand 1808 states and 1905 transitions. Second operand has 104 states, 104 states have (on average 6.730769230769231) internal successors, (700), 104 states have internal predecessors, (700), 101 states have call successors, (586), 97 states have call predecessors, (586), 96 states have return successors, (585), 100 states have call predecessors, (585), 100 states have call successors, (585) [2024-11-13 12:49:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:49:13,477 INFO L93 Difference]: Finished difference Result 1943 states and 2058 transitions. [2024-11-13 12:49:13,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2024-11-13 12:49:13,478 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 6.730769230769231) internal successors, (700), 104 states have internal predecessors, (700), 101 states have call successors, (586), 97 states have call predecessors, (586), 96 states have return successors, (585), 100 states have call predecessors, (585), 100 states have call successors, (585) Word has length 1805 [2024-11-13 12:49:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:49:13,495 INFO L225 Difference]: With dead ends: 1943 [2024-11-13 12:49:13,495 INFO L226 Difference]: Without dead ends: 1934 [2024-11-13 12:49:13,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4372 GetRequests, 4081 SyntacticMatches, 90 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9505 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2024-11-13 12:49:13,504 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 461 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:49:13,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 710 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 12:49:13,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2024-11-13 12:49:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1922. [2024-11-13 12:49:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1314 states have (on average 1.078386605783866) internal successors, (1417), 1316 states have internal predecessors, (1417), 305 states have call successors, (305), 302 states have call predecessors, (305), 302 states have return successors, (303), 303 states have call predecessors, (303), 303 states have call successors, (303) [2024-11-13 12:49:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2025 transitions. [2024-11-13 12:49:14,074 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2025 transitions. Word has length 1805 [2024-11-13 12:49:14,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:49:14,078 INFO L471 AbstractCegarLoop]: Abstraction has 1922 states and 2025 transitions. [2024-11-13 12:49:14,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 6.730769230769231) internal successors, (700), 104 states have internal predecessors, (700), 101 states have call successors, (586), 97 states have call predecessors, (586), 96 states have return successors, (585), 100 states have call predecessors, (585), 100 states have call successors, (585) [2024-11-13 12:49:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2025 transitions. [2024-11-13 12:49:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1920 [2024-11-13 12:49:14,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:49:14,109 INFO L215 NwaCegarLoop]: trace histogram [301, 300, 300, 101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:49:14,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 12:49:14,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 12:49:14,309 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:49:14,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:49:14,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1829465934, now seen corresponding path program 7 times [2024-11-13 12:49:14,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:49:14,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553985987] [2024-11-13 12:49:14,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:49:14,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:49:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 12:49:15,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1802684879] [2024-11-13 12:49:15,940 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-13 12:49:15,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:49:15,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:49:15,942 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:49:15,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 12:49:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:49:17,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:49:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:49:18,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:49:18,569 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 12:49:18,570 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 12:49:18,594 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-13 12:49:18,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:49:18,775 INFO L407 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:49:19,135 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:49:19,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:49:19 BoogieIcfgContainer [2024-11-13 12:49:19,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:49:19,140 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:49:19,140 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:49:19,140 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:49:19,142 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:28" (3/4) ... [2024-11-13 12:49:19,143 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 12:49:19,677 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 12:49:19,678 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:49:19,679 INFO L158 Benchmark]: Toolchain (without parser) took 292039.74ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 119.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-13 12:49:19,679 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 142.6MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:49:19,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.17ms. Allocated memory is still 142.6MB. Free memory was 119.3MB in the beginning and 108.1MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:49:19,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.46ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 106.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:49:19,681 INFO L158 Benchmark]: Boogie Preprocessor took 68.29ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 105.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:49:19,681 INFO L158 Benchmark]: RCFGBuilder took 454.08ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.3MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 12:49:19,681 INFO L158 Benchmark]: TraceAbstraction took 290655.43ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 93.6MB in the beginning and 678.1MB in the end (delta: -584.5MB). Peak memory consumption was 982.4MB. Max. memory is 16.1GB. [2024-11-13 12:49:19,682 INFO L158 Benchmark]: Witness Printer took 537.89ms. Allocated memory is still 1.7GB. Free memory was 678.1MB in the beginning and 1.6GB in the end (delta: -927.2MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2024-11-13 12:49:19,686 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.38ms. Allocated memory is still 142.6MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.17ms. Allocated memory is still 142.6MB. Free memory was 119.3MB in the beginning and 108.1MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.46ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 106.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.29ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 105.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 454.08ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.3MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 290655.43ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 93.6MB in the beginning and 678.1MB in the end (delta: -584.5MB). Peak memory consumption was 982.4MB. Max. memory is 16.1GB. * Witness Printer took 537.89ms. Allocated memory is still 1.7GB. Free memory was 678.1MB in the beginning and 1.6GB in the end (delta: -927.2MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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=102, 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=102, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=102, b=1, counter=0, p=1, q=0, r=0, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=102, b=1, counter=1, p=1, q=0, r=0, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=102, b=1, counter=1, p=1, q=0, r=0, s=1, x=102, 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=102, b=1, counter=1, p=1, q=0, r=0, s=1, x=102, 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=102, b=1, counter=1, p=1, q=0, r=0, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=102, b=1, counter=1, p=1, q=0, r=0, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=101, b=1, counter=1, p=1, q=0, r=-1, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=101, b=1, counter=2, p=1, q=0, r=-1, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=101, b=1, counter=2, p=1, q=0, r=-1, s=1, x=102, 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=101, b=1, counter=2, p=1, q=0, r=-1, s=1, x=102, 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=101, b=1, counter=2, p=1, q=0, r=-1, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=101, b=1, counter=2, p=1, q=0, r=-1, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=100, b=1, counter=2, p=1, q=0, r=-2, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=100, b=1, counter=3, p=1, q=0, r=-2, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=100, b=1, counter=3, p=1, q=0, r=-2, s=1, x=102, 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=100, b=1, counter=3, p=1, q=0, r=-2, s=1, x=102, 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=100, b=1, counter=3, p=1, q=0, r=-2, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=100, b=1, counter=3, p=1, q=0, r=-2, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=99, b=1, counter=3, p=1, q=0, r=-3, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=99, b=1, counter=4, p=1, q=0, r=-3, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=99, b=1, counter=4, p=1, q=0, r=-3, s=1, x=102, 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=99, b=1, counter=4, p=1, q=0, r=-3, s=1, x=102, 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=99, b=1, counter=4, p=1, q=0, r=-3, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=99, b=1, counter=4, p=1, q=0, r=-3, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=98, b=1, counter=4, p=1, q=0, r=-4, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=98, b=1, counter=5, p=1, q=0, r=-4, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=98, b=1, counter=5, p=1, q=0, r=-4, s=1, x=102, 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=98, b=1, counter=5, p=1, q=0, r=-4, s=1, x=102, 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=98, b=1, counter=5, p=1, q=0, r=-4, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=98, b=1, counter=5, p=1, q=0, r=-4, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=97, b=1, counter=5, p=1, q=0, r=-5, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=97, b=1, counter=6, p=1, q=0, r=-5, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=97, b=1, counter=6, p=1, q=0, r=-5, s=1, x=102, 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=97, b=1, counter=6, p=1, q=0, r=-5, s=1, x=102, 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=97, b=1, counter=6, p=1, q=0, r=-5, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=97, b=1, counter=6, p=1, q=0, r=-5, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=96, b=1, counter=6, p=1, q=0, r=-6, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=96, b=1, counter=7, p=1, q=0, r=-6, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=96, b=1, counter=7, p=1, q=0, r=-6, s=1, x=102, 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=96, b=1, counter=7, p=1, q=0, r=-6, s=1, x=102, 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=96, b=1, counter=7, p=1, q=0, r=-6, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=96, b=1, counter=7, p=1, q=0, r=-6, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=95, b=1, counter=7, p=1, q=0, r=-7, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=95, b=1, counter=8, p=1, q=0, r=-7, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=95, b=1, counter=8, p=1, q=0, r=-7, s=1, x=102, 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=95, b=1, counter=8, p=1, q=0, r=-7, s=1, x=102, 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=95, b=1, counter=8, p=1, q=0, r=-7, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=95, b=1, counter=8, p=1, q=0, r=-7, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=94, b=1, counter=8, p=1, q=0, r=-8, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=94, b=1, counter=9, p=1, q=0, r=-8, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=94, b=1, counter=9, p=1, q=0, r=-8, s=1, x=102, 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=94, b=1, counter=9, p=1, q=0, r=-8, s=1, x=102, 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=94, b=1, counter=9, p=1, q=0, r=-8, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=94, b=1, counter=9, p=1, q=0, r=-8, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=93, b=1, counter=9, p=1, q=0, r=-9, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=93, b=1, counter=10, p=1, q=0, r=-9, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=93, b=1, counter=10, p=1, q=0, r=-9, s=1, x=102, 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=93, b=1, counter=10, p=1, q=0, r=-9, s=1, x=102, 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=93, b=1, counter=10, p=1, q=0, r=-9, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=93, b=1, counter=10, p=1, q=0, r=-9, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=92, b=1, counter=10, p=1, q=0, r=-10, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=92, b=1, counter=11, p=1, q=0, r=-10, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=92, b=1, counter=11, p=1, q=0, r=-10, s=1, x=102, 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=92, b=1, counter=11, p=1, q=0, r=-10, s=1, x=102, 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=92, b=1, counter=11, p=1, q=0, r=-10, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=92, b=1, counter=11, p=1, q=0, r=-10, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=91, b=1, counter=11, p=1, q=0, r=-11, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=91, b=1, counter=12, p=1, q=0, r=-11, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=91, b=1, counter=12, p=1, q=0, r=-11, s=1, x=102, 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=91, b=1, counter=12, p=1, q=0, r=-11, s=1, x=102, 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=91, b=1, counter=12, p=1, q=0, r=-11, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=91, b=1, counter=12, p=1, q=0, r=-11, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=90, b=1, counter=12, p=1, q=0, r=-12, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=90, b=1, counter=13, p=1, q=0, r=-12, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=90, b=1, counter=13, p=1, q=0, r=-12, s=1, x=102, 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=90, b=1, counter=13, p=1, q=0, r=-12, s=1, x=102, 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=90, b=1, counter=13, p=1, q=0, r=-12, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=90, b=1, counter=13, p=1, q=0, r=-12, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=89, b=1, counter=13, p=1, q=0, r=-13, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=89, b=1, counter=14, p=1, q=0, r=-13, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=89, b=1, counter=14, p=1, q=0, r=-13, s=1, x=102, 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=89, b=1, counter=14, p=1, q=0, r=-13, s=1, x=102, 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=89, b=1, counter=14, p=1, q=0, r=-13, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=89, b=1, counter=14, p=1, q=0, r=-13, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=88, b=1, counter=14, p=1, q=0, r=-14, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=88, b=1, counter=15, p=1, q=0, r=-14, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=88, b=1, counter=15, p=1, q=0, r=-14, s=1, x=102, 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=88, b=1, counter=15, p=1, q=0, r=-14, s=1, x=102, 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=88, b=1, counter=15, p=1, q=0, r=-14, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=88, b=1, counter=15, p=1, q=0, r=-14, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=87, b=1, counter=15, p=1, q=0, r=-15, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=87, b=1, counter=16, p=1, q=0, r=-15, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=87, b=1, counter=16, p=1, q=0, r=-15, s=1, x=102, 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=87, b=1, counter=16, p=1, q=0, r=-15, s=1, x=102, 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=87, b=1, counter=16, p=1, q=0, r=-15, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=87, b=1, counter=16, p=1, q=0, r=-15, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=86, b=1, counter=16, p=1, q=0, r=-16, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=86, b=1, counter=17, p=1, q=0, r=-16, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=86, b=1, counter=17, p=1, q=0, r=-16, s=1, x=102, 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=86, b=1, counter=17, p=1, q=0, r=-16, s=1, x=102, 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=86, b=1, counter=17, p=1, q=0, r=-16, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=86, b=1, counter=17, p=1, q=0, r=-16, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=85, b=1, counter=17, p=1, q=0, r=-17, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=85, b=1, counter=18, p=1, q=0, r=-17, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=85, b=1, counter=18, p=1, q=0, r=-17, s=1, x=102, 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=85, b=1, counter=18, p=1, q=0, r=-17, s=1, x=102, 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=85, b=1, counter=18, p=1, q=0, r=-17, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=85, b=1, counter=18, p=1, q=0, r=-17, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=84, b=1, counter=18, p=1, q=0, r=-18, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=84, b=1, counter=19, p=1, q=0, r=-18, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=84, b=1, counter=19, p=1, q=0, r=-18, s=1, x=102, 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=84, b=1, counter=19, p=1, q=0, r=-18, s=1, x=102, 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=84, b=1, counter=19, p=1, q=0, r=-18, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=84, b=1, counter=19, p=1, q=0, r=-18, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=83, b=1, counter=19, p=1, q=0, r=-19, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=83, b=1, counter=20, p=1, q=0, r=-19, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=83, b=1, counter=20, p=1, q=0, r=-19, s=1, x=102, 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=83, b=1, counter=20, p=1, q=0, r=-19, s=1, x=102, 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=83, b=1, counter=20, p=1, q=0, r=-19, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=83, b=1, counter=20, p=1, q=0, r=-19, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=82, b=1, counter=20, p=1, q=0, r=-20, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=82, b=1, counter=21, p=1, q=0, r=-20, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=82, b=1, counter=21, p=1, q=0, r=-20, s=1, x=102, 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=82, b=1, counter=21, p=1, q=0, r=-20, s=1, x=102, 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=82, b=1, counter=21, p=1, q=0, r=-20, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=82, b=1, counter=21, p=1, q=0, r=-20, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=81, b=1, counter=21, p=1, q=0, r=-21, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=81, b=1, counter=22, p=1, q=0, r=-21, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=81, b=1, counter=22, p=1, q=0, r=-21, s=1, x=102, 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=81, b=1, counter=22, p=1, q=0, r=-21, s=1, x=102, 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=81, b=1, counter=22, p=1, q=0, r=-21, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=81, b=1, counter=22, p=1, q=0, r=-21, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=80, b=1, counter=22, p=1, q=0, r=-22, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=80, b=1, counter=23, p=1, q=0, r=-22, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=80, b=1, counter=23, p=1, q=0, r=-22, s=1, x=102, 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=80, b=1, counter=23, p=1, q=0, r=-22, s=1, x=102, 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=80, b=1, counter=23, p=1, q=0, r=-22, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=80, b=1, counter=23, p=1, q=0, r=-22, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=79, b=1, counter=23, p=1, q=0, r=-23, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=79, b=1, counter=24, p=1, q=0, r=-23, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=79, b=1, counter=24, p=1, q=0, r=-23, s=1, x=102, 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=79, b=1, counter=24, p=1, q=0, r=-23, s=1, x=102, 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=79, b=1, counter=24, p=1, q=0, r=-23, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=79, b=1, counter=24, p=1, q=0, r=-23, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=78, b=1, counter=24, p=1, q=0, r=-24, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=78, b=1, counter=25, p=1, q=0, r=-24, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=78, b=1, counter=25, p=1, q=0, r=-24, s=1, x=102, 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=78, b=1, counter=25, p=1, q=0, r=-24, s=1, x=102, 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=78, b=1, counter=25, p=1, q=0, r=-24, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=78, b=1, counter=25, p=1, q=0, r=-24, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=77, b=1, counter=25, p=1, q=0, r=-25, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=77, b=1, counter=26, p=1, q=0, r=-25, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=77, b=1, counter=26, p=1, q=0, r=-25, s=1, x=102, 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=77, b=1, counter=26, p=1, q=0, r=-25, s=1, x=102, 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=77, b=1, counter=26, p=1, q=0, r=-25, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=77, b=1, counter=26, p=1, q=0, r=-25, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=76, b=1, counter=26, p=1, q=0, r=-26, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=76, b=1, counter=27, p=1, q=0, r=-26, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=76, b=1, counter=27, p=1, q=0, r=-26, s=1, x=102, 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=76, b=1, counter=27, p=1, q=0, r=-26, s=1, x=102, 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=76, b=1, counter=27, p=1, q=0, r=-26, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=76, b=1, counter=27, p=1, q=0, r=-26, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=75, b=1, counter=27, p=1, q=0, r=-27, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=75, b=1, counter=28, p=1, q=0, r=-27, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=75, b=1, counter=28, p=1, q=0, r=-27, s=1, x=102, 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=75, b=1, counter=28, p=1, q=0, r=-27, s=1, x=102, 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=75, b=1, counter=28, p=1, q=0, r=-27, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=75, b=1, counter=28, p=1, q=0, r=-27, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=74, b=1, counter=28, p=1, q=0, r=-28, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=74, b=1, counter=29, p=1, q=0, r=-28, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=74, b=1, counter=29, p=1, q=0, r=-28, s=1, x=102, 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=74, b=1, counter=29, p=1, q=0, r=-28, s=1, x=102, 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=74, b=1, counter=29, p=1, q=0, r=-28, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=74, b=1, counter=29, p=1, q=0, r=-28, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=73, b=1, counter=29, p=1, q=0, r=-29, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=73, b=1, counter=30, p=1, q=0, r=-29, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=73, b=1, counter=30, p=1, q=0, r=-29, s=1, x=102, 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=73, b=1, counter=30, p=1, q=0, r=-29, s=1, x=102, 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=73, b=1, counter=30, p=1, q=0, r=-29, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=73, b=1, counter=30, p=1, q=0, r=-29, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=72, b=1, counter=30, p=1, q=0, r=-30, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=72, b=1, counter=31, p=1, q=0, r=-30, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=72, b=1, counter=31, p=1, q=0, r=-30, s=1, x=102, 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=72, b=1, counter=31, p=1, q=0, r=-30, s=1, x=102, 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=72, b=1, counter=31, p=1, q=0, r=-30, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=72, b=1, counter=31, p=1, q=0, r=-30, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=71, b=1, counter=31, p=1, q=0, r=-31, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=71, b=1, counter=32, p=1, q=0, r=-31, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=71, b=1, counter=32, p=1, q=0, r=-31, s=1, x=102, 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=71, b=1, counter=32, p=1, q=0, r=-31, s=1, x=102, 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=71, b=1, counter=32, p=1, q=0, r=-31, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=71, b=1, counter=32, p=1, q=0, r=-31, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=70, b=1, counter=32, p=1, q=0, r=-32, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=70, b=1, counter=33, p=1, q=0, r=-32, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=70, b=1, counter=33, p=1, q=0, r=-32, s=1, x=102, 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=70, b=1, counter=33, p=1, q=0, r=-32, s=1, x=102, 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=70, b=1, counter=33, p=1, q=0, r=-32, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=70, b=1, counter=33, p=1, q=0, r=-32, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=69, b=1, counter=33, p=1, q=0, r=-33, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=69, b=1, counter=34, p=1, q=0, r=-33, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=69, b=1, counter=34, p=1, q=0, r=-33, s=1, x=102, 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=69, b=1, counter=34, p=1, q=0, r=-33, s=1, x=102, 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=69, b=1, counter=34, p=1, q=0, r=-33, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=69, b=1, counter=34, p=1, q=0, r=-33, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=68, b=1, counter=34, p=1, q=0, r=-34, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=68, b=1, counter=35, p=1, q=0, r=-34, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=68, b=1, counter=35, p=1, q=0, r=-34, s=1, x=102, 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=68, b=1, counter=35, p=1, q=0, r=-34, s=1, x=102, 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=68, b=1, counter=35, p=1, q=0, r=-34, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=68, b=1, counter=35, p=1, q=0, r=-34, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=67, b=1, counter=35, p=1, q=0, r=-35, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=67, b=1, counter=36, p=1, q=0, r=-35, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=67, b=1, counter=36, p=1, q=0, r=-35, s=1, x=102, 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=67, b=1, counter=36, p=1, q=0, r=-35, s=1, x=102, 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=67, b=1, counter=36, p=1, q=0, r=-35, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=67, b=1, counter=36, p=1, q=0, r=-35, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=66, b=1, counter=36, p=1, q=0, r=-36, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=66, b=1, counter=37, p=1, q=0, r=-36, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=66, b=1, counter=37, p=1, q=0, r=-36, s=1, x=102, 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=66, b=1, counter=37, p=1, q=0, r=-36, s=1, x=102, 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=66, b=1, counter=37, p=1, q=0, r=-36, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=66, b=1, counter=37, p=1, q=0, r=-36, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=65, b=1, counter=37, p=1, q=0, r=-37, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=65, b=1, counter=38, p=1, q=0, r=-37, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=65, b=1, counter=38, p=1, q=0, r=-37, s=1, x=102, 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=65, b=1, counter=38, p=1, q=0, r=-37, s=1, x=102, 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=65, b=1, counter=38, p=1, q=0, r=-37, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=65, b=1, counter=38, p=1, q=0, r=-37, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=64, b=1, counter=38, p=1, q=0, r=-38, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=64, b=1, counter=39, p=1, q=0, r=-38, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=64, b=1, counter=39, p=1, q=0, r=-38, s=1, x=102, 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=64, b=1, counter=39, p=1, q=0, r=-38, s=1, x=102, 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=64, b=1, counter=39, p=1, q=0, r=-38, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=64, b=1, counter=39, p=1, q=0, r=-38, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=63, b=1, counter=39, p=1, q=0, r=-39, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=63, b=1, counter=40, p=1, q=0, r=-39, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=63, b=1, counter=40, p=1, q=0, r=-39, s=1, x=102, 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=63, b=1, counter=40, p=1, q=0, r=-39, s=1, x=102, 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=63, b=1, counter=40, p=1, q=0, r=-39, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=63, b=1, counter=40, p=1, q=0, r=-39, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=62, b=1, counter=40, p=1, q=0, r=-40, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=62, b=1, counter=41, p=1, q=0, r=-40, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=62, b=1, counter=41, p=1, q=0, r=-40, s=1, x=102, 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=62, b=1, counter=41, p=1, q=0, r=-40, s=1, x=102, 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=62, b=1, counter=41, p=1, q=0, r=-40, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=62, b=1, counter=41, p=1, q=0, r=-40, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=61, b=1, counter=41, p=1, q=0, r=-41, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=61, b=1, counter=42, p=1, q=0, r=-41, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=61, b=1, counter=42, p=1, q=0, r=-41, s=1, x=102, 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=61, b=1, counter=42, p=1, q=0, r=-41, s=1, x=102, 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=61, b=1, counter=42, p=1, q=0, r=-41, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=61, b=1, counter=42, p=1, q=0, r=-41, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=60, b=1, counter=42, p=1, q=0, r=-42, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=60, b=1, counter=43, p=1, q=0, r=-42, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=60, b=1, counter=43, p=1, q=0, r=-42, s=1, x=102, 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=60, b=1, counter=43, p=1, q=0, r=-42, s=1, x=102, 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=60, b=1, counter=43, p=1, q=0, r=-42, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=60, b=1, counter=43, p=1, q=0, r=-42, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=59, b=1, counter=43, p=1, q=0, r=-43, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=59, b=1, counter=44, p=1, q=0, r=-43, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=59, b=1, counter=44, p=1, q=0, r=-43, s=1, x=102, 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=59, b=1, counter=44, p=1, q=0, r=-43, s=1, x=102, 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=59, b=1, counter=44, p=1, q=0, r=-43, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=59, b=1, counter=44, p=1, q=0, r=-43, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=58, b=1, counter=44, p=1, q=0, r=-44, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=58, b=1, counter=45, p=1, q=0, r=-44, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=58, b=1, counter=45, p=1, q=0, r=-44, s=1, x=102, 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=58, b=1, counter=45, p=1, q=0, r=-44, s=1, x=102, 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=58, b=1, counter=45, p=1, q=0, r=-44, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=58, b=1, counter=45, p=1, q=0, r=-44, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=57, b=1, counter=45, p=1, q=0, r=-45, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=57, b=1, counter=46, p=1, q=0, r=-45, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=57, b=1, counter=46, p=1, q=0, r=-45, s=1, x=102, 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=57, b=1, counter=46, p=1, q=0, r=-45, s=1, x=102, 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=57, b=1, counter=46, p=1, q=0, r=-45, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=57, b=1, counter=46, p=1, q=0, r=-45, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=56, b=1, counter=46, p=1, q=0, r=-46, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=56, b=1, counter=47, p=1, q=0, r=-46, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=56, b=1, counter=47, p=1, q=0, r=-46, s=1, x=102, 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=56, b=1, counter=47, p=1, q=0, r=-46, s=1, x=102, 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=56, b=1, counter=47, p=1, q=0, r=-46, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=56, b=1, counter=47, p=1, q=0, r=-46, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=55, b=1, counter=47, p=1, q=0, r=-47, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=55, b=1, counter=48, p=1, q=0, r=-47, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=55, b=1, counter=48, p=1, q=0, r=-47, s=1, x=102, 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=55, b=1, counter=48, p=1, q=0, r=-47, s=1, x=102, 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=55, b=1, counter=48, p=1, q=0, r=-47, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=55, b=1, counter=48, p=1, q=0, r=-47, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=54, b=1, counter=48, p=1, q=0, r=-48, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=54, b=1, counter=49, p=1, q=0, r=-48, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=54, b=1, counter=49, p=1, q=0, r=-48, s=1, x=102, 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=54, b=1, counter=49, p=1, q=0, r=-48, s=1, x=102, 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=54, b=1, counter=49, p=1, q=0, r=-48, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=54, b=1, counter=49, p=1, q=0, r=-48, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=53, b=1, counter=49, p=1, q=0, r=-49, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=53, b=1, counter=50, p=1, q=0, r=-49, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [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=53, b=1, counter=50, p=1, q=0, r=-49, s=1, x=102, 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=53, b=1, counter=50, p=1, q=0, r=-49, s=1, x=102, 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=53, b=1, counter=50, p=1, q=0, r=-49, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=53, b=1, counter=50, p=1, q=0, r=-49, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=52, b=1, counter=50, p=1, q=0, r=-50, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=52, b=1, counter=51, p=1, q=0, r=-50, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=51] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=51] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=52, b=1, counter=51, p=1, q=0, r=-50, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=51] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=51] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=52, b=1, counter=51, p=1, q=0, r=-50, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=51] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=51] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=52, b=1, counter=51, p=1, q=0, r=-50, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=52, b=1, counter=51, p=1, q=0, r=-50, s=1, x=102, 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=51, p=1, q=0, r=-51, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=51, b=1, counter=52, p=1, q=0, r=-51, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=52] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=52] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=51, b=1, counter=52, p=1, q=0, r=-51, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=52] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=52] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=51, b=1, counter=52, p=1, q=0, r=-51, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=52] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=52] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=51, b=1, counter=52, p=1, q=0, r=-51, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=51, b=1, counter=52, p=1, q=0, r=-51, s=1, x=102, 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=52, p=1, q=0, r=-52, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=50, b=1, counter=53, p=1, q=0, r=-52, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=53] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=50, b=1, counter=53, p=1, q=0, r=-52, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=53] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=50, b=1, counter=53, p=1, q=0, r=-52, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=53] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=50, b=1, counter=53, p=1, q=0, r=-52, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=50, b=1, counter=53, p=1, q=0, r=-52, s=1, x=102, 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=53, p=1, q=0, r=-53, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=49, b=1, counter=54, p=1, q=0, r=-53, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=54] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=54] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=49, b=1, counter=54, p=1, q=0, r=-53, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=54] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=54] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=49, b=1, counter=54, p=1, q=0, r=-53, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=54] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=54] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=49, b=1, counter=54, p=1, q=0, r=-53, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=49, b=1, counter=54, p=1, q=0, r=-53, s=1, x=102, 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=54, p=1, q=0, r=-54, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=48, b=1, counter=55, p=1, q=0, r=-54, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=55] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=55] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=48, b=1, counter=55, p=1, q=0, r=-54, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=55] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=55] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=48, b=1, counter=55, p=1, q=0, r=-54, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=55] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=55] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=48, b=1, counter=55, p=1, q=0, r=-54, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=48, b=1, counter=55, p=1, q=0, r=-54, s=1, x=102, 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=55, p=1, q=0, r=-55, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=47, b=1, counter=56, p=1, q=0, r=-55, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=56] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=56] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=47, b=1, counter=56, p=1, q=0, r=-55, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=56] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=56] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=47, b=1, counter=56, p=1, q=0, r=-55, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=56] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=56] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=47, b=1, counter=56, p=1, q=0, r=-55, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=47, b=1, counter=56, p=1, q=0, r=-55, s=1, x=102, 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=56, p=1, q=0, r=-56, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=46, b=1, counter=57, p=1, q=0, r=-56, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=57] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=46, b=1, counter=57, p=1, q=0, r=-56, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=57] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=46, b=1, counter=57, p=1, q=0, r=-56, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=57] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=46, b=1, counter=57, p=1, q=0, r=-56, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=46, b=1, counter=57, p=1, q=0, r=-56, s=1, x=102, 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=57, p=1, q=0, r=-57, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=45, b=1, counter=58, p=1, q=0, r=-57, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=58] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=58] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=45, b=1, counter=58, p=1, q=0, r=-57, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=58] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=58] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=45, b=1, counter=58, p=1, q=0, r=-57, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=58] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=58] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=45, b=1, counter=58, p=1, q=0, r=-57, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=45, b=1, counter=58, p=1, q=0, r=-57, s=1, x=102, 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=58, p=1, q=0, r=-58, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=44, b=1, counter=59, p=1, q=0, r=-58, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=59] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=59] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=44, b=1, counter=59, p=1, q=0, r=-58, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=59] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=59] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=44, b=1, counter=59, p=1, q=0, r=-58, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=59] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=59] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=44, b=1, counter=59, p=1, q=0, r=-58, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=44, b=1, counter=59, p=1, q=0, r=-58, s=1, x=102, 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=59, p=1, q=0, r=-59, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=43, b=1, counter=60, p=1, q=0, r=-59, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=60] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=60] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=43, b=1, counter=60, p=1, q=0, r=-59, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=60] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=60] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=43, b=1, counter=60, p=1, q=0, r=-59, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=60] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=60] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=43, b=1, counter=60, p=1, q=0, r=-59, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=43, b=1, counter=60, p=1, q=0, r=-59, s=1, x=102, 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=60, p=1, q=0, r=-60, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=42, b=1, counter=61, p=1, q=0, r=-60, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=61] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=42, b=1, counter=61, p=1, q=0, r=-60, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=61] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=42, b=1, counter=61, p=1, q=0, r=-60, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=61] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=42, b=1, counter=61, p=1, q=0, r=-60, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=42, b=1, counter=61, p=1, q=0, r=-60, s=1, x=102, 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=61, p=1, q=0, r=-61, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=41, b=1, counter=62, p=1, q=0, r=-61, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=62] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=62] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=41, b=1, counter=62, p=1, q=0, r=-61, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=62] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=62] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=41, b=1, counter=62, p=1, q=0, r=-61, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=62] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=62] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=41, b=1, counter=62, p=1, q=0, r=-61, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=41, b=1, counter=62, p=1, q=0, r=-61, s=1, x=102, 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=62, p=1, q=0, r=-62, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=40, b=1, counter=63, p=1, q=0, r=-62, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=63] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=63] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=40, b=1, counter=63, p=1, q=0, r=-62, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=63] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=63] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=40, b=1, counter=63, p=1, q=0, r=-62, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=63] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=63] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=40, b=1, counter=63, p=1, q=0, r=-62, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=40, b=1, counter=63, p=1, q=0, r=-62, s=1, x=102, 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=63, p=1, q=0, r=-63, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=39, b=1, counter=64, p=1, q=0, r=-63, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=64] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=64] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=39, b=1, counter=64, p=1, q=0, r=-63, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=64] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=64] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=39, b=1, counter=64, p=1, q=0, r=-63, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=64] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=64] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=39, b=1, counter=64, p=1, q=0, r=-63, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=39, b=1, counter=64, p=1, q=0, r=-63, s=1, x=102, 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=64, p=1, q=0, r=-64, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=38, b=1, counter=65, p=1, q=0, r=-64, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=65] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=38, b=1, counter=65, p=1, q=0, r=-64, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=65] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=38, b=1, counter=65, p=1, q=0, r=-64, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=65] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=38, b=1, counter=65, p=1, q=0, r=-64, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=38, b=1, counter=65, p=1, q=0, r=-64, s=1, x=102, 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=65, p=1, q=0, r=-65, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=37, b=1, counter=66, p=1, q=0, r=-65, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=66] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=66] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=37, b=1, counter=66, p=1, q=0, r=-65, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=66] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=66] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=37, b=1, counter=66, p=1, q=0, r=-65, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=66] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=66] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=37, b=1, counter=66, p=1, q=0, r=-65, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=37, b=1, counter=66, p=1, q=0, r=-65, s=1, x=102, 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=66, p=1, q=0, r=-66, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=36, b=1, counter=67, p=1, q=0, r=-66, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=67] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=67] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=36, b=1, counter=67, p=1, q=0, r=-66, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=67] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=67] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=36, b=1, counter=67, p=1, q=0, r=-66, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=67] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=67] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=36, b=1, counter=67, p=1, q=0, r=-66, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=36, b=1, counter=67, p=1, q=0, r=-66, s=1, x=102, 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=67, p=1, q=0, r=-67, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=35, b=1, counter=68, p=1, q=0, r=-67, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=68] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=68] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=35, b=1, counter=68, p=1, q=0, r=-67, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=68] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=68] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=35, b=1, counter=68, p=1, q=0, r=-67, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=68] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=68] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=35, b=1, counter=68, p=1, q=0, r=-67, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=35, b=1, counter=68, p=1, q=0, r=-67, s=1, x=102, 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=68, p=1, q=0, r=-68, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=34, b=1, counter=69, p=1, q=0, r=-68, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=69] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=34, b=1, counter=69, p=1, q=0, r=-68, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=69] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=34, b=1, counter=69, p=1, q=0, r=-68, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=69] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=34, b=1, counter=69, p=1, q=0, r=-68, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=34, b=1, counter=69, p=1, q=0, r=-68, s=1, x=102, 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=69, p=1, q=0, r=-69, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=33, b=1, counter=70, p=1, q=0, r=-69, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=70] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=70] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=33, b=1, counter=70, p=1, q=0, r=-69, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=70] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=70] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=33, b=1, counter=70, p=1, q=0, r=-69, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=70] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=70] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=33, b=1, counter=70, p=1, q=0, r=-69, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=33, b=1, counter=70, p=1, q=0, r=-69, s=1, x=102, 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=70, p=1, q=0, r=-70, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=32, b=1, counter=71, p=1, q=0, r=-70, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=71] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=71] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=32, b=1, counter=71, p=1, q=0, r=-70, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=71] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=71] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=32, b=1, counter=71, p=1, q=0, r=-70, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=71] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=71] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=32, b=1, counter=71, p=1, q=0, r=-70, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=32, b=1, counter=71, p=1, q=0, r=-70, s=1, x=102, 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=71, p=1, q=0, r=-71, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=31, b=1, counter=72, p=1, q=0, r=-71, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=72] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=72] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=31, b=1, counter=72, p=1, q=0, r=-71, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=72] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=72] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=31, b=1, counter=72, p=1, q=0, r=-71, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=72] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=72] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=31, b=1, counter=72, p=1, q=0, r=-71, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=31, b=1, counter=72, p=1, q=0, r=-71, s=1, x=102, 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=72, p=1, q=0, r=-72, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=30, b=1, counter=73, p=1, q=0, r=-72, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=73] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=30, b=1, counter=73, p=1, q=0, r=-72, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=73] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=30, b=1, counter=73, p=1, q=0, r=-72, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=73] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=30, b=1, counter=73, p=1, q=0, r=-72, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=30, b=1, counter=73, p=1, q=0, r=-72, s=1, x=102, 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=73, p=1, q=0, r=-73, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=29, b=1, counter=74, p=1, q=0, r=-73, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=74] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=74] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=29, b=1, counter=74, p=1, q=0, r=-73, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=74] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=74] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=29, b=1, counter=74, p=1, q=0, r=-73, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=74] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=74] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=29, b=1, counter=74, p=1, q=0, r=-73, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=29, b=1, counter=74, p=1, q=0, r=-73, s=1, x=102, 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=74, p=1, q=0, r=-74, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=28, b=1, counter=75, p=1, q=0, r=-74, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=75] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=75] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=28, b=1, counter=75, p=1, q=0, r=-74, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=75] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=75] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=28, b=1, counter=75, p=1, q=0, r=-74, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=75] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=75] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=28, b=1, counter=75, p=1, q=0, r=-74, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=28, b=1, counter=75, p=1, q=0, r=-74, s=1, x=102, 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=75, p=1, q=0, r=-75, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=27, b=1, counter=76, p=1, q=0, r=-75, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=76] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=76] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=27, b=1, counter=76, p=1, q=0, r=-75, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=76] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=76] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=27, b=1, counter=76, p=1, q=0, r=-75, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=76] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=76] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=27, b=1, counter=76, p=1, q=0, r=-75, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=27, b=1, counter=76, p=1, q=0, r=-75, s=1, x=102, 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=76, p=1, q=0, r=-76, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=26, b=1, counter=77, p=1, q=0, r=-76, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=77] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=26, b=1, counter=77, p=1, q=0, r=-76, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=77] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=26, b=1, counter=77, p=1, q=0, r=-76, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=77] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=26, b=1, counter=77, p=1, q=0, r=-76, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=26, b=1, counter=77, p=1, q=0, r=-76, s=1, x=102, 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=77, p=1, q=0, r=-77, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=25, b=1, counter=78, p=1, q=0, r=-77, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=78] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=78] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=25, b=1, counter=78, p=1, q=0, r=-77, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=78] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=78] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=25, b=1, counter=78, p=1, q=0, r=-77, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=78] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=78] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=25, b=1, counter=78, p=1, q=0, r=-77, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=25, b=1, counter=78, p=1, q=0, r=-77, s=1, x=102, 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=78, p=1, q=0, r=-78, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=24, b=1, counter=79, p=1, q=0, r=-78, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=79] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=79] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=24, b=1, counter=79, p=1, q=0, r=-78, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=79] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=79] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=24, b=1, counter=79, p=1, q=0, r=-78, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=79] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=79] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=24, b=1, counter=79, p=1, q=0, r=-78, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=24, b=1, counter=79, p=1, q=0, r=-78, s=1, x=102, 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=79, p=1, q=0, r=-79, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=23, b=1, counter=80, p=1, q=0, r=-79, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=80] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=80] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=23, b=1, counter=80, p=1, q=0, r=-79, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=80] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=80] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=23, b=1, counter=80, p=1, q=0, r=-79, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=80] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=80] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=23, b=1, counter=80, p=1, q=0, r=-79, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=23, b=1, counter=80, p=1, q=0, r=-79, s=1, x=102, 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=80, p=1, q=0, r=-80, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=22, b=1, counter=81, p=1, q=0, r=-80, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=81] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=22, b=1, counter=81, p=1, q=0, r=-80, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=81] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=22, b=1, counter=81, p=1, q=0, r=-80, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=81] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=22, b=1, counter=81, p=1, q=0, r=-80, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=22, b=1, counter=81, p=1, q=0, r=-80, s=1, x=102, 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=81, p=1, q=0, r=-81, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=21, b=1, counter=82, p=1, q=0, r=-81, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=82] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=82] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=21, b=1, counter=82, p=1, q=0, r=-81, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=82] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=82] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=21, b=1, counter=82, p=1, q=0, r=-81, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=82] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=82] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=21, b=1, counter=82, p=1, q=0, r=-81, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=21, b=1, counter=82, p=1, q=0, r=-81, s=1, x=102, 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=82, p=1, q=0, r=-82, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=20, b=1, counter=83, p=1, q=0, r=-82, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=83] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=83] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=20, b=1, counter=83, p=1, q=0, r=-82, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=83] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=83] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=20, b=1, counter=83, p=1, q=0, r=-82, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=83] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=83] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=20, b=1, counter=83, p=1, q=0, r=-82, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=20, b=1, counter=83, p=1, q=0, r=-82, s=1, x=102, 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=83, p=1, q=0, r=-83, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=19, b=1, counter=84, p=1, q=0, r=-83, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=84] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=84] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=19, b=1, counter=84, p=1, q=0, r=-83, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=84] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=84] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=19, b=1, counter=84, p=1, q=0, r=-83, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=84] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=84] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=19, b=1, counter=84, p=1, q=0, r=-83, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=19, b=1, counter=84, p=1, q=0, r=-83, s=1, x=102, 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=84, p=1, q=0, r=-84, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=18, b=1, counter=85, p=1, q=0, r=-84, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=85] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=18, b=1, counter=85, p=1, q=0, r=-84, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=85] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=18, b=1, counter=85, p=1, q=0, r=-84, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=85] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=18, b=1, counter=85, p=1, q=0, r=-84, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=18, b=1, counter=85, p=1, q=0, r=-84, s=1, x=102, 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=85, p=1, q=0, r=-85, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=17, b=1, counter=86, p=1, q=0, r=-85, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=86] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=86] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=17, b=1, counter=86, p=1, q=0, r=-85, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=86] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=86] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=17, b=1, counter=86, p=1, q=0, r=-85, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=86] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=86] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=17, b=1, counter=86, p=1, q=0, r=-85, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=17, b=1, counter=86, p=1, q=0, r=-85, s=1, x=102, 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=86, p=1, q=0, r=-86, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=16, b=1, counter=87, p=1, q=0, r=-86, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=87] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=87] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=16, b=1, counter=87, p=1, q=0, r=-86, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=87] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=87] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=16, b=1, counter=87, p=1, q=0, r=-86, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=87] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=87] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=16, b=1, counter=87, p=1, q=0, r=-86, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=16, b=1, counter=87, p=1, q=0, r=-86, s=1, x=102, 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=87, p=1, q=0, r=-87, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=15, b=1, counter=88, p=1, q=0, r=-87, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=88] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=88] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=15, b=1, counter=88, p=1, q=0, r=-87, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=88] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=88] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=15, b=1, counter=88, p=1, q=0, r=-87, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=88] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=88] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=15, b=1, counter=88, p=1, q=0, r=-87, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=15, b=1, counter=88, p=1, q=0, r=-87, s=1, x=102, 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=88, p=1, q=0, r=-88, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=14, b=1, counter=89, p=1, q=0, r=-88, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=89] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=14, b=1, counter=89, p=1, q=0, r=-88, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=89] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=14, b=1, counter=89, p=1, q=0, r=-88, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=89] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=14, b=1, counter=89, p=1, q=0, r=-88, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=14, b=1, counter=89, p=1, q=0, r=-88, s=1, x=102, 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=89, p=1, q=0, r=-89, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=13, b=1, counter=90, p=1, q=0, r=-89, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=90] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=90] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=13, b=1, counter=90, p=1, q=0, r=-89, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=90] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=90] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=13, b=1, counter=90, p=1, q=0, r=-89, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=90] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=90] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=13, b=1, counter=90, p=1, q=0, r=-89, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=13, b=1, counter=90, p=1, q=0, r=-89, s=1, x=102, 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=90, p=1, q=0, r=-90, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=12, b=1, counter=91, p=1, q=0, r=-90, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=91] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=91] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=12, b=1, counter=91, p=1, q=0, r=-90, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=91] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=91] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=12, b=1, counter=91, p=1, q=0, r=-90, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=91] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=91] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=12, b=1, counter=91, p=1, q=0, r=-90, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=12, b=1, counter=91, p=1, q=0, r=-90, s=1, x=102, 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=91, p=1, q=0, r=-91, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=11, b=1, counter=92, p=1, q=0, r=-91, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=92] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=92] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=1, counter=92, p=1, q=0, r=-91, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=92] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=92] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=11, b=1, counter=92, p=1, q=0, r=-91, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=92] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=92] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=11, b=1, counter=92, p=1, q=0, r=-91, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=1, counter=92, p=1, q=0, r=-91, s=1, x=102, 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=92, p=1, q=0, r=-92, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=10, b=1, counter=93, p=1, q=0, r=-92, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=93] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=10, b=1, counter=93, p=1, q=0, r=-92, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=93] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=10, b=1, counter=93, p=1, q=0, r=-92, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=93] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=10, b=1, counter=93, p=1, q=0, r=-92, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=10, b=1, counter=93, p=1, q=0, r=-92, s=1, x=102, 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=93, p=1, q=0, r=-93, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=9, b=1, counter=94, p=1, q=0, r=-93, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=94] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=94] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=1, counter=94, p=1, q=0, r=-93, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=94] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=94] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=9, b=1, counter=94, p=1, q=0, r=-93, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=94] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=94] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=9, b=1, counter=94, p=1, q=0, r=-93, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=1, counter=94, p=1, q=0, r=-93, s=1, x=102, 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=94, p=1, q=0, r=-94, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=8, b=1, counter=95, p=1, q=0, r=-94, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=95] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=95] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=8, b=1, counter=95, p=1, q=0, r=-94, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=95] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=95] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=8, b=1, counter=95, p=1, q=0, r=-94, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=95] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=95] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=8, b=1, counter=95, p=1, q=0, r=-94, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=8, b=1, counter=95, p=1, q=0, r=-94, s=1, x=102, 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=95, p=1, q=0, r=-95, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=7, b=1, counter=96, p=1, q=0, r=-95, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=96] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=96] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=1, counter=96, p=1, q=0, r=-95, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=96] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=96] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=1, counter=96, p=1, q=0, r=-95, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=96] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=96] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=1, counter=96, p=1, q=0, r=-95, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=1, counter=96, p=1, q=0, r=-95, s=1, x=102, 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=96, p=1, q=0, r=-96, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=6, b=1, counter=97, p=1, q=0, r=-96, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=97] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=6, b=1, counter=97, p=1, q=0, r=-96, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=97] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=6, b=1, counter=97, p=1, q=0, r=-96, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=97] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=6, b=1, counter=97, p=1, q=0, r=-96, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=6, b=1, counter=97, p=1, q=0, r=-96, s=1, x=102, 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=97, p=1, q=0, r=-97, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=5, b=1, counter=98, p=1, q=0, r=-97, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=98] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=98] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=1, counter=98, p=1, q=0, r=-97, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=98] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=98] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=1, counter=98, p=1, q=0, r=-97, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=98] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=98] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=1, counter=98, p=1, q=0, r=-97, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=1, counter=98, p=1, q=0, r=-97, s=1, x=102, 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=98, p=1, q=0, r=-98, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=4, b=1, counter=99, p=1, q=0, r=-98, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=99] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=99] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=4, b=1, counter=99, p=1, q=0, r=-98, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=99] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=99] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=4, b=1, counter=99, p=1, q=0, r=-98, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=99] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=99] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=4, b=1, counter=99, p=1, q=0, r=-98, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=4, b=1, counter=99, p=1, q=0, r=-98, s=1, x=102, 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=99, p=1, q=0, r=-99, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=3, b=1, counter=100, p=1, q=0, r=-99, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=100] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=100] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=3, b=1, counter=100, p=1, q=0, r=-99, s=1, x=102, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=100] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=100] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=3, b=1, counter=100, p=1, q=0, r=-99, s=1, x=102, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=100] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=100] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=3, b=1, counter=100, p=1, q=0, r=-99, s=1, x=102, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=3, b=1, counter=100, p=1, q=0, r=-99, s=1, x=102, 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=100, p=1, q=0, r=-100, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=2, b=1, counter=101, p=1, q=0, r=-100, s=1, x=102, y=1] [L34] COND FALSE !(counter++<100) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=101] [L11] COND TRUE !(cond) VAL [\old(cond)=0, counter=101] [L13] reach_error() VAL [\old(cond)=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 290.2s, OverallIterations: 19, TraceHistogramMax: 301, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.2s, AutomataDifference: 27.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2418 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2387 mSDsluCounter, 4109 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3543 mSDsCounter, 783 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3302 IncrementalHoareTripleChecker+Invalid, 4085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 783 mSolverCounterUnsat, 566 mSDtfsCounter, 3302 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9148 GetRequests, 8389 SyntacticMatches, 92 SemanticMatches, 667 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16833 ImplicationChecksByTransitivity, 29.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1922occurred in iteration=18, InterpolantAutomatonStates: 654, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 403 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 190.6s SatisfiabilityAnalysisTime, 62.9s InterpolantComputationTime, 11578 NumberOfCodeBlocks, 11558 NumberOfCodeBlocksAsserted, 324 NumberOfCheckSat, 11130 ConstructedInterpolants, 0 QuantifiedInterpolants, 25326 SizeOfPredicates, 198 NumberOfNonLiveVariables, 8479 ConjunctsInSsa, 542 ConjunctsInUnsatCore, 36 InterpolantComputations, 8 PerfectInterpolantSequences, 419919/745293 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 12:49:19,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_151c2661-ba14-44e3-a31d-327ec3509e67/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