./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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/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_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --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.2.2-hotfix-svcomp22-839c364 [2021-12-06 19:47:47,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 19:47:47,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 19:47:47,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 19:47:47,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 19:47:47,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 19:47:47,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 19:47:47,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 19:47:47,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 19:47:47,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 19:47:47,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 19:47:47,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 19:47:47,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 19:47:47,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 19:47:47,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 19:47:47,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 19:47:47,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 19:47:47,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 19:47:47,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 19:47:47,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 19:47:47,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 19:47:47,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 19:47:47,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 19:47:47,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 19:47:47,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 19:47:47,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 19:47:47,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 19:47:47,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 19:47:47,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 19:47:47,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 19:47:47,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 19:47:47,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 19:47:47,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 19:47:47,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 19:47:47,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 19:47:47,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 19:47:47,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 19:47:47,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 19:47:47,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 19:47:47,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 19:47:47,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 19:47:47,288 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 19:47:47,305 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 19:47:47,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 19:47:47,305 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 19:47:47,306 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 19:47:47,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 19:47:47,306 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 19:47:47,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 19:47:47,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 19:47:47,307 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 19:47:47,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 19:47:47,307 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 19:47:47,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 19:47:47,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 19:47:47,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 19:47:47,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 19:47:47,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 19:47:47,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 19:47:47,308 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 19:47:47,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 19:47:47,308 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 19:47:47,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 19:47:47,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 19:47:47,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 19:47:47,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 19:47:47,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:47:47,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 19:47:47,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 19:47:47,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 19:47:47,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 19:47:47,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 19:47:47,309 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 19:47:47,309 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 19:47:47,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 19:47:47,310 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 19:47:47,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2021-12-06 19:47:47,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 19:47:47,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 19:47:47,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 19:47:47,540 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 19:47:47,541 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 19:47:47,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c [2021-12-06 19:47:47,587 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/data/9451abdab/383c90fce15a422eaca6d62dc871b5b5/FLAGe251c924a [2021-12-06 19:47:47,978 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 19:47:47,978 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c [2021-12-06 19:47:47,984 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/data/9451abdab/383c90fce15a422eaca6d62dc871b5b5/FLAGe251c924a [2021-12-06 19:47:47,994 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/data/9451abdab/383c90fce15a422eaca6d62dc871b5b5 [2021-12-06 19:47:47,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 19:47:47,997 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 19:47:47,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 19:47:47,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 19:47:48,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 19:47:48,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:47:47" (1/1) ... [2021-12-06 19:47:48,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e11b423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:47:48, skipping insertion in model container [2021-12-06 19:47:48,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:47:47" (1/1) ... [2021-12-06 19:47:48,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 19:47:48,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 19:47:48,139 WARN L230 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_e362cec1-3de5-4ea1-8967-3e5a429400fd/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c[489,502] [2021-12-06 19:47:48,155 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:47:48,161 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 19:47:48,171 WARN L230 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_e362cec1-3de5-4ea1-8967-3e5a429400fd/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c[489,502] [2021-12-06 19:47:48,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:47:48,189 INFO L208 MainTranslator]: Completed translation [2021-12-06 19:47:48,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:47:48 WrapperNode [2021-12-06 19:47:48,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 19:47:48,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 19:47:48,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 19:47:48,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 19:47:48,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:47:48" (1/1) ... [2021-12-06 19:47:48,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:47:48" (1/1) ... [2021-12-06 19:47:48,216 INFO L137 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2021-12-06 19:47:48,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 19:47:48,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 19:47:48,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 19:47:48,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 19:47:48,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:47:48" (1/1) ... [2021-12-06 19:47:48,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:47:48" (1/1) ... [2021-12-06 19:47:48,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:47:48" (1/1) ... [2021-12-06 19:47:48,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:47:48" (1/1) ... [2021-12-06 19:47:48,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:47:48" (1/1) ... [2021-12-06 19:47:48,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:47:48" (1/1) ... [2021-12-06 19:47:48,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:47:48" (1/1) ... [2021-12-06 19:47:48,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 19:47:48,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 19:47:48,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 19:47:48,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 19:47:48,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:47:48" (1/1) ... [2021-12-06 19:47:48,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:47:48,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:48,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 19:47:48,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 19:47:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 19:47:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-06 19:47:48,301 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-06 19:47:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 19:47:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 19:47:48,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 19:47:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-06 19:47:48,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-06 19:47:48,350 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 19:47:48,352 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 19:47:48,434 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 19:47:48,440 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 19:47:48,440 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-06 19:47:48,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:47:48 BoogieIcfgContainer [2021-12-06 19:47:48,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 19:47:48,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 19:47:48,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 19:47:48,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 19:47:48,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:47:47" (1/3) ... [2021-12-06 19:47:48,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@246876b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:47:48, skipping insertion in model container [2021-12-06 19:47:48,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:47:48" (2/3) ... [2021-12-06 19:47:48,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@246876b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:47:48, skipping insertion in model container [2021-12-06 19:47:48,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:47:48" (3/3) ... [2021-12-06 19:47:48,451 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound100.c [2021-12-06 19:47:48,456 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 19:47:48,457 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 19:47:48,498 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 19:47:48,503 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 19:47:48,504 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 19:47:48,516 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) [2021-12-06 19:47:48,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-06 19:47:48,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:48,520 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:47:48,521 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:48,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:48,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1165920622, now seen corresponding path program 1 times [2021-12-06 19:47:48,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:48,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940103694] [2021-12-06 19:47:48,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:48,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:48,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:47:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:48,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-06 19:47:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:48,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 19:47:48,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:48,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940103694] [2021-12-06 19:47:48,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940103694] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:48,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:47:48,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 19:47:48,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805711326] [2021-12-06 19:47:48,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:48,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 19:47:48,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:48,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 19:47:48,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 19:47:48,683 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) [2021-12-06 19:47:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:48,699 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2021-12-06 19:47:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 19:47:48,701 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 [2021-12-06 19:47:48,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:48,709 INFO L225 Difference]: With dead ends: 57 [2021-12-06 19:47:48,709 INFO L226 Difference]: Without dead ends: 26 [2021-12-06 19:47:48,713 INFO L932 BasicCegarLoop]: 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 [2021-12-06 19:47:48,717 INFO L933 BasicCegarLoop]: 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 [2021-12-06 19:47:48,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:48,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-06 19:47:48,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-06 19:47:48,751 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) [2021-12-06 19:47:48,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2021-12-06 19:47:48,755 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2021-12-06 19:47:48,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:48,755 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-12-06 19:47:48,756 INFO L471 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) [2021-12-06 19:47:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2021-12-06 19:47:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-06 19:47:48,758 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:48,758 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:47:48,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 19:47:48,759 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:48,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:48,760 INFO L85 PathProgramCache]: Analyzing trace with hash -542319922, now seen corresponding path program 1 times [2021-12-06 19:47:48,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:48,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955902782] [2021-12-06 19:47:48,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:48,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:48,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:47:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:48,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-06 19:47:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 19:47:48,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:48,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955902782] [2021-12-06 19:47:48,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955902782] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:48,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:47:48,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 19:47:48,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194928802] [2021-12-06 19:47:48,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:48,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 19:47:48,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:48,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 19:47:48,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 19:47:48,852 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) [2021-12-06 19:47:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:48,876 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2021-12-06 19:47:48,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 19:47:48,877 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 [2021-12-06 19:47:48,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:48,878 INFO L225 Difference]: With dead ends: 38 [2021-12-06 19:47:48,879 INFO L226 Difference]: Without dead ends: 28 [2021-12-06 19:47:48,879 INFO L932 BasicCegarLoop]: 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 [2021-12-06 19:47:48,881 INFO L933 BasicCegarLoop]: 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 [2021-12-06 19:47:48,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-06 19:47:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-06 19:47:48,890 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) [2021-12-06 19:47:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2021-12-06 19:47:48,892 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2021-12-06 19:47:48,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:48,893 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-12-06 19:47:48,893 INFO L471 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) [2021-12-06 19:47:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2021-12-06 19:47:48,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-06 19:47:48,894 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:48,895 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:47:48,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 19:47:48,895 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:48,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:48,896 INFO L85 PathProgramCache]: Analyzing trace with hash -540651626, now seen corresponding path program 1 times [2021-12-06 19:47:48,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:48,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721533808] [2021-12-06 19:47:48,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:48,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:48,914 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 19:47:48,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369118302] [2021-12-06 19:47:48,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:48,915 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:48,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:48,916 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:48,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 19:47:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:48,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 19:47:48,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 19:47:49,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:49,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:49,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721533808] [2021-12-06 19:47:49,076 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 19:47:49,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369118302] [2021-12-06 19:47:49,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369118302] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:49,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:47:49,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:47:49,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971942842] [2021-12-06 19:47:49,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:49,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:47:49,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:49,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:47:49,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:47:49,079 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) [2021-12-06 19:47:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:49,125 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2021-12-06 19:47:49,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:47:49,126 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 [2021-12-06 19:47:49,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:49,127 INFO L225 Difference]: With dead ends: 45 [2021-12-06 19:47:49,127 INFO L226 Difference]: Without dead ends: 43 [2021-12-06 19:47:49,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:47:49,129 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 136 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.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:49,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 136 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-06 19:47:49,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2021-12-06 19:47:49,139 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) [2021-12-06 19:47:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2021-12-06 19:47:49,141 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2021-12-06 19:47:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:49,142 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2021-12-06 19:47:49,142 INFO L471 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) [2021-12-06 19:47:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2021-12-06 19:47:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-06 19:47:49,143 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:49,143 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:47:49,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 19:47:49,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:49,345 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:49,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:49,348 INFO L85 PathProgramCache]: Analyzing trace with hash -276555716, now seen corresponding path program 1 times [2021-12-06 19:47:49,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:49,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083629525] [2021-12-06 19:47:49,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:49,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:49,382 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 19:47:49,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37631333] [2021-12-06 19:47:49,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:49,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:49,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:49,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:49,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 19:47:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:49,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-06 19:47:49,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:49,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 19:47:49,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:49,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:49,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083629525] [2021-12-06 19:47:49,699 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 19:47:49,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37631333] [2021-12-06 19:47:49,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37631333] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:49,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:47:49,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 19:47:49,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287059583] [2021-12-06 19:47:49,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:49,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 19:47:49,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:49,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 19:47:49,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:47:49,701 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 19:47:49,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:49,782 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2021-12-06 19:47:49,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 19:47:49,782 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2021-12-06 19:47:49,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:49,783 INFO L225 Difference]: With dead ends: 49 [2021-12-06 19:47:49,783 INFO L226 Difference]: Without dead ends: 47 [2021-12-06 19:47:49,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:47:49,784 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:49,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 200 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:47:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-06 19:47:49,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2021-12-06 19:47:49,791 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) [2021-12-06 19:47:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2021-12-06 19:47:49,792 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2021-12-06 19:47:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:49,792 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2021-12-06 19:47:49,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 19:47:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2021-12-06 19:47:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-06 19:47:49,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:49,793 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:47:49,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 19:47:49,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:49,995 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:49,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:49,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1836785898, now seen corresponding path program 1 times [2021-12-06 19:47:49,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:49,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508069207] [2021-12-06 19:47:49,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:49,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:50,028 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 19:47:50,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [984613677] [2021-12-06 19:47:50,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:50,030 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:50,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:50,032 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:50,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 19:47:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:50,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-06 19:47:50,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 19:47:50,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:47:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 19:47:50,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:50,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508069207] [2021-12-06 19:47:50,486 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 19:47:50,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984613677] [2021-12-06 19:47:50,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984613677] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:50,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:50,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2021-12-06 19:47:50,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463423086] [2021-12-06 19:47:50,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:50,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:47:50,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:50,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:47:50,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-06 19:47:50,487 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) [2021-12-06 19:47:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:50,519 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2021-12-06 19:47:50,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:47:50,520 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 [2021-12-06 19:47:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:50,522 INFO L225 Difference]: With dead ends: 71 [2021-12-06 19:47:50,522 INFO L226 Difference]: Without dead ends: 67 [2021-12-06 19:47:50,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:47:50,523 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:50,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 128 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:50,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-06 19:47:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-12-06 19:47:50,534 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) [2021-12-06 19:47:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2021-12-06 19:47:50,535 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 29 [2021-12-06 19:47:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:50,535 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2021-12-06 19:47:50,536 INFO L471 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) [2021-12-06 19:47:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2021-12-06 19:47:50,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-06 19:47:50,536 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:50,537 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:47:50,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 19:47:50,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:50,739 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:50,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1071030291, now seen corresponding path program 1 times [2021-12-06 19:47:50,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:50,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029413804] [2021-12-06 19:47:50,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:50,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:50,772 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 19:47:50,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [505766626] [2021-12-06 19:47:50,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:50,774 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:50,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:50,777 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:50,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 19:47:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:50,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 19:47:50,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 19:47:50,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:50,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:50,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029413804] [2021-12-06 19:47:50,943 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 19:47:50,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505766626] [2021-12-06 19:47:50,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505766626] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:50,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:47:50,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:47:50,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392183901] [2021-12-06 19:47:50,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:50,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:47:50,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:50,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:47:50,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:47:50,944 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) [2021-12-06 19:47:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:50,970 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2021-12-06 19:47:50,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:47:50,970 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 [2021-12-06 19:47:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:50,971 INFO L225 Difference]: With dead ends: 83 [2021-12-06 19:47:50,971 INFO L226 Difference]: Without dead ends: 81 [2021-12-06 19:47:50,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:47:50,972 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:50,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 137 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-06 19:47:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2021-12-06 19:47:50,983 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) [2021-12-06 19:47:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2021-12-06 19:47:50,984 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 35 [2021-12-06 19:47:50,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:50,984 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2021-12-06 19:47:50,984 INFO L471 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) [2021-12-06 19:47:50,984 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2021-12-06 19:47:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-06 19:47:50,985 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:50,985 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:47:51,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-06 19:47:51,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:51,187 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:51,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1689492770, now seen corresponding path program 1 times [2021-12-06 19:47:51,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:51,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215973360] [2021-12-06 19:47:51,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:51,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:51,217 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 19:47:51,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758346753] [2021-12-06 19:47:51,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:51,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:51,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:51,222 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:51,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 19:47:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:51,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 19:47:51,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 19:47:51,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:47:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 19:47:51,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:51,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215973360] [2021-12-06 19:47:51,415 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 19:47:51,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758346753] [2021-12-06 19:47:51,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758346753] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:47:51,416 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:47:51,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-12-06 19:47:51,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292959657] [2021-12-06 19:47:51,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 19:47:51,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:47:51,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:51,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:47:51,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:51,418 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, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-12-06 19:47:51,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:51,519 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2021-12-06 19:47:51,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 19:47:51,520 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, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 38 [2021-12-06 19:47:51,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:51,522 INFO L225 Difference]: With dead ends: 218 [2021-12-06 19:47:51,523 INFO L226 Difference]: Without dead ends: 196 [2021-12-06 19:47:51,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:47:51,524 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 73 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:51,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 159 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:47:51,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-06 19:47:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2021-12-06 19:47:51,556 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) [2021-12-06 19:47:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2021-12-06 19:47:51,559 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 38 [2021-12-06 19:47:51,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:51,559 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2021-12-06 19:47:51,560 INFO L471 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, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-12-06 19:47:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2021-12-06 19:47:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-06 19:47:51,561 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:51,561 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:47:51,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 19:47:51,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:51,763 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:51,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:51,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1691161066, now seen corresponding path program 1 times [2021-12-06 19:47:51,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:51,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669080813] [2021-12-06 19:47:51,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:51,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:51,791 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 19:47:51,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [992647119] [2021-12-06 19:47:51,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:51,792 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:51,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:51,795 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:51,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 19:47:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:51,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 19:47:51,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 19:47:51,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 19:47:51,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:51,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669080813] [2021-12-06 19:47:51,946 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 19:47:51,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992647119] [2021-12-06 19:47:51,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992647119] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:47:51,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:47:51,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:47:51,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306293490] [2021-12-06 19:47:51,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:51,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:47:51,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:51,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:47:51,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:47:51,948 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) [2021-12-06 19:47:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:51,979 INFO L93 Difference]: Finished difference Result 204 states and 260 transitions. [2021-12-06 19:47:51,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:47:51,979 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 [2021-12-06 19:47:51,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:51,981 INFO L225 Difference]: With dead ends: 204 [2021-12-06 19:47:51,981 INFO L226 Difference]: Without dead ends: 199 [2021-12-06 19:47:51,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 19:47:51,982 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 127 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 [2021-12-06 19:47:51,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 127 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-06 19:47:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-12-06 19:47:52,003 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) [2021-12-06 19:47:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2021-12-06 19:47:52,005 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2021-12-06 19:47:52,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:52,005 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2021-12-06 19:47:52,006 INFO L471 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) [2021-12-06 19:47:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2021-12-06 19:47:52,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 19:47:52,006 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:52,006 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:47:52,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 19:47:52,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-06 19:47:52,208 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:52,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:52,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1925895455, now seen corresponding path program 1 times [2021-12-06 19:47:52,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:52,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779554378] [2021-12-06 19:47:52,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:52,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:52,236 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 19:47:52,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810980321] [2021-12-06 19:47:52,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:52,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:52,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:52,239 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:52,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 19:47:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:52,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 19:47:52,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 19:47:52,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:47:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 19:47:52,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:52,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779554378] [2021-12-06 19:47:52,487 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 19:47:52,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810980321] [2021-12-06 19:47:52,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810980321] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:47:52,487 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:47:52,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-12-06 19:47:52,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113608654] [2021-12-06 19:47:52,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 19:47:52,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 19:47:52,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:52,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 19:47:52,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:47:52,489 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-06 19:47:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:52,602 INFO L93 Difference]: Finished difference Result 228 states and 286 transitions. [2021-12-06 19:47:52,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 19:47:52,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2021-12-06 19:47:52,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:52,605 INFO L225 Difference]: With dead ends: 228 [2021-12-06 19:47:52,605 INFO L226 Difference]: Without dead ends: 212 [2021-12-06 19:47:52,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-06 19:47:52,607 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:52,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 109 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:47:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-12-06 19:47:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2021-12-06 19:47:52,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 127 states have (on average 1.1653543307086613) internal successors, (148), 138 states have internal predecessors, (148), 57 states have call successors, (57), 25 states have call predecessors, (57), 25 states have return successors, (53), 46 states have call predecessors, (53), 53 states have call successors, (53) [2021-12-06 19:47:52,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 258 transitions. [2021-12-06 19:47:52,630 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 258 transitions. Word has length 40 [2021-12-06 19:47:52,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:52,630 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 258 transitions. [2021-12-06 19:47:52,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-06 19:47:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 258 transitions. [2021-12-06 19:47:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-06 19:47:52,632 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:52,632 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:47:52,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 19:47:52,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:52,833 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:52,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash 968731240, now seen corresponding path program 2 times [2021-12-06 19:47:52,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:52,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800004242] [2021-12-06 19:47:52,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:52,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:52,846 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 19:47:52,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528343035] [2021-12-06 19:47:52,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 19:47:52,847 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:52,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:52,849 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:52,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 19:47:52,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 19:47:52,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:47:52,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-06 19:47:52,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-06 19:47:53,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:47:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-06 19:47:53,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:53,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800004242] [2021-12-06 19:47:53,200 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 19:47:53,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528343035] [2021-12-06 19:47:53,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528343035] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:47:53,201 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:47:53,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-12-06 19:47:53,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046432782] [2021-12-06 19:47:53,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 19:47:53,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 19:47:53,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:53,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 19:47:53,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:53,202 INFO L87 Difference]: Start difference. First operand 210 states and 258 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-06 19:47:53,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:53,587 INFO L93 Difference]: Finished difference Result 249 states and 310 transitions. [2021-12-06 19:47:53,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 19:47:53,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 43 [2021-12-06 19:47:53,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:53,589 INFO L225 Difference]: With dead ends: 249 [2021-12-06 19:47:53,589 INFO L226 Difference]: Without dead ends: 225 [2021-12-06 19:47:53,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-06 19:47:53,590 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:53,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 186 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 19:47:53,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-12-06 19:47:53,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2021-12-06 19:47:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 133 states have (on average 1.1278195488721805) internal successors, (150), 141 states have internal predecessors, (150), 45 states have call successors, (45), 27 states have call predecessors, (45), 27 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-06 19:47:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2021-12-06 19:47:53,606 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 43 [2021-12-06 19:47:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:53,606 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2021-12-06 19:47:53,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-06 19:47:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2021-12-06 19:47:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 19:47:53,607 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:53,607 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:47:53,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 19:47:53,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-06 19:47:53,808 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:53,809 INFO L85 PathProgramCache]: Analyzing trace with hash -715006568, now seen corresponding path program 1 times [2021-12-06 19:47:53,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:53,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565428551] [2021-12-06 19:47:53,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:53,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:53,819 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 19:47:53,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2132575356] [2021-12-06 19:47:53,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:53,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:53,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:53,821 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:53,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 19:47:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:47:53,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-06 19:47:53,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-06 19:47:54,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:47:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-12-06 19:47:54,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:54,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565428551] [2021-12-06 19:47:54,132 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 19:47:54,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132575356] [2021-12-06 19:47:54,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132575356] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 19:47:54,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:47:54,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2021-12-06 19:47:54,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328868218] [2021-12-06 19:47:54,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:47:54,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:47:54,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:54,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:47:54,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 19:47:54,134 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2021-12-06 19:47:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:54,167 INFO L93 Difference]: Finished difference Result 212 states and 241 transitions. [2021-12-06 19:47:54,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:47:54,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 57 [2021-12-06 19:47:54,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:54,169 INFO L225 Difference]: With dead ends: 212 [2021-12-06 19:47:54,169 INFO L226 Difference]: Without dead ends: 188 [2021-12-06 19:47:54,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-06 19:47:54,169 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:54,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:47:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-06 19:47:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2021-12-06 19:47:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 124 states have (on average 1.1129032258064515) internal successors, (138), 128 states have internal predecessors, (138), 36 states have call successors, (36), 24 states have call predecessors, (36), 24 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2021-12-06 19:47:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2021-12-06 19:47:54,182 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 57 [2021-12-06 19:47:54,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:54,183 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2021-12-06 19:47:54,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2021-12-06 19:47:54,183 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2021-12-06 19:47:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-06 19:47:54,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:54,184 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:47:54,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 19:47:54,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-06 19:47:54,386 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:54,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:54,387 INFO L85 PathProgramCache]: Analyzing trace with hash 985491918, now seen corresponding path program 2 times [2021-12-06 19:47:54,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:54,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140238903] [2021-12-06 19:47:54,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:54,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:54,413 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 19:47:54,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1948613864] [2021-12-06 19:47:54,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 19:47:54,415 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:54,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:54,417 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:54,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 19:47:54,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 19:47:54,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:47:54,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 19:47:54,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-06 19:47:54,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:47:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2021-12-06 19:47:54,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:54,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140238903] [2021-12-06 19:47:54,752 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 19:47:54,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948613864] [2021-12-06 19:47:54,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948613864] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:47:54,752 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:47:54,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-06 19:47:54,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589776081] [2021-12-06 19:47:54,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 19:47:54,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 19:47:54,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:54,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 19:47:54,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-12-06 19:47:54,753 INFO L87 Difference]: Start difference. First operand 185 states and 208 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, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2021-12-06 19:47:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:54,927 INFO L93 Difference]: Finished difference Result 512 states and 601 transitions. [2021-12-06 19:47:54,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 19:47:54,927 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, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 95 [2021-12-06 19:47:54,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:54,930 INFO L225 Difference]: With dead ends: 512 [2021-12-06 19:47:54,930 INFO L226 Difference]: Without dead ends: 503 [2021-12-06 19:47:54,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2021-12-06 19:47:54,931 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 106 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:54,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 260 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:47:54,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-12-06 19:47:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2021-12-06 19:47:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 334 states have (on average 1.095808383233533) internal successors, (366), 344 states have internal predecessors, (366), 102 states have call successors, (102), 66 states have call predecessors, (102), 66 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2021-12-06 19:47:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 568 transitions. [2021-12-06 19:47:54,967 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 568 transitions. Word has length 95 [2021-12-06 19:47:54,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:54,967 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 568 transitions. [2021-12-06 19:47:54,967 INFO L471 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, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2021-12-06 19:47:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 568 transitions. [2021-12-06 19:47:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-12-06 19:47:54,970 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:54,971 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:47:54,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-06 19:47:55,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:55,171 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:55,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:55,172 INFO L85 PathProgramCache]: Analyzing trace with hash 325062734, now seen corresponding path program 3 times [2021-12-06 19:47:55,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:55,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013589630] [2021-12-06 19:47:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:55,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:55,180 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 19:47:55,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1028919926] [2021-12-06 19:47:55,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 19:47:55,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:55,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:55,181 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:55,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 19:47:55,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2021-12-06 19:47:55,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:47:55,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-06 19:47:55,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 1955 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-12-06 19:47:55,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:47:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2021-12-06 19:47:55,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:55,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013589630] [2021-12-06 19:47:55,782 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 19:47:55,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028919926] [2021-12-06 19:47:55,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028919926] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:47:55,782 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:47:55,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-12-06 19:47:55,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293034464] [2021-12-06 19:47:55,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 19:47:55,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-06 19:47:55,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:55,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-06 19:47:55,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2021-12-06 19:47:55,784 INFO L87 Difference]: Start difference. First operand 503 states and 568 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, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 22 states have call predecessors, (64), 22 states have call successors, (64) [2021-12-06 19:47:56,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:56,210 INFO L93 Difference]: Finished difference Result 1148 states and 1345 transitions. [2021-12-06 19:47:56,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-06 19:47:56,211 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, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 22 states have call predecessors, (64), 22 states have call successors, (64) Word has length 209 [2021-12-06 19:47:56,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:56,216 INFO L225 Difference]: With dead ends: 1148 [2021-12-06 19:47:56,216 INFO L226 Difference]: Without dead ends: 1139 [2021-12-06 19:47:56,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2021-12-06 19:47:56,218 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 316 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:56,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 449 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 19:47:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-12-06 19:47:56,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2021-12-06 19:47:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 754 states have (on average 1.090185676392573) internal successors, (822), 776 states have internal predecessors, (822), 234 states have call successors, (234), 150 states have call predecessors, (234), 150 states have return successors, (232), 212 states have call predecessors, (232), 232 states have call successors, (232) [2021-12-06 19:47:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1288 transitions. [2021-12-06 19:47:56,284 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1288 transitions. Word has length 209 [2021-12-06 19:47:56,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:56,285 INFO L470 AbstractCegarLoop]: Abstraction has 1139 states and 1288 transitions. [2021-12-06 19:47:56,285 INFO L471 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, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 22 states have call predecessors, (64), 22 states have call successors, (64) [2021-12-06 19:47:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1288 transitions. [2021-12-06 19:47:56,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2021-12-06 19:47:56,292 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:56,293 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:47:56,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 19:47:56,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:56,494 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:56,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:56,494 INFO L85 PathProgramCache]: Analyzing trace with hash -767722162, now seen corresponding path program 4 times [2021-12-06 19:47:56,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:56,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228131251] [2021-12-06 19:47:56,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:56,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:56,517 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 19:47:56,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929231965] [2021-12-06 19:47:56,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-06 19:47:56,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:56,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:56,519 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:56,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 19:47:56,652 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-06 19:47:56,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:47:56,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-06 19:47:56,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:47:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 9977 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2021-12-06 19:47:57,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:47:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 1661 refuted. 0 times theorem prover too weak. 8584 trivial. 0 not checked. [2021-12-06 19:47:57,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:47:57,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228131251] [2021-12-06 19:47:57,857 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 19:47:57,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929231965] [2021-12-06 19:47:57,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929231965] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:47:57,857 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:47:57,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2021-12-06 19:47:57,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972680110] [2021-12-06 19:47:57,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 19:47:57,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-06 19:47:57,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:47:57,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-06 19:47:57,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2021-12-06 19:47:57,861 INFO L87 Difference]: Start difference. First operand 1139 states and 1288 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, (137), 25 states have call predecessors, (137), 24 states have return successors, (136), 46 states have call predecessors, (136), 46 states have call successors, (136) [2021-12-06 19:47:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:47:59,128 INFO L93 Difference]: Finished difference Result 2420 states and 2833 transitions. [2021-12-06 19:47:59,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-12-06 19:47:59,129 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, (137), 25 states have call predecessors, (137), 24 states have return successors, (136), 46 states have call predecessors, (136), 46 states have call successors, (136) Word has length 437 [2021-12-06 19:47:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:47:59,140 INFO L225 Difference]: With dead ends: 2420 [2021-12-06 19:47:59,140 INFO L226 Difference]: Without dead ends: 2411 [2021-12-06 19:47:59,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 917 GetRequests, 824 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2021-12-06 19:47:59,143 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 475 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 19:47:59,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 809 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 19:47:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2021-12-06 19:47:59,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2411. [2021-12-06 19:47:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 1594 states have (on average 1.0878293601003763) internal successors, (1734), 1640 states have internal predecessors, (1734), 498 states have call successors, (498), 318 states have call predecessors, (498), 318 states have return successors, (496), 452 states have call predecessors, (496), 496 states have call successors, (496) [2021-12-06 19:47:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2728 transitions. [2021-12-06 19:47:59,278 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2728 transitions. Word has length 437 [2021-12-06 19:47:59,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:47:59,279 INFO L470 AbstractCegarLoop]: Abstraction has 2411 states and 2728 transitions. [2021-12-06 19:47:59,280 INFO L471 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, (137), 25 states have call predecessors, (137), 24 states have return successors, (136), 46 states have call predecessors, (136), 46 states have call successors, (136) [2021-12-06 19:47:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2728 transitions. [2021-12-06 19:47:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2021-12-06 19:47:59,306 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:47:59,307 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:47:59,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-06 19:47:59,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:59,508 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:47:59,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:47:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash -776415410, now seen corresponding path program 5 times [2021-12-06 19:47:59,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:47:59,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086317329] [2021-12-06 19:47:59,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:47:59,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:47:59,561 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 19:47:59,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1244806550] [2021-12-06 19:47:59,561 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-06 19:47:59,562 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:47:59,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:47:59,564 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:47:59,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 19:49:07,241 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2021-12-06 19:49:07,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:49:07,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 95 conjunts are in the unsatisfiable core [2021-12-06 19:49:07,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:49:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 44597 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2021-12-06 19:49:08,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:49:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 7337 refuted. 0 times theorem prover too weak. 37816 trivial. 0 not checked. [2021-12-06 19:49:10,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:49:10,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086317329] [2021-12-06 19:49:10,525 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 19:49:10,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244806550] [2021-12-06 19:49:10,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244806550] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:49:10,525 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:49:10,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2021-12-06 19:49:10,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132193694] [2021-12-06 19:49:10,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 19:49:10,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2021-12-06 19:49:10,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:49:10,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-12-06 19:49:10,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2021-12-06 19:49:10,532 INFO L87 Difference]: Start difference. First operand 2411 states and 2728 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, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 94 states have call predecessors, (280), 94 states have call successors, (280) [2021-12-06 19:49:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:49:15,075 INFO L93 Difference]: Finished difference Result 4964 states and 5809 transitions. [2021-12-06 19:49:15,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2021-12-06 19:49:15,077 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, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 94 states have call predecessors, (280), 94 states have call successors, (280) Word has length 893 [2021-12-06 19:49:15,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:49:15,097 INFO L225 Difference]: With dead ends: 4964 [2021-12-06 19:49:15,097 INFO L226 Difference]: Without dead ends: 4955 [2021-12-06 19:49:15,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1877 GetRequests, 1688 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2021-12-06 19:49:15,108 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 2126 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 1607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2126 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 3245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-06 19:49:15,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2126 Valid, 1224 Invalid, 3245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1607 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-06 19:49:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4955 states. [2021-12-06 19:49:15,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4955 to 4955. [2021-12-06 19:49:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4955 states, 3274 states have (on average 1.0867440439828955) internal successors, (3558), 3368 states have internal predecessors, (3558), 1026 states have call successors, (1026), 654 states have call predecessors, (1026), 654 states have return successors, (1024), 932 states have call predecessors, (1024), 1024 states have call successors, (1024) [2021-12-06 19:49:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 5608 transitions. [2021-12-06 19:49:15,382 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 5608 transitions. Word has length 893 [2021-12-06 19:49:15,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:49:15,384 INFO L470 AbstractCegarLoop]: Abstraction has 4955 states and 5608 transitions. [2021-12-06 19:49:15,385 INFO L471 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, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 94 states have call predecessors, (280), 94 states have call successors, (280) [2021-12-06 19:49:15,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 5608 transitions. [2021-12-06 19:49:15,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1806 [2021-12-06 19:49:15,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:49:15,431 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:49:15,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 19:49:15,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-06 19:49:15,632 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:49:15,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:49:15,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1655802702, now seen corresponding path program 6 times [2021-12-06 19:49:15,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:49:15,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954156571] [2021-12-06 19:49:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:49:15,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:49:15,701 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 19:49:15,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [194776544] [2021-12-06 19:49:15,701 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-06 19:49:15,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:49:15,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:49:15,704 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:49:15,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 19:50:18,394 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 179 check-sat command(s) [2021-12-06 19:50:18,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 19:50:18,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 3826 conjuncts, 191 conjunts are in the unsatisfiable core [2021-12-06 19:50:18,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:50:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 189837 backedges. 564 proven. 188141 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2021-12-06 19:50:21,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:50:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 189837 backedges. 564 proven. 30785 refuted. 0 times theorem prover too weak. 158488 trivial. 0 not checked. [2021-12-06 19:50:23,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:50:23,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954156571] [2021-12-06 19:50:23,231 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 19:50:23,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194776544] [2021-12-06 19:50:23,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194776544] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:50:23,231 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 19:50:23,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2021-12-06 19:50:23,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377241372] [2021-12-06 19:50:23,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 19:50:23,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2021-12-06 19:50:23,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:50:23,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-12-06 19:50:23,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2021-12-06 19:50:23,238 INFO L87 Difference]: Start difference. First operand 4955 states and 5608 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, (569), 97 states have call predecessors, (569), 96 states have return successors, (568), 100 states have call predecessors, (568), 100 states have call successors, (568) [2021-12-06 19:50:27,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:50:27,532 INFO L93 Difference]: Finished difference Result 5282 states and 6001 transitions. [2021-12-06 19:50:27,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2021-12-06 19:50:27,533 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, (569), 97 states have call predecessors, (569), 96 states have return successors, (568), 100 states have call predecessors, (568), 100 states have call successors, (568) Word has length 1805 [2021-12-06 19:50:27,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:50:27,555 INFO L225 Difference]: With dead ends: 5282 [2021-12-06 19:50:27,555 INFO L226 Difference]: Without dead ends: 5273 [2021-12-06 19:50:27,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3707 GetRequests, 3505 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5055 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2021-12-06 19:50:27,559 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 971 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 2429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:50:27,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [971 Valid, 1323 Invalid, 2429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-06 19:50:27,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5273 states. [2021-12-06 19:50:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5273 to 5273. [2021-12-06 19:50:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 3484 states have (on average 1.0866819747416763) internal successors, (3786), 3584 states have internal predecessors, (3786), 1092 states have call successors, (1092), 696 states have call predecessors, (1092), 696 states have return successors, (1090), 992 states have call predecessors, (1090), 1090 states have call successors, (1090) [2021-12-06 19:50:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 5968 transitions. [2021-12-06 19:50:27,813 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 5968 transitions. Word has length 1805 [2021-12-06 19:50:27,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:50:27,816 INFO L470 AbstractCegarLoop]: Abstraction has 5273 states and 5968 transitions. [2021-12-06 19:50:27,817 INFO L471 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, (569), 97 states have call predecessors, (569), 96 states have return successors, (568), 100 states have call predecessors, (568), 100 states have call successors, (568) [2021-12-06 19:50:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 5968 transitions. [2021-12-06 19:50:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1920 [2021-12-06 19:50:27,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:50:27,871 INFO L514 BasicCegarLoop]: 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] [2021-12-06 19:50:27,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-06 19:50:28,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-06 19:50:28,072 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:50:28,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:50:28,073 INFO L85 PathProgramCache]: Analyzing trace with hash 65851854, now seen corresponding path program 7 times [2021-12-06 19:50:28,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:50:28,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811124248] [2021-12-06 19:50:28,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:50:28,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:50:28,121 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 19:50:28,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58313226] [2021-12-06 19:50:28,122 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-06 19:50:28,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:50:28,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:50:28,123 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:50:28,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-06 19:50:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 19:50:28,924 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 19:50:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 19:50:29,595 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 19:50:29,595 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 19:50:29,595 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 19:50:29,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-06 19:50:29,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-06 19:50:29,807 INFO L732 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:50:29,823 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 19:50:30,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:50:30 BoogieIcfgContainer [2021-12-06 19:50:30,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 19:50:30,088 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 19:50:30,088 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 19:50:30,089 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 19:50:30,089 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:47:48" (3/4) ... [2021-12-06 19:50:30,091 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 19:50:30,424 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 19:50:30,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 19:50:30,424 INFO L158 Benchmark]: Toolchain (without parser) took 162427.05ms. Allocated memory was 115.3MB in the beginning and 293.6MB in the end (delta: 178.3MB). Free memory was 78.7MB in the beginning and 167.7MB in the end (delta: -89.0MB). Peak memory consumption was 126.9MB. Max. memory is 16.1GB. [2021-12-06 19:50:30,425 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 19:50:30,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.80ms. Allocated memory is still 115.3MB. Free memory was 78.5MB in the beginning and 90.8MB in the end (delta: -12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 19:50:30,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.85ms. Allocated memory is still 115.3MB. Free memory was 90.8MB in the beginning and 89.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 19:50:30,425 INFO L158 Benchmark]: Boogie Preprocessor took 18.34ms. Allocated memory is still 115.3MB. Free memory was 89.2MB in the beginning and 88.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 19:50:30,425 INFO L158 Benchmark]: RCFGBuilder took 206.55ms. Allocated memory is still 115.3MB. Free memory was 88.1MB in the beginning and 78.2MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 19:50:30,426 INFO L158 Benchmark]: TraceAbstraction took 161643.58ms. Allocated memory was 115.3MB in the beginning and 293.6MB in the end (delta: 178.3MB). Free memory was 77.6MB in the beginning and 183.4MB in the end (delta: -105.8MB). Peak memory consumption was 164.4MB. Max. memory is 16.1GB. [2021-12-06 19:50:30,426 INFO L158 Benchmark]: Witness Printer took 335.66ms. Allocated memory is still 293.6MB. Free memory was 183.3MB in the beginning and 167.7MB in the end (delta: 15.6MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2021-12-06 19:50:30,427 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.80ms. Allocated memory is still 115.3MB. Free memory was 78.5MB in the beginning and 90.8MB in the end (delta: -12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.85ms. Allocated memory is still 115.3MB. Free memory was 90.8MB in the beginning and 89.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.34ms. Allocated memory is still 115.3MB. Free memory was 89.2MB in the beginning and 88.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 206.55ms. Allocated memory is still 115.3MB. Free memory was 88.1MB in the beginning and 78.2MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 161643.58ms. Allocated memory was 115.3MB in the beginning and 293.6MB in the end (delta: 178.3MB). Free memory was 77.6MB in the beginning and 183.4MB in the end (delta: -105.8MB). Peak memory consumption was 164.4MB. Max. memory is 16.1GB. * Witness Printer took 335.66ms. Allocated memory is still 293.6MB. Free memory was 183.3MB in the beginning and 167.7MB in the end (delta: 15.6MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=203, y=2] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=203, y=2] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=203, b=2, counter=0, p=1, q=0, r=0, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=203, b=2, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=203, y=2] [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, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=203, b=2, counter=1, p=1, q=0, r=0, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=203, b=2, counter=1, p=1, q=0, r=0, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=203, b=2, counter=1, p=1, q=0, r=0, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=203, b=2, counter=1, p=1, q=0, r=0, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=201, b=2, counter=1, p=1, q=0, r=-1, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=201, b=2, counter=2, counter++=1, p=1, q=0, r=-1, s=1, x=203, y=2] [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, cond=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=201, b=2, counter=2, p=1, q=0, r=-1, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=201, b=2, counter=2, p=1, q=0, r=-1, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=201, b=2, counter=2, p=1, q=0, r=-1, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=201, b=2, counter=2, p=1, q=0, r=-1, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=199, b=2, counter=2, p=1, q=0, r=-2, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=199, b=2, counter=3, counter++=2, p=1, q=0, r=-2, s=1, x=203, y=2] [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, cond=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=199, b=2, counter=3, p=1, q=0, r=-2, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=199, b=2, counter=3, p=1, q=0, r=-2, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=199, b=2, counter=3, p=1, q=0, r=-2, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=199, b=2, counter=3, p=1, q=0, r=-2, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=197, b=2, counter=3, p=1, q=0, r=-3, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=197, b=2, counter=4, counter++=3, p=1, q=0, r=-3, s=1, x=203, y=2] [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, cond=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=197, b=2, counter=4, p=1, q=0, r=-3, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=197, b=2, counter=4, p=1, q=0, r=-3, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=197, b=2, counter=4, p=1, q=0, r=-3, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=197, b=2, counter=4, p=1, q=0, r=-3, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=195, b=2, counter=4, p=1, q=0, r=-4, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=195, b=2, counter=5, counter++=4, p=1, q=0, r=-4, s=1, x=203, y=2] [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, cond=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=195, b=2, counter=5, p=1, q=0, r=-4, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=195, b=2, counter=5, p=1, q=0, r=-4, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=195, b=2, counter=5, p=1, q=0, r=-4, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=195, b=2, counter=5, p=1, q=0, r=-4, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=193, b=2, counter=5, p=1, q=0, r=-5, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=193, b=2, counter=6, counter++=5, p=1, q=0, r=-5, s=1, x=203, y=2] [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, cond=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=193, b=2, counter=6, p=1, q=0, r=-5, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=193, b=2, counter=6, p=1, q=0, r=-5, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=193, b=2, counter=6, p=1, q=0, r=-5, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=193, b=2, counter=6, p=1, q=0, r=-5, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=191, b=2, counter=6, p=1, q=0, r=-6, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=191, b=2, counter=7, counter++=6, p=1, q=0, r=-6, s=1, x=203, y=2] [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, cond=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=191, b=2, counter=7, p=1, q=0, r=-6, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=191, b=2, counter=7, p=1, q=0, r=-6, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=191, b=2, counter=7, p=1, q=0, r=-6, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=191, b=2, counter=7, p=1, q=0, r=-6, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=189, b=2, counter=7, p=1, q=0, r=-7, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=189, b=2, counter=8, counter++=7, p=1, q=0, r=-7, s=1, x=203, y=2] [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, cond=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=189, b=2, counter=8, p=1, q=0, r=-7, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=189, b=2, counter=8, p=1, q=0, r=-7, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=189, b=2, counter=8, p=1, q=0, r=-7, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=189, b=2, counter=8, p=1, q=0, r=-7, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=187, b=2, counter=8, p=1, q=0, r=-8, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=187, b=2, counter=9, counter++=8, p=1, q=0, r=-8, s=1, x=203, y=2] [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, cond=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=187, b=2, counter=9, p=1, q=0, r=-8, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=187, b=2, counter=9, p=1, q=0, r=-8, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=187, b=2, counter=9, p=1, q=0, r=-8, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=187, b=2, counter=9, p=1, q=0, r=-8, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=185, b=2, counter=9, p=1, q=0, r=-9, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=185, b=2, counter=10, counter++=9, p=1, q=0, r=-9, s=1, x=203, y=2] [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, cond=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=185, b=2, counter=10, p=1, q=0, r=-9, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=185, b=2, counter=10, p=1, q=0, r=-9, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=185, b=2, counter=10, p=1, q=0, r=-9, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=185, b=2, counter=10, p=1, q=0, r=-9, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=183, b=2, counter=10, p=1, q=0, r=-10, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=183, b=2, counter=11, counter++=10, p=1, q=0, r=-10, s=1, x=203, y=2] [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, cond=1, counter=11] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=183, b=2, counter=11, p=1, q=0, r=-10, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=183, b=2, counter=11, p=1, q=0, r=-10, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=183, b=2, counter=11, p=1, q=0, r=-10, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=183, b=2, counter=11, p=1, q=0, r=-10, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=181, b=2, counter=11, p=1, q=0, r=-11, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=181, b=2, counter=12, counter++=11, p=1, q=0, r=-11, s=1, x=203, y=2] [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, cond=1, counter=12] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=181, b=2, counter=12, p=1, q=0, r=-11, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=181, b=2, counter=12, p=1, q=0, r=-11, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=181, b=2, counter=12, p=1, q=0, r=-11, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=181, b=2, counter=12, p=1, q=0, r=-11, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=179, b=2, counter=12, p=1, q=0, r=-12, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=179, b=2, counter=13, counter++=12, p=1, q=0, r=-12, s=1, x=203, y=2] [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, cond=1, counter=13] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=179, b=2, counter=13, p=1, q=0, r=-12, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=179, b=2, counter=13, p=1, q=0, r=-12, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=179, b=2, counter=13, p=1, q=0, r=-12, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=179, b=2, counter=13, p=1, q=0, r=-12, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=177, b=2, counter=13, p=1, q=0, r=-13, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=177, b=2, counter=14, counter++=13, p=1, q=0, r=-13, s=1, x=203, y=2] [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, cond=1, counter=14] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=177, b=2, counter=14, p=1, q=0, r=-13, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=177, b=2, counter=14, p=1, q=0, r=-13, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=177, b=2, counter=14, p=1, q=0, r=-13, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=177, b=2, counter=14, p=1, q=0, r=-13, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=175, b=2, counter=14, p=1, q=0, r=-14, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=175, b=2, counter=15, counter++=14, p=1, q=0, r=-14, s=1, x=203, y=2] [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, cond=1, counter=15] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=175, b=2, counter=15, p=1, q=0, r=-14, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=175, b=2, counter=15, p=1, q=0, r=-14, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=175, b=2, counter=15, p=1, q=0, r=-14, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=175, b=2, counter=15, p=1, q=0, r=-14, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=173, b=2, counter=15, p=1, q=0, r=-15, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=173, b=2, counter=16, counter++=15, p=1, q=0, r=-15, s=1, x=203, y=2] [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, cond=1, counter=16] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=173, b=2, counter=16, p=1, q=0, r=-15, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=173, b=2, counter=16, p=1, q=0, r=-15, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=173, b=2, counter=16, p=1, q=0, r=-15, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=173, b=2, counter=16, p=1, q=0, r=-15, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=171, b=2, counter=16, p=1, q=0, r=-16, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=171, b=2, counter=17, counter++=16, p=1, q=0, r=-16, s=1, x=203, y=2] [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, cond=1, counter=17] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=171, b=2, counter=17, p=1, q=0, r=-16, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=171, b=2, counter=17, p=1, q=0, r=-16, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=171, b=2, counter=17, p=1, q=0, r=-16, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=171, b=2, counter=17, p=1, q=0, r=-16, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=169, b=2, counter=17, p=1, q=0, r=-17, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=169, b=2, counter=18, counter++=17, p=1, q=0, r=-17, s=1, x=203, y=2] [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, cond=1, counter=18] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=169, b=2, counter=18, p=1, q=0, r=-17, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=169, b=2, counter=18, p=1, q=0, r=-17, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=169, b=2, counter=18, p=1, q=0, r=-17, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=169, b=2, counter=18, p=1, q=0, r=-17, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=167, b=2, counter=18, p=1, q=0, r=-18, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=167, b=2, counter=19, counter++=18, p=1, q=0, r=-18, s=1, x=203, y=2] [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, cond=1, counter=19] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=167, b=2, counter=19, p=1, q=0, r=-18, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=167, b=2, counter=19, p=1, q=0, r=-18, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=167, b=2, counter=19, p=1, q=0, r=-18, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=167, b=2, counter=19, p=1, q=0, r=-18, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=165, b=2, counter=19, p=1, q=0, r=-19, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=165, b=2, counter=20, counter++=19, p=1, q=0, r=-19, s=1, x=203, y=2] [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, cond=1, counter=20] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=165, b=2, counter=20, p=1, q=0, r=-19, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=165, b=2, counter=20, p=1, q=0, r=-19, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=165, b=2, counter=20, p=1, q=0, r=-19, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=165, b=2, counter=20, p=1, q=0, r=-19, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=163, b=2, counter=20, p=1, q=0, r=-20, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=163, b=2, counter=21, counter++=20, p=1, q=0, r=-20, s=1, x=203, y=2] [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, cond=1, counter=21] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=163, b=2, counter=21, p=1, q=0, r=-20, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=163, b=2, counter=21, p=1, q=0, r=-20, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=163, b=2, counter=21, p=1, q=0, r=-20, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=163, b=2, counter=21, p=1, q=0, r=-20, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=161, b=2, counter=21, p=1, q=0, r=-21, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=161, b=2, counter=22, counter++=21, p=1, q=0, r=-21, s=1, x=203, y=2] [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, cond=1, counter=22] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=161, b=2, counter=22, p=1, q=0, r=-21, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=161, b=2, counter=22, p=1, q=0, r=-21, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=161, b=2, counter=22, p=1, q=0, r=-21, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=161, b=2, counter=22, p=1, q=0, r=-21, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=159, b=2, counter=22, p=1, q=0, r=-22, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=159, b=2, counter=23, counter++=22, p=1, q=0, r=-22, s=1, x=203, y=2] [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, cond=1, counter=23] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=159, b=2, counter=23, p=1, q=0, r=-22, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=159, b=2, counter=23, p=1, q=0, r=-22, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=159, b=2, counter=23, p=1, q=0, r=-22, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=159, b=2, counter=23, p=1, q=0, r=-22, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=157, b=2, counter=23, p=1, q=0, r=-23, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=157, b=2, counter=24, counter++=23, p=1, q=0, r=-23, s=1, x=203, y=2] [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, cond=1, counter=24] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=157, b=2, counter=24, p=1, q=0, r=-23, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=157, b=2, counter=24, p=1, q=0, r=-23, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=157, b=2, counter=24, p=1, q=0, r=-23, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=157, b=2, counter=24, p=1, q=0, r=-23, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=155, b=2, counter=24, p=1, q=0, r=-24, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=155, b=2, counter=25, counter++=24, p=1, q=0, r=-24, s=1, x=203, y=2] [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, cond=1, counter=25] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=155, b=2, counter=25, p=1, q=0, r=-24, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=155, b=2, counter=25, p=1, q=0, r=-24, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=155, b=2, counter=25, p=1, q=0, r=-24, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=155, b=2, counter=25, p=1, q=0, r=-24, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=153, b=2, counter=25, p=1, q=0, r=-25, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=153, b=2, counter=26, counter++=25, p=1, q=0, r=-25, s=1, x=203, y=2] [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, cond=1, counter=26] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=153, b=2, counter=26, p=1, q=0, r=-25, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=153, b=2, counter=26, p=1, q=0, r=-25, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=153, b=2, counter=26, p=1, q=0, r=-25, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=153, b=2, counter=26, p=1, q=0, r=-25, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=151, b=2, counter=26, p=1, q=0, r=-26, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=151, b=2, counter=27, counter++=26, p=1, q=0, r=-26, s=1, x=203, y=2] [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, cond=1, counter=27] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=151, b=2, counter=27, p=1, q=0, r=-26, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=151, b=2, counter=27, p=1, q=0, r=-26, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=151, b=2, counter=27, p=1, q=0, r=-26, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=151, b=2, counter=27, p=1, q=0, r=-26, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=149, b=2, counter=27, p=1, q=0, r=-27, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=149, b=2, counter=28, counter++=27, p=1, q=0, r=-27, s=1, x=203, y=2] [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, cond=1, counter=28] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=149, b=2, counter=28, p=1, q=0, r=-27, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=149, b=2, counter=28, p=1, q=0, r=-27, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=149, b=2, counter=28, p=1, q=0, r=-27, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=149, b=2, counter=28, p=1, q=0, r=-27, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=147, b=2, counter=28, p=1, q=0, r=-28, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=147, b=2, counter=29, counter++=28, p=1, q=0, r=-28, s=1, x=203, y=2] [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, cond=1, counter=29] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=147, b=2, counter=29, p=1, q=0, r=-28, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=147, b=2, counter=29, p=1, q=0, r=-28, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=147, b=2, counter=29, p=1, q=0, r=-28, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=147, b=2, counter=29, p=1, q=0, r=-28, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=145, b=2, counter=29, p=1, q=0, r=-29, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=145, b=2, counter=30, counter++=29, p=1, q=0, r=-29, s=1, x=203, y=2] [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, cond=1, counter=30] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=145, b=2, counter=30, p=1, q=0, r=-29, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=145, b=2, counter=30, p=1, q=0, r=-29, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=145, b=2, counter=30, p=1, q=0, r=-29, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=145, b=2, counter=30, p=1, q=0, r=-29, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=143, b=2, counter=30, p=1, q=0, r=-30, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=143, b=2, counter=31, counter++=30, p=1, q=0, r=-30, s=1, x=203, y=2] [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, cond=1, counter=31] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=143, b=2, counter=31, p=1, q=0, r=-30, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=143, b=2, counter=31, p=1, q=0, r=-30, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=143, b=2, counter=31, p=1, q=0, r=-30, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=143, b=2, counter=31, p=1, q=0, r=-30, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=141, b=2, counter=31, p=1, q=0, r=-31, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=141, b=2, counter=32, counter++=31, p=1, q=0, r=-31, s=1, x=203, y=2] [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, cond=1, counter=32] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=141, b=2, counter=32, p=1, q=0, r=-31, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=141, b=2, counter=32, p=1, q=0, r=-31, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=141, b=2, counter=32, p=1, q=0, r=-31, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=141, b=2, counter=32, p=1, q=0, r=-31, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=139, b=2, counter=32, p=1, q=0, r=-32, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=139, b=2, counter=33, counter++=32, p=1, q=0, r=-32, s=1, x=203, y=2] [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, cond=1, counter=33] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=139, b=2, counter=33, p=1, q=0, r=-32, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=139, b=2, counter=33, p=1, q=0, r=-32, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=139, b=2, counter=33, p=1, q=0, r=-32, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=139, b=2, counter=33, p=1, q=0, r=-32, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=137, b=2, counter=33, p=1, q=0, r=-33, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=137, b=2, counter=34, counter++=33, p=1, q=0, r=-33, s=1, x=203, y=2] [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, cond=1, counter=34] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=137, b=2, counter=34, p=1, q=0, r=-33, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=137, b=2, counter=34, p=1, q=0, r=-33, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=137, b=2, counter=34, p=1, q=0, r=-33, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=137, b=2, counter=34, p=1, q=0, r=-33, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=135, b=2, counter=34, p=1, q=0, r=-34, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=135, b=2, counter=35, counter++=34, p=1, q=0, r=-34, s=1, x=203, y=2] [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, cond=1, counter=35] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=135, b=2, counter=35, p=1, q=0, r=-34, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=135, b=2, counter=35, p=1, q=0, r=-34, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=135, b=2, counter=35, p=1, q=0, r=-34, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=135, b=2, counter=35, p=1, q=0, r=-34, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=133, b=2, counter=35, p=1, q=0, r=-35, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=133, b=2, counter=36, counter++=35, p=1, q=0, r=-35, s=1, x=203, y=2] [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, cond=1, counter=36] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=133, b=2, counter=36, p=1, q=0, r=-35, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=133, b=2, counter=36, p=1, q=0, r=-35, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=133, b=2, counter=36, p=1, q=0, r=-35, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=133, b=2, counter=36, p=1, q=0, r=-35, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=131, b=2, counter=36, p=1, q=0, r=-36, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=131, b=2, counter=37, counter++=36, p=1, q=0, r=-36, s=1, x=203, y=2] [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, cond=1, counter=37] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=131, b=2, counter=37, p=1, q=0, r=-36, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=131, b=2, counter=37, p=1, q=0, r=-36, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=131, b=2, counter=37, p=1, q=0, r=-36, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=131, b=2, counter=37, p=1, q=0, r=-36, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=129, b=2, counter=37, p=1, q=0, r=-37, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=129, b=2, counter=38, counter++=37, p=1, q=0, r=-37, s=1, x=203, y=2] [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, cond=1, counter=38] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=129, b=2, counter=38, p=1, q=0, r=-37, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=129, b=2, counter=38, p=1, q=0, r=-37, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=129, b=2, counter=38, p=1, q=0, r=-37, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=129, b=2, counter=38, p=1, q=0, r=-37, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=127, b=2, counter=38, p=1, q=0, r=-38, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=127, b=2, counter=39, counter++=38, p=1, q=0, r=-38, s=1, x=203, y=2] [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, cond=1, counter=39] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=127, b=2, counter=39, p=1, q=0, r=-38, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=127, b=2, counter=39, p=1, q=0, r=-38, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=127, b=2, counter=39, p=1, q=0, r=-38, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=127, b=2, counter=39, p=1, q=0, r=-38, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=125, b=2, counter=39, p=1, q=0, r=-39, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=125, b=2, counter=40, counter++=39, p=1, q=0, r=-39, s=1, x=203, y=2] [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, cond=1, counter=40] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=125, b=2, counter=40, p=1, q=0, r=-39, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=125, b=2, counter=40, p=1, q=0, r=-39, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=125, b=2, counter=40, p=1, q=0, r=-39, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=125, b=2, counter=40, p=1, q=0, r=-39, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=123, b=2, counter=40, p=1, q=0, r=-40, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=123, b=2, counter=41, counter++=40, p=1, q=0, r=-40, s=1, x=203, y=2] [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, cond=1, counter=41] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=123, b=2, counter=41, p=1, q=0, r=-40, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=123, b=2, counter=41, p=1, q=0, r=-40, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=123, b=2, counter=41, p=1, q=0, r=-40, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=123, b=2, counter=41, p=1, q=0, r=-40, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=121, b=2, counter=41, p=1, q=0, r=-41, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=121, b=2, counter=42, counter++=41, p=1, q=0, r=-41, s=1, x=203, y=2] [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, cond=1, counter=42] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=121, b=2, counter=42, p=1, q=0, r=-41, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=121, b=2, counter=42, p=1, q=0, r=-41, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=121, b=2, counter=42, p=1, q=0, r=-41, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=121, b=2, counter=42, p=1, q=0, r=-41, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=119, b=2, counter=42, p=1, q=0, r=-42, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=119, b=2, counter=43, counter++=42, p=1, q=0, r=-42, s=1, x=203, y=2] [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, cond=1, counter=43] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=119, b=2, counter=43, p=1, q=0, r=-42, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=119, b=2, counter=43, p=1, q=0, r=-42, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=119, b=2, counter=43, p=1, q=0, r=-42, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=119, b=2, counter=43, p=1, q=0, r=-42, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=117, b=2, counter=43, p=1, q=0, r=-43, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=117, b=2, counter=44, counter++=43, p=1, q=0, r=-43, s=1, x=203, y=2] [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, cond=1, counter=44] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=117, b=2, counter=44, p=1, q=0, r=-43, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=117, b=2, counter=44, p=1, q=0, r=-43, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=117, b=2, counter=44, p=1, q=0, r=-43, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=117, b=2, counter=44, p=1, q=0, r=-43, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=115, b=2, counter=44, p=1, q=0, r=-44, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=115, b=2, counter=45, counter++=44, p=1, q=0, r=-44, s=1, x=203, y=2] [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, cond=1, counter=45] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=115, b=2, counter=45, p=1, q=0, r=-44, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=115, b=2, counter=45, p=1, q=0, r=-44, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=115, b=2, counter=45, p=1, q=0, r=-44, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=115, b=2, counter=45, p=1, q=0, r=-44, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=113, b=2, counter=45, p=1, q=0, r=-45, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=113, b=2, counter=46, counter++=45, p=1, q=0, r=-45, s=1, x=203, y=2] [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, cond=1, counter=46] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=113, b=2, counter=46, p=1, q=0, r=-45, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=113, b=2, counter=46, p=1, q=0, r=-45, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=113, b=2, counter=46, p=1, q=0, r=-45, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=113, b=2, counter=46, p=1, q=0, r=-45, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=111, b=2, counter=46, p=1, q=0, r=-46, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=111, b=2, counter=47, counter++=46, p=1, q=0, r=-46, s=1, x=203, y=2] [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, cond=1, counter=47] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=111, b=2, counter=47, p=1, q=0, r=-46, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=111, b=2, counter=47, p=1, q=0, r=-46, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=111, b=2, counter=47, p=1, q=0, r=-46, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=111, b=2, counter=47, p=1, q=0, r=-46, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=109, b=2, counter=47, p=1, q=0, r=-47, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=109, b=2, counter=48, counter++=47, p=1, q=0, r=-47, s=1, x=203, y=2] [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, cond=1, counter=48] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=109, b=2, counter=48, p=1, q=0, r=-47, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=109, b=2, counter=48, p=1, q=0, r=-47, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=109, b=2, counter=48, p=1, q=0, r=-47, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=109, b=2, counter=48, p=1, q=0, r=-47, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=107, b=2, counter=48, p=1, q=0, r=-48, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=107, b=2, counter=49, counter++=48, p=1, q=0, r=-48, s=1, x=203, y=2] [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, cond=1, counter=49] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=107, b=2, counter=49, p=1, q=0, r=-48, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=107, b=2, counter=49, p=1, q=0, r=-48, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=107, b=2, counter=49, p=1, q=0, r=-48, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=107, b=2, counter=49, p=1, q=0, r=-48, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=105, b=2, counter=49, p=1, q=0, r=-49, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=105, b=2, counter=50, counter++=49, p=1, q=0, r=-49, s=1, x=203, y=2] [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, cond=1, counter=50] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=105, b=2, counter=50, p=1, q=0, r=-49, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=105, b=2, counter=50, p=1, q=0, r=-49, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=105, b=2, counter=50, p=1, q=0, r=-49, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=105, b=2, counter=50, p=1, q=0, r=-49, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=103, b=2, counter=50, p=1, q=0, r=-50, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=103, b=2, counter=51, counter++=50, p=1, q=0, r=-50, s=1, x=203, y=2] [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, cond=1, counter=51] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=103, b=2, counter=51, p=1, q=0, r=-50, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=51] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=103, b=2, counter=51, p=1, q=0, r=-50, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=51] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=103, b=2, counter=51, p=1, q=0, r=-50, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=103, b=2, counter=51, p=1, q=0, r=-50, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=101, b=2, counter=51, p=1, q=0, r=-51, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=101, b=2, counter=52, counter++=51, p=1, q=0, r=-51, s=1, x=203, y=2] [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, cond=1, counter=52] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=101, b=2, counter=52, p=1, q=0, r=-51, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=52] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=101, b=2, counter=52, p=1, q=0, r=-51, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=52] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=101, b=2, counter=52, p=1, q=0, r=-51, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=101, b=2, counter=52, p=1, q=0, r=-51, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=99, b=2, counter=52, p=1, q=0, r=-52, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=99, b=2, counter=53, counter++=52, p=1, q=0, r=-52, s=1, x=203, y=2] [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, cond=1, counter=53] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=99, b=2, counter=53, p=1, q=0, r=-52, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=99, b=2, counter=53, p=1, q=0, r=-52, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=99, b=2, counter=53, p=1, q=0, r=-52, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=99, b=2, counter=53, p=1, q=0, r=-52, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=97, b=2, counter=53, p=1, q=0, r=-53, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=97, b=2, counter=54, counter++=53, p=1, q=0, r=-53, s=1, x=203, y=2] [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, cond=1, counter=54] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=97, b=2, counter=54, p=1, q=0, r=-53, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=54] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=97, b=2, counter=54, p=1, q=0, r=-53, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=54] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=97, b=2, counter=54, p=1, q=0, r=-53, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=97, b=2, counter=54, p=1, q=0, r=-53, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=95, b=2, counter=54, p=1, q=0, r=-54, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=95, b=2, counter=55, counter++=54, p=1, q=0, r=-54, s=1, x=203, y=2] [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, cond=1, counter=55] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=95, b=2, counter=55, p=1, q=0, r=-54, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=55] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=95, b=2, counter=55, p=1, q=0, r=-54, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=55] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=95, b=2, counter=55, p=1, q=0, r=-54, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=95, b=2, counter=55, p=1, q=0, r=-54, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=93, b=2, counter=55, p=1, q=0, r=-55, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=93, b=2, counter=56, counter++=55, p=1, q=0, r=-55, s=1, x=203, y=2] [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, cond=1, counter=56] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=93, b=2, counter=56, p=1, q=0, r=-55, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=56] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=93, b=2, counter=56, p=1, q=0, r=-55, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=56] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=93, b=2, counter=56, p=1, q=0, r=-55, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=93, b=2, counter=56, p=1, q=0, r=-55, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=91, b=2, counter=56, p=1, q=0, r=-56, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=91, b=2, counter=57, counter++=56, p=1, q=0, r=-56, s=1, x=203, y=2] [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, cond=1, counter=57] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=91, b=2, counter=57, p=1, q=0, r=-56, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=91, b=2, counter=57, p=1, q=0, r=-56, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=91, b=2, counter=57, p=1, q=0, r=-56, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=91, b=2, counter=57, p=1, q=0, r=-56, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=89, b=2, counter=57, p=1, q=0, r=-57, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=89, b=2, counter=58, counter++=57, p=1, q=0, r=-57, s=1, x=203, y=2] [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, cond=1, counter=58] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=89, b=2, counter=58, p=1, q=0, r=-57, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=58] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=89, b=2, counter=58, p=1, q=0, r=-57, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=58] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=89, b=2, counter=58, p=1, q=0, r=-57, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=89, b=2, counter=58, p=1, q=0, r=-57, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=87, b=2, counter=58, p=1, q=0, r=-58, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=87, b=2, counter=59, counter++=58, p=1, q=0, r=-58, s=1, x=203, y=2] [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, cond=1, counter=59] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=87, b=2, counter=59, p=1, q=0, r=-58, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=59] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=87, b=2, counter=59, p=1, q=0, r=-58, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=59] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=87, b=2, counter=59, p=1, q=0, r=-58, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=87, b=2, counter=59, p=1, q=0, r=-58, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=85, b=2, counter=59, p=1, q=0, r=-59, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=85, b=2, counter=60, counter++=59, p=1, q=0, r=-59, s=1, x=203, y=2] [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, cond=1, counter=60] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=85, b=2, counter=60, p=1, q=0, r=-59, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=60] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=85, b=2, counter=60, p=1, q=0, r=-59, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=60] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=85, b=2, counter=60, p=1, q=0, r=-59, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=85, b=2, counter=60, p=1, q=0, r=-59, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=83, b=2, counter=60, p=1, q=0, r=-60, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=83, b=2, counter=61, counter++=60, p=1, q=0, r=-60, s=1, x=203, y=2] [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, cond=1, counter=61] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=83, b=2, counter=61, p=1, q=0, r=-60, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=83, b=2, counter=61, p=1, q=0, r=-60, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=83, b=2, counter=61, p=1, q=0, r=-60, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=83, b=2, counter=61, p=1, q=0, r=-60, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=81, b=2, counter=61, p=1, q=0, r=-61, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=81, b=2, counter=62, counter++=61, p=1, q=0, r=-61, s=1, x=203, y=2] [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, cond=1, counter=62] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=81, b=2, counter=62, p=1, q=0, r=-61, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=62] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=81, b=2, counter=62, p=1, q=0, r=-61, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=62] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=81, b=2, counter=62, p=1, q=0, r=-61, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=81, b=2, counter=62, p=1, q=0, r=-61, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=79, b=2, counter=62, p=1, q=0, r=-62, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=79, b=2, counter=63, counter++=62, p=1, q=0, r=-62, s=1, x=203, y=2] [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, cond=1, counter=63] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=79, b=2, counter=63, p=1, q=0, r=-62, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=63] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=79, b=2, counter=63, p=1, q=0, r=-62, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=63] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=79, b=2, counter=63, p=1, q=0, r=-62, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=79, b=2, counter=63, p=1, q=0, r=-62, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=77, b=2, counter=63, p=1, q=0, r=-63, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=77, b=2, counter=64, counter++=63, p=1, q=0, r=-63, s=1, x=203, y=2] [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, cond=1, counter=64] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=77, b=2, counter=64, p=1, q=0, r=-63, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=64] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=77, b=2, counter=64, p=1, q=0, r=-63, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=64] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=77, b=2, counter=64, p=1, q=0, r=-63, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=77, b=2, counter=64, p=1, q=0, r=-63, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=75, b=2, counter=64, p=1, q=0, r=-64, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=75, b=2, counter=65, counter++=64, p=1, q=0, r=-64, s=1, x=203, y=2] [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, cond=1, counter=65] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=75, b=2, counter=65, p=1, q=0, r=-64, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=75, b=2, counter=65, p=1, q=0, r=-64, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=75, b=2, counter=65, p=1, q=0, r=-64, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=75, b=2, counter=65, p=1, q=0, r=-64, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=73, b=2, counter=65, p=1, q=0, r=-65, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=73, b=2, counter=66, counter++=65, p=1, q=0, r=-65, s=1, x=203, y=2] [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, cond=1, counter=66] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=73, b=2, counter=66, p=1, q=0, r=-65, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=66] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=73, b=2, counter=66, p=1, q=0, r=-65, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=66] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=73, b=2, counter=66, p=1, q=0, r=-65, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=73, b=2, counter=66, p=1, q=0, r=-65, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=71, b=2, counter=66, p=1, q=0, r=-66, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=71, b=2, counter=67, counter++=66, p=1, q=0, r=-66, s=1, x=203, y=2] [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, cond=1, counter=67] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=71, b=2, counter=67, p=1, q=0, r=-66, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=67] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=71, b=2, counter=67, p=1, q=0, r=-66, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=67] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=71, b=2, counter=67, p=1, q=0, r=-66, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=71, b=2, counter=67, p=1, q=0, r=-66, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=69, b=2, counter=67, p=1, q=0, r=-67, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=69, b=2, counter=68, counter++=67, p=1, q=0, r=-67, s=1, x=203, y=2] [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, cond=1, counter=68] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=69, b=2, counter=68, p=1, q=0, r=-67, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=68] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=69, b=2, counter=68, p=1, q=0, r=-67, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=68] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=69, b=2, counter=68, p=1, q=0, r=-67, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=69, b=2, counter=68, p=1, q=0, r=-67, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=67, b=2, counter=68, p=1, q=0, r=-68, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=67, b=2, counter=69, counter++=68, p=1, q=0, r=-68, s=1, x=203, y=2] [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, cond=1, counter=69] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=67, b=2, counter=69, p=1, q=0, r=-68, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=67, b=2, counter=69, p=1, q=0, r=-68, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=67, b=2, counter=69, p=1, q=0, r=-68, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=67, b=2, counter=69, p=1, q=0, r=-68, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=65, b=2, counter=69, p=1, q=0, r=-69, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=65, b=2, counter=70, counter++=69, p=1, q=0, r=-69, s=1, x=203, y=2] [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, cond=1, counter=70] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=65, b=2, counter=70, p=1, q=0, r=-69, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=70] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=65, b=2, counter=70, p=1, q=0, r=-69, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=70] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=65, b=2, counter=70, p=1, q=0, r=-69, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=65, b=2, counter=70, p=1, q=0, r=-69, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=63, b=2, counter=70, p=1, q=0, r=-70, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=63, b=2, counter=71, counter++=70, p=1, q=0, r=-70, s=1, x=203, y=2] [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, cond=1, counter=71] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=63, b=2, counter=71, p=1, q=0, r=-70, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=71] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=63, b=2, counter=71, p=1, q=0, r=-70, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=71] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=63, b=2, counter=71, p=1, q=0, r=-70, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=63, b=2, counter=71, p=1, q=0, r=-70, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=61, b=2, counter=71, p=1, q=0, r=-71, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=61, b=2, counter=72, counter++=71, p=1, q=0, r=-71, s=1, x=203, y=2] [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, cond=1, counter=72] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=61, b=2, counter=72, p=1, q=0, r=-71, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=72] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=61, b=2, counter=72, p=1, q=0, r=-71, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=72] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=61, b=2, counter=72, p=1, q=0, r=-71, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=61, b=2, counter=72, p=1, q=0, r=-71, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=59, b=2, counter=72, p=1, q=0, r=-72, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=59, b=2, counter=73, counter++=72, p=1, q=0, r=-72, s=1, x=203, y=2] [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, cond=1, counter=73] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=59, b=2, counter=73, p=1, q=0, r=-72, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=59, b=2, counter=73, p=1, q=0, r=-72, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=59, b=2, counter=73, p=1, q=0, r=-72, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=59, b=2, counter=73, p=1, q=0, r=-72, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=57, b=2, counter=73, p=1, q=0, r=-73, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=57, b=2, counter=74, counter++=73, p=1, q=0, r=-73, s=1, x=203, y=2] [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, cond=1, counter=74] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=57, b=2, counter=74, p=1, q=0, r=-73, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=74] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=57, b=2, counter=74, p=1, q=0, r=-73, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=74] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=57, b=2, counter=74, p=1, q=0, r=-73, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=57, b=2, counter=74, p=1, q=0, r=-73, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=55, b=2, counter=74, p=1, q=0, r=-74, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=55, b=2, counter=75, counter++=74, p=1, q=0, r=-74, s=1, x=203, y=2] [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, cond=1, counter=75] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=55, b=2, counter=75, p=1, q=0, r=-74, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=75] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=55, b=2, counter=75, p=1, q=0, r=-74, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=75] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=55, b=2, counter=75, p=1, q=0, r=-74, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=55, b=2, counter=75, p=1, q=0, r=-74, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=53, b=2, counter=75, p=1, q=0, r=-75, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=53, b=2, counter=76, counter++=75, p=1, q=0, r=-75, s=1, x=203, y=2] [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, cond=1, counter=76] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=53, b=2, counter=76, p=1, q=0, r=-75, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=76] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=53, b=2, counter=76, p=1, q=0, r=-75, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=76] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=53, b=2, counter=76, p=1, q=0, r=-75, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=53, b=2, counter=76, p=1, q=0, r=-75, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=51, b=2, counter=76, p=1, q=0, r=-76, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=51, b=2, counter=77, counter++=76, p=1, q=0, r=-76, s=1, x=203, y=2] [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, cond=1, counter=77] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=51, b=2, counter=77, p=1, q=0, r=-76, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=51, b=2, counter=77, p=1, q=0, r=-76, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=51, b=2, counter=77, p=1, q=0, r=-76, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=51, b=2, counter=77, p=1, q=0, r=-76, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=49, b=2, counter=77, p=1, q=0, r=-77, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=49, b=2, counter=78, counter++=77, p=1, q=0, r=-77, s=1, x=203, y=2] [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, cond=1, counter=78] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=49, b=2, counter=78, p=1, q=0, r=-77, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=78] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=49, b=2, counter=78, p=1, q=0, r=-77, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=78] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=49, b=2, counter=78, p=1, q=0, r=-77, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=49, b=2, counter=78, p=1, q=0, r=-77, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=47, b=2, counter=78, p=1, q=0, r=-78, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=47, b=2, counter=79, counter++=78, p=1, q=0, r=-78, s=1, x=203, y=2] [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, cond=1, counter=79] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=47, b=2, counter=79, p=1, q=0, r=-78, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=79] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=47, b=2, counter=79, p=1, q=0, r=-78, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=79] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=47, b=2, counter=79, p=1, q=0, r=-78, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=47, b=2, counter=79, p=1, q=0, r=-78, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=45, b=2, counter=79, p=1, q=0, r=-79, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=45, b=2, counter=80, counter++=79, p=1, q=0, r=-79, s=1, x=203, y=2] [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, cond=1, counter=80] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=45, b=2, counter=80, p=1, q=0, r=-79, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=80] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=45, b=2, counter=80, p=1, q=0, r=-79, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=80] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=45, b=2, counter=80, p=1, q=0, r=-79, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=45, b=2, counter=80, p=1, q=0, r=-79, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=43, b=2, counter=80, p=1, q=0, r=-80, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=43, b=2, counter=81, counter++=80, p=1, q=0, r=-80, s=1, x=203, y=2] [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, cond=1, counter=81] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=43, b=2, counter=81, p=1, q=0, r=-80, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=43, b=2, counter=81, p=1, q=0, r=-80, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=43, b=2, counter=81, p=1, q=0, r=-80, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=43, b=2, counter=81, p=1, q=0, r=-80, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=41, b=2, counter=81, p=1, q=0, r=-81, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=41, b=2, counter=82, counter++=81, p=1, q=0, r=-81, s=1, x=203, y=2] [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, cond=1, counter=82] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=41, b=2, counter=82, p=1, q=0, r=-81, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=82] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=41, b=2, counter=82, p=1, q=0, r=-81, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=82] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=41, b=2, counter=82, p=1, q=0, r=-81, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=41, b=2, counter=82, p=1, q=0, r=-81, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=39, b=2, counter=82, p=1, q=0, r=-82, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=39, b=2, counter=83, counter++=82, p=1, q=0, r=-82, s=1, x=203, y=2] [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, cond=1, counter=83] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=39, b=2, counter=83, p=1, q=0, r=-82, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=83] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=39, b=2, counter=83, p=1, q=0, r=-82, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=83] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=39, b=2, counter=83, p=1, q=0, r=-82, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=39, b=2, counter=83, p=1, q=0, r=-82, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=37, b=2, counter=83, p=1, q=0, r=-83, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=37, b=2, counter=84, counter++=83, p=1, q=0, r=-83, s=1, x=203, y=2] [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, cond=1, counter=84] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=37, b=2, counter=84, p=1, q=0, r=-83, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=84] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=37, b=2, counter=84, p=1, q=0, r=-83, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=84] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=37, b=2, counter=84, p=1, q=0, r=-83, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=37, b=2, counter=84, p=1, q=0, r=-83, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=35, b=2, counter=84, p=1, q=0, r=-84, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=35, b=2, counter=85, counter++=84, p=1, q=0, r=-84, s=1, x=203, y=2] [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, cond=1, counter=85] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=35, b=2, counter=85, p=1, q=0, r=-84, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=35, b=2, counter=85, p=1, q=0, r=-84, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=35, b=2, counter=85, p=1, q=0, r=-84, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=35, b=2, counter=85, p=1, q=0, r=-84, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=33, b=2, counter=85, p=1, q=0, r=-85, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=33, b=2, counter=86, counter++=85, p=1, q=0, r=-85, s=1, x=203, y=2] [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, cond=1, counter=86] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=33, b=2, counter=86, p=1, q=0, r=-85, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=86] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=33, b=2, counter=86, p=1, q=0, r=-85, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=86] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=33, b=2, counter=86, p=1, q=0, r=-85, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=33, b=2, counter=86, p=1, q=0, r=-85, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=31, b=2, counter=86, p=1, q=0, r=-86, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=31, b=2, counter=87, counter++=86, p=1, q=0, r=-86, s=1, x=203, y=2] [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, cond=1, counter=87] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=31, b=2, counter=87, p=1, q=0, r=-86, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=87] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=31, b=2, counter=87, p=1, q=0, r=-86, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=87] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=31, b=2, counter=87, p=1, q=0, r=-86, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=31, b=2, counter=87, p=1, q=0, r=-86, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=29, b=2, counter=87, p=1, q=0, r=-87, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=29, b=2, counter=88, counter++=87, p=1, q=0, r=-87, s=1, x=203, y=2] [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, cond=1, counter=88] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=29, b=2, counter=88, p=1, q=0, r=-87, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=88] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=29, b=2, counter=88, p=1, q=0, r=-87, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=88] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=29, b=2, counter=88, p=1, q=0, r=-87, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=29, b=2, counter=88, p=1, q=0, r=-87, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=27, b=2, counter=88, p=1, q=0, r=-88, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=27, b=2, counter=89, counter++=88, p=1, q=0, r=-88, s=1, x=203, y=2] [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, cond=1, counter=89] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=27, b=2, counter=89, p=1, q=0, r=-88, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=27, b=2, counter=89, p=1, q=0, r=-88, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=27, b=2, counter=89, p=1, q=0, r=-88, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=27, b=2, counter=89, p=1, q=0, r=-88, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=25, b=2, counter=89, p=1, q=0, r=-89, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=25, b=2, counter=90, counter++=89, p=1, q=0, r=-89, s=1, x=203, y=2] [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, cond=1, counter=90] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=25, b=2, counter=90, p=1, q=0, r=-89, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=90] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=25, b=2, counter=90, p=1, q=0, r=-89, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=90] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=25, b=2, counter=90, p=1, q=0, r=-89, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=25, b=2, counter=90, p=1, q=0, r=-89, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=23, b=2, counter=90, p=1, q=0, r=-90, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=23, b=2, counter=91, counter++=90, p=1, q=0, r=-90, s=1, x=203, y=2] [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, cond=1, counter=91] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=23, b=2, counter=91, p=1, q=0, r=-90, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=91] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=23, b=2, counter=91, p=1, q=0, r=-90, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=91] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=23, b=2, counter=91, p=1, q=0, r=-90, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=23, b=2, counter=91, p=1, q=0, r=-90, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=21, b=2, counter=91, p=1, q=0, r=-91, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=21, b=2, counter=92, counter++=91, p=1, q=0, r=-91, s=1, x=203, y=2] [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, cond=1, counter=92] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=21, b=2, counter=92, p=1, q=0, r=-91, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=92] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=21, b=2, counter=92, p=1, q=0, r=-91, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=92] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=21, b=2, counter=92, p=1, q=0, r=-91, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=21, b=2, counter=92, p=1, q=0, r=-91, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=19, b=2, counter=92, p=1, q=0, r=-92, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=19, b=2, counter=93, counter++=92, p=1, q=0, r=-92, s=1, x=203, y=2] [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, cond=1, counter=93] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=19, b=2, counter=93, p=1, q=0, r=-92, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=19, b=2, counter=93, p=1, q=0, r=-92, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=19, b=2, counter=93, p=1, q=0, r=-92, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=19, b=2, counter=93, p=1, q=0, r=-92, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=17, b=2, counter=93, p=1, q=0, r=-93, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=17, b=2, counter=94, counter++=93, p=1, q=0, r=-93, s=1, x=203, y=2] [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, cond=1, counter=94] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=17, b=2, counter=94, p=1, q=0, r=-93, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=94] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=17, b=2, counter=94, p=1, q=0, r=-93, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=94] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=17, b=2, counter=94, p=1, q=0, r=-93, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=17, b=2, counter=94, p=1, q=0, r=-93, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=15, b=2, counter=94, p=1, q=0, r=-94, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=15, b=2, counter=95, counter++=94, p=1, q=0, r=-94, s=1, x=203, y=2] [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, cond=1, counter=95] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=15, b=2, counter=95, p=1, q=0, r=-94, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=95] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=15, b=2, counter=95, p=1, q=0, r=-94, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=95] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=15, b=2, counter=95, p=1, q=0, r=-94, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=15, b=2, counter=95, p=1, q=0, r=-94, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=13, b=2, counter=95, p=1, q=0, r=-95, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=13, b=2, counter=96, counter++=95, p=1, q=0, r=-95, s=1, x=203, y=2] [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, cond=1, counter=96] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=13, b=2, counter=96, p=1, q=0, r=-95, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=96] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=13, b=2, counter=96, p=1, q=0, r=-95, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=96] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=13, b=2, counter=96, p=1, q=0, r=-95, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=13, b=2, counter=96, p=1, q=0, r=-95, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=11, b=2, counter=96, p=1, q=0, r=-96, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=11, b=2, counter=97, counter++=96, p=1, q=0, r=-96, s=1, x=203, y=2] [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, cond=1, counter=97] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=2, counter=97, p=1, q=0, r=-96, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=11, b=2, counter=97, p=1, q=0, r=-96, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=11, b=2, counter=97, p=1, q=0, r=-96, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=2, counter=97, p=1, q=0, r=-96, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=9, b=2, counter=97, p=1, q=0, r=-97, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=9, b=2, counter=98, counter++=97, p=1, q=0, r=-97, s=1, x=203, y=2] [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, cond=1, counter=98] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=2, counter=98, p=1, q=0, r=-97, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=98] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=9, b=2, counter=98, p=1, q=0, r=-97, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=98] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=9, b=2, counter=98, p=1, q=0, r=-97, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=2, counter=98, p=1, q=0, r=-97, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=7, b=2, counter=98, p=1, q=0, r=-98, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=7, b=2, counter=99, counter++=98, p=1, q=0, r=-98, s=1, x=203, y=2] [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, cond=1, counter=99] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=2, counter=99, p=1, q=0, r=-98, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=99] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=2, counter=99, p=1, q=0, r=-98, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=99] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=2, counter=99, p=1, q=0, r=-98, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=2, counter=99, p=1, q=0, r=-98, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=5, b=2, counter=99, p=1, q=0, r=-99, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=5, b=2, counter=100, counter++=99, p=1, q=0, r=-99, s=1, x=203, y=2] [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, cond=1, counter=100] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=2, counter=100, p=1, q=0, r=-99, s=1, x=203, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=100] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=2, counter=100, p=1, q=0, r=-99, s=1, x=203, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=100] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=2, counter=100, p=1, q=0, r=-99, s=1, x=203, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=2, counter=100, p=1, q=0, r=-99, s=1, x=203, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=3, b=2, counter=100, p=1, q=0, r=-100, s=1, x=203, y=2] [L34] EXPR counter++ VAL [a=3, b=2, counter=101, counter++=100, p=1, q=0, r=-100, s=1, x=203, y=2] [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, cond=0, counter=101] [L13] reach_error() VAL [\old(cond)=0, cond=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 161.3s, OverallIterations: 17, TraceHistogramMax: 301, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.2s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4198 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4166 mSDsluCounter, 5468 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4125 mSDsCounter, 2883 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5187 IncrementalHoareTripleChecker+Invalid, 8070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2883 mSolverCounterUnsat, 1343 mSDtfsCounter, 5187 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7682 GetRequests, 7060 SyntacticMatches, 6 SemanticMatches, 616 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12173 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5273occurred in iteration=16, InterpolantAutomatonStates: 620, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 39 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 131.5s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 5718 NumberOfCodeBlocks, 5698 NumberOfCodeBlocksAsserted, 306 NumberOfCheckSat, 7419 ConstructedInterpolants, 0 QuantifiedInterpolants, 18062 SizeOfPredicates, 193 NumberOfNonLiveVariables, 8357 ConjunctsInSsa, 477 ConjunctsInUnsatCore, 26 InterpolantComputations, 8 PerfectInterpolantSequences, 211569/496715 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! [2021-12-06 19:50:30,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e362cec1-3de5-4ea1-8967-3e5a429400fd/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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