./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/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_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/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_097e3cb0-b980-415b-a2fd-e3759cc75ab6/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 2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 22:16:45,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 22:16:45,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 22:16:45,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 22:16:45,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 22:16:45,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 22:16:45,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 22:16:45,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 22:16:45,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 22:16:45,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 22:16:45,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 22:16:45,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 22:16:45,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 22:16:45,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 22:16:45,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 22:16:45,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 22:16:45,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 22:16:45,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 22:16:45,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 22:16:45,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 22:16:45,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 22:16:45,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 22:16:45,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 22:16:45,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 22:16:45,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 22:16:45,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 22:16:45,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 22:16:45,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 22:16:45,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 22:16:45,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 22:16:45,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 22:16:45,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 22:16:45,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 22:16:45,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 22:16:45,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 22:16:45,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 22:16:45,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 22:16:45,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 22:16:45,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 22:16:45,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 22:16:45,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 22:16:45,741 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 22:16:45,763 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 22:16:45,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 22:16:45,764 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 22:16:45,764 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 22:16:45,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 22:16:45,765 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 22:16:45,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 22:16:45,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 22:16:45,766 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 22:16:45,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 22:16:45,766 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 22:16:45,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 22:16:45,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 22:16:45,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 22:16:45,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 22:16:45,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 22:16:45,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 22:16:45,767 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 22:16:45,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 22:16:45,768 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 22:16:45,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 22:16:45,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 22:16:45,768 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 22:16:45,768 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 22:16:45,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:16:45,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 22:16:45,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 22:16:45,769 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 22:16:45,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 22:16:45,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 22:16:45,770 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 22:16:45,770 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 22:16:45,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 22:16:45,770 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 22:16:45,770 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_097e3cb0-b980-415b-a2fd-e3759cc75ab6/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_097e3cb0-b980-415b-a2fd-e3759cc75ab6/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 -> 2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2 [2021-12-06 22:16:45,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 22:16:45,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 22:16:45,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 22:16:45,957 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 22:16:45,958 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 22:16:45,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2021-12-06 22:16:46,004 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/data/566bb3691/11078679bab14d56a8cb8d51abe442ff/FLAG2a8d24c9e [2021-12-06 22:16:46,386 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 22:16:46,387 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2021-12-06 22:16:46,391 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/data/566bb3691/11078679bab14d56a8cb8d51abe442ff/FLAG2a8d24c9e [2021-12-06 22:16:46,402 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/data/566bb3691/11078679bab14d56a8cb8d51abe442ff [2021-12-06 22:16:46,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 22:16:46,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 22:16:46,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 22:16:46,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 22:16:46,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 22:16:46,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:16:46" (1/1) ... [2021-12-06 22:16:46,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f39181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:16:46, skipping insertion in model container [2021-12-06 22:16:46,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:16:46" (1/1) ... [2021-12-06 22:16:46,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 22:16:46,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 22:16:46,524 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_097e3cb0-b980-415b-a2fd-e3759cc75ab6/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c[489,502] [2021-12-06 22:16:46,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:16:46,544 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 22:16:46,553 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_097e3cb0-b980-415b-a2fd-e3759cc75ab6/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c[489,502] [2021-12-06 22:16:46,558 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:16:46,568 INFO L208 MainTranslator]: Completed translation [2021-12-06 22:16:46,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:16:46 WrapperNode [2021-12-06 22:16:46,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 22:16:46,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 22:16:46,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 22:16:46,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 22:16:46,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:16:46" (1/1) ... [2021-12-06 22:16:46,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:16:46" (1/1) ... [2021-12-06 22:16:46,593 INFO L137 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2021-12-06 22:16:46,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 22:16:46,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 22:16:46,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 22:16:46,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 22:16:46,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:16:46" (1/1) ... [2021-12-06 22:16:46,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:16:46" (1/1) ... [2021-12-06 22:16:46,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:16:46" (1/1) ... [2021-12-06 22:16:46,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:16:46" (1/1) ... [2021-12-06 22:16:46,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:16:46" (1/1) ... [2021-12-06 22:16:46,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:16:46" (1/1) ... [2021-12-06 22:16:46,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:16:46" (1/1) ... [2021-12-06 22:16:46,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 22:16:46,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 22:16:46,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 22:16:46,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 22:16:46,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:16:46" (1/1) ... [2021-12-06 22:16:46,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:16:46,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:16:46,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 22:16:46,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 22:16:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 22:16:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-06 22:16:46,667 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-06 22:16:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 22:16:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 22:16:46,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 22:16:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-06 22:16:46,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-06 22:16:46,717 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 22:16:46,718 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 22:16:46,816 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 22:16:46,821 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 22:16:46,821 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-06 22:16:46,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:16:46 BoogieIcfgContainer [2021-12-06 22:16:46,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 22:16:46,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 22:16:46,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 22:16:46,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 22:16:46,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 10:16:46" (1/3) ... [2021-12-06 22:16:46,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a58eeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:16:46, skipping insertion in model container [2021-12-06 22:16:46,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:16:46" (2/3) ... [2021-12-06 22:16:46,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a58eeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:16:46, skipping insertion in model container [2021-12-06 22:16:46,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:16:46" (3/3) ... [2021-12-06 22:16:46,834 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound50.c [2021-12-06 22:16:46,839 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 22:16:46,840 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 22:16:46,875 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 22:16:46,880 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 22:16:46,880 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 22:16:46,893 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 22:16:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-06 22:16:46,898 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:16:46,898 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:16:46,899 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:16:46,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:16:46,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1165920622, now seen corresponding path program 1 times [2021-12-06 22:16:46,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:16:46,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659998473] [2021-12-06 22:16:46,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:46,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:16:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:16:47,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 22:16:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:16:47,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-06 22:16:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:16:47,045 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 22:16:47,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:16:47,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659998473] [2021-12-06 22:16:47,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659998473] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:16:47,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:16:47,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 22:16:47,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808430325] [2021-12-06 22:16:47,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:16:47,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 22:16:47,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:16:47,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 22:16:47,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 22:16:47,076 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 22:16:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:16:47,093 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2021-12-06 22:16:47,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 22:16:47,094 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 22:16:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:16:47,100 INFO L225 Difference]: With dead ends: 57 [2021-12-06 22:16:47,100 INFO L226 Difference]: Without dead ends: 26 [2021-12-06 22:16:47,103 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 22:16:47,106 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 22:16:47,107 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 22:16:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-06 22:16:47,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-06 22:16:47,133 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 22:16:47,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2021-12-06 22:16:47,135 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2021-12-06 22:16:47,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:16:47,136 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-12-06 22:16:47,136 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 22:16:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2021-12-06 22:16:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-06 22:16:47,137 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:16:47,137 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:16:47,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 22:16:47,138 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:16:47,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:16:47,138 INFO L85 PathProgramCache]: Analyzing trace with hash -542319922, now seen corresponding path program 1 times [2021-12-06 22:16:47,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:16:47,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254114824] [2021-12-06 22:16:47,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:47,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:16:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:16:47,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 22:16:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:16:47,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-06 22:16:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:16:47,207 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 22:16:47,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:16:47,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254114824] [2021-12-06 22:16:47,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254114824] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:16:47,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:16:47,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:16:47,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399150928] [2021-12-06 22:16:47,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:16:47,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:16:47,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:16:47,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:16:47,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:16:47,211 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 22:16:47,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:16:47,228 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2021-12-06 22:16:47,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:16:47,228 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 22:16:47,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:16:47,229 INFO L225 Difference]: With dead ends: 38 [2021-12-06 22:16:47,229 INFO L226 Difference]: Without dead ends: 28 [2021-12-06 22:16:47,230 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 22:16:47,231 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 22:16:47,231 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 22:16:47,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-06 22:16:47,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-06 22:16:47,237 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 22:16:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2021-12-06 22:16:47,238 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2021-12-06 22:16:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:16:47,239 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-12-06 22:16:47,239 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 22:16:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2021-12-06 22:16:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-06 22:16:47,240 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:16:47,240 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:16:47,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 22:16:47,241 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:16:47,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:16:47,241 INFO L85 PathProgramCache]: Analyzing trace with hash -540651626, now seen corresponding path program 1 times [2021-12-06 22:16:47,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:16:47,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976264308] [2021-12-06 22:16:47,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:47,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:16:47,259 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 22:16:47,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1492348299] [2021-12-06 22:16:47,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:47,260 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:47,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:16:47,261 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:16:47,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 22:16:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:16:47,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 22:16:47,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:16:47,392 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 22:16:47,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:16:47,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:16:47,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976264308] [2021-12-06 22:16:47,393 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 22:16:47,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492348299] [2021-12-06 22:16:47,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492348299] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:16:47,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:16:47,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 22:16:47,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37960477] [2021-12-06 22:16:47,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:16:47,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:16:47,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:16:47,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:16:47,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:16:47,395 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 22:16:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:16:47,438 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2021-12-06 22:16:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:16:47,439 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 22:16:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:16:47,440 INFO L225 Difference]: With dead ends: 45 [2021-12-06 22:16:47,440 INFO L226 Difference]: Without dead ends: 43 [2021-12-06 22:16:47,440 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 22:16:47,442 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 22:16:47,442 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 22:16:47,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-06 22:16:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2021-12-06 22:16:47,450 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 22:16:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2021-12-06 22:16:47,451 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2021-12-06 22:16:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:16:47,451 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2021-12-06 22:16:47,452 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 22:16:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2021-12-06 22:16:47,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-06 22:16:47,452 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:16:47,452 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 22:16:47,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 22:16:47,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:47,655 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:16:47,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:16:47,657 INFO L85 PathProgramCache]: Analyzing trace with hash -276555716, now seen corresponding path program 1 times [2021-12-06 22:16:47,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:16:47,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039114279] [2021-12-06 22:16:47,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:47,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:16:47,696 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 22:16:47,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542635138] [2021-12-06 22:16:47,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:47,697 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:47,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:16:47,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:16:47,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 22:16:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:16:47,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-06 22:16:47,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:16:47,950 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 22:16:47,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:16:47,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:16:47,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039114279] [2021-12-06 22:16:47,951 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 22:16:47,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542635138] [2021-12-06 22:16:47,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542635138] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:16:47,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:16:47,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 22:16:47,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944802989] [2021-12-06 22:16:47,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:16:47,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 22:16:47,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:16:47,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 22:16:47,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-06 22:16:47,958 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 22:16:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:16:48,046 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2021-12-06 22:16:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:16:48,046 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 22:16:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:16:48,047 INFO L225 Difference]: With dead ends: 49 [2021-12-06 22:16:48,047 INFO L226 Difference]: Without dead ends: 47 [2021-12-06 22:16:48,048 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 22:16:48,049 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 22:16:48,049 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 22:16:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-06 22:16:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2021-12-06 22:16:48,056 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 22:16:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2021-12-06 22:16:48,058 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2021-12-06 22:16:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:16:48,058 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2021-12-06 22:16:48,058 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 22:16:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2021-12-06 22:16:48,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-06 22:16:48,059 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:16:48,059 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 22:16:48,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 22:16:48,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:48,261 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:16:48,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:16:48,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1836785898, now seen corresponding path program 1 times [2021-12-06 22:16:48,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:16:48,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117825259] [2021-12-06 22:16:48,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:48,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:16:48,308 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 22:16:48,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2003205796] [2021-12-06 22:16:48,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:48,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:48,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:16:48,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:16:48,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 22:16:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:16:48,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-06 22:16:48,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:16:48,585 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 22:16:48,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:16:48,650 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 22:16:48,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:16:48,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117825259] [2021-12-06 22:16:48,651 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 22:16:48,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003205796] [2021-12-06 22:16:48,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003205796] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 22:16:48,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 22:16:48,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2021-12-06 22:16:48,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307363946] [2021-12-06 22:16:48,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:16:48,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:16:48,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:16:48,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:16:48,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-06 22:16:48,652 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 22:16:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:16:48,694 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2021-12-06 22:16:48,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:16:48,695 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 22:16:48,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:16:48,697 INFO L225 Difference]: With dead ends: 71 [2021-12-06 22:16:48,697 INFO L226 Difference]: Without dead ends: 67 [2021-12-06 22:16:48,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-06 22:16:48,698 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 22:16:48,699 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 22:16:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-06 22:16:48,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-12-06 22:16:48,710 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 22:16:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2021-12-06 22:16:48,712 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 29 [2021-12-06 22:16:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:16:48,712 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2021-12-06 22:16:48,712 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 22:16:48,712 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2021-12-06 22:16:48,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-06 22:16:48,713 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:16:48,713 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 22:16:48,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 22:16:48,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:48,915 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:16:48,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:16:48,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1071030291, now seen corresponding path program 1 times [2021-12-06 22:16:48,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:16:48,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542616785] [2021-12-06 22:16:48,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:48,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:16:48,952 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 22:16:48,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358765474] [2021-12-06 22:16:48,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:48,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:48,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:16:48,956 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:16:48,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 22:16:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:16:49,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 22:16:49,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:16:49,127 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 22:16:49,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:16:49,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:16:49,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542616785] [2021-12-06 22:16:49,128 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 22:16:49,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358765474] [2021-12-06 22:16:49,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358765474] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:16:49,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:16:49,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 22:16:49,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871189750] [2021-12-06 22:16:49,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:16:49,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:16:49,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:16:49,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:16:49,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:16:49,129 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 22:16:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:16:49,160 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2021-12-06 22:16:49,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:16:49,161 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 22:16:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:16:49,162 INFO L225 Difference]: With dead ends: 83 [2021-12-06 22:16:49,162 INFO L226 Difference]: Without dead ends: 81 [2021-12-06 22:16:49,163 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 22:16:49,163 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 22:16:49,164 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 22:16:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-06 22:16:49,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2021-12-06 22:16:49,175 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 22:16:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2021-12-06 22:16:49,176 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 35 [2021-12-06 22:16:49,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:16:49,176 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2021-12-06 22:16:49,176 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 22:16:49,176 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2021-12-06 22:16:49,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-06 22:16:49,177 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:16:49,178 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 22:16:49,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 22:16:49,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:49,380 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:16:49,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:16:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1689492770, now seen corresponding path program 1 times [2021-12-06 22:16:49,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:16:49,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295252069] [2021-12-06 22:16:49,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:49,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:16:49,412 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 22:16:49,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1728845811] [2021-12-06 22:16:49,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:49,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:49,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:16:49,417 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:16:49,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 22:16:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:16:49,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 22:16:49,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:16:49,648 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 22:16:49,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:16:49,694 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 22:16:49,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:16:49,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295252069] [2021-12-06 22:16:49,694 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 22:16:49,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728845811] [2021-12-06 22:16:49,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728845811] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:16:49,695 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:16:49,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-12-06 22:16:49,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304370017] [2021-12-06 22:16:49,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:16:49,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 22:16:49,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:16:49,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 22:16:49,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:16:49,697 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 22:16:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:16:49,791 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2021-12-06 22:16:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 22:16:49,791 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 22:16:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:16:49,794 INFO L225 Difference]: With dead ends: 218 [2021-12-06 22:16:49,794 INFO L226 Difference]: Without dead ends: 196 [2021-12-06 22:16:49,795 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 22:16:49,796 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 22:16:49,796 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 22:16:49,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-06 22:16:49,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2021-12-06 22:16:49,819 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 22:16:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2021-12-06 22:16:49,820 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 38 [2021-12-06 22:16:49,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:16:49,821 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2021-12-06 22:16:49,821 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 22:16:49,821 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2021-12-06 22:16:49,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-06 22:16:49,822 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:16:49,822 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 22:16:49,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 22:16:50,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:50,023 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:16:50,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:16:50,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1691161066, now seen corresponding path program 1 times [2021-12-06 22:16:50,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:16:50,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475928965] [2021-12-06 22:16:50,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:50,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:16:50,037 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 22:16:50,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1827895345] [2021-12-06 22:16:50,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:50,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:50,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:16:50,039 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:16:50,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 22:16:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:16:50,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 22:16:50,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:16:50,159 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 22:16:50,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:16:50,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:16:50,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475928965] [2021-12-06 22:16:50,159 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 22:16:50,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827895345] [2021-12-06 22:16:50,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827895345] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:16:50,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:16:50,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 22:16:50,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135649769] [2021-12-06 22:16:50,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:16:50,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:16:50,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:16:50,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:16:50,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:16:50,161 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 22:16:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:16:50,193 INFO L93 Difference]: Finished difference Result 204 states and 260 transitions. [2021-12-06 22:16:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:16:50,193 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 22:16:50,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:16:50,195 INFO L225 Difference]: With dead ends: 204 [2021-12-06 22:16:50,195 INFO L226 Difference]: Without dead ends: 199 [2021-12-06 22:16:50,195 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 22:16:50,196 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 22:16:50,196 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 22:16:50,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-06 22:16:50,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-12-06 22:16:50,213 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 22:16:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2021-12-06 22:16:50,215 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2021-12-06 22:16:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:16:50,215 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2021-12-06 22:16:50,216 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 22:16:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2021-12-06 22:16:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 22:16:50,217 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:16:50,217 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 22:16:50,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 22:16:50,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-06 22:16:50,419 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:16:50,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:16:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1925895455, now seen corresponding path program 1 times [2021-12-06 22:16:50,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:16:50,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145568598] [2021-12-06 22:16:50,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:50,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:16:50,446 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 22:16:50,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1151151723] [2021-12-06 22:16:50,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:50,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:50,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:16:50,450 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:16:50,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 22:16:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:16:50,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 22:16:50,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:16:50,631 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 22:16:50,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:16:50,716 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 22:16:50,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:16:50,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145568598] [2021-12-06 22:16:50,716 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 22:16:50,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151151723] [2021-12-06 22:16:50,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151151723] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:16:50,717 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:16:50,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-12-06 22:16:50,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323525193] [2021-12-06 22:16:50,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:16:50,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 22:16:50,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:16:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 22:16:50,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-06 22:16:50,718 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 22:16:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:16:50,814 INFO L93 Difference]: Finished difference Result 228 states and 286 transitions. [2021-12-06 22:16:50,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:16:50,815 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 22:16:50,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:16:50,817 INFO L225 Difference]: With dead ends: 228 [2021-12-06 22:16:50,817 INFO L226 Difference]: Without dead ends: 212 [2021-12-06 22:16:50,818 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 22:16:50,818 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 22:16:50,819 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 22:16:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-12-06 22:16:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2021-12-06 22:16:50,837 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 22:16:50,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 258 transitions. [2021-12-06 22:16:50,839 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 258 transitions. Word has length 40 [2021-12-06 22:16:50,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:16:50,840 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 258 transitions. [2021-12-06 22:16:50,840 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 22:16:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 258 transitions. [2021-12-06 22:16:50,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-06 22:16:50,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:16:50,841 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 22:16:50,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 22:16:51,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:51,044 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:16:51,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:16:51,046 INFO L85 PathProgramCache]: Analyzing trace with hash 968731240, now seen corresponding path program 2 times [2021-12-06 22:16:51,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:16:51,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184326484] [2021-12-06 22:16:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:51,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:16:51,079 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 22:16:51,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [43354563] [2021-12-06 22:16:51,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 22:16:51,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:51,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:16:51,083 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:16:51,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 22:16:51,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 22:16:51,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:16:51,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-06 22:16:51,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:16:51,319 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 22:16:51,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:16:51,395 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 22:16:51,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:16:51,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184326484] [2021-12-06 22:16:51,395 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 22:16:51,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43354563] [2021-12-06 22:16:51,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43354563] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:16:51,395 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:16:51,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-12-06 22:16:51,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152042487] [2021-12-06 22:16:51,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:16:51,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 22:16:51,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:16:51,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 22:16:51,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:16:51,397 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 22:16:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:16:51,869 INFO L93 Difference]: Finished difference Result 249 states and 310 transitions. [2021-12-06 22:16:51,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:16:51,870 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 22:16:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:16:51,872 INFO L225 Difference]: With dead ends: 249 [2021-12-06 22:16:51,872 INFO L226 Difference]: Without dead ends: 225 [2021-12-06 22:16:51,873 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 22:16:51,874 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2021-12-06 22:16:51,874 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.4s Time] [2021-12-06 22:16:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-12-06 22:16:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2021-12-06 22:16:51,897 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 22:16:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2021-12-06 22:16:51,899 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 43 [2021-12-06 22:16:51,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:16:51,899 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2021-12-06 22:16:51,899 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 22:16:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2021-12-06 22:16:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 22:16:51,901 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:16:51,901 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 22:16:51,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 22:16:52,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-06 22:16:52,102 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:16:52,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:16:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash -715006568, now seen corresponding path program 1 times [2021-12-06 22:16:52,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:16:52,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867469783] [2021-12-06 22:16:52,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:52,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:16:52,110 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 22:16:52,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [801863474] [2021-12-06 22:16:52,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:52,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:52,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:16:52,112 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:16:52,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 22:16:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:16:52,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-06 22:16:52,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:16:52,315 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 22:16:52,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:16:52,399 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 22:16:52,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:16:52,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867469783] [2021-12-06 22:16:52,399 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 22:16:52,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801863474] [2021-12-06 22:16:52,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801863474] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 22:16:52,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 22:16:52,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2021-12-06 22:16:52,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870317744] [2021-12-06 22:16:52,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:16:52,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:16:52,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:16:52,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:16:52,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:16:52,402 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 22:16:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:16:52,445 INFO L93 Difference]: Finished difference Result 212 states and 241 transitions. [2021-12-06 22:16:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:16:52,446 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 22:16:52,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:16:52,448 INFO L225 Difference]: With dead ends: 212 [2021-12-06 22:16:52,448 INFO L226 Difference]: Without dead ends: 188 [2021-12-06 22:16:52,448 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 22:16:52,449 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 22:16:52,449 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 22:16:52,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-06 22:16:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2021-12-06 22:16:52,462 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 22:16:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2021-12-06 22:16:52,463 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 57 [2021-12-06 22:16:52,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:16:52,463 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2021-12-06 22:16:52,464 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 22:16:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2021-12-06 22:16:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-06 22:16:52,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:16:52,465 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 22:16:52,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 22:16:52,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-06 22:16:52,666 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:16:52,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:16:52,666 INFO L85 PathProgramCache]: Analyzing trace with hash 985491918, now seen corresponding path program 2 times [2021-12-06 22:16:52,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:16:52,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100151543] [2021-12-06 22:16:52,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:52,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:16:52,673 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 22:16:52,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [49080276] [2021-12-06 22:16:52,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 22:16:52,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:52,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:16:52,674 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:16:52,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 22:16:52,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 22:16:52,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:16:52,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 22:16:52,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:16:52,814 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 22:16:52,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:16:52,922 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 22:16:52,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:16:52,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100151543] [2021-12-06 22:16:52,923 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 22:16:52,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49080276] [2021-12-06 22:16:52,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49080276] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:16:52,923 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:16:52,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-06 22:16:52,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243927652] [2021-12-06 22:16:52,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:16:52,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 22:16:52,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:16:52,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 22:16:52,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-12-06 22:16:52,924 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 22:16:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:16:53,087 INFO L93 Difference]: Finished difference Result 512 states and 601 transitions. [2021-12-06 22:16:53,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 22:16:53,087 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 22:16:53,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:16:53,091 INFO L225 Difference]: With dead ends: 512 [2021-12-06 22:16:53,091 INFO L226 Difference]: Without dead ends: 503 [2021-12-06 22:16:53,092 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 22:16:53,092 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 22:16:53,092 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 22:16:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-12-06 22:16:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2021-12-06 22:16:53,133 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 22:16:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 568 transitions. [2021-12-06 22:16:53,136 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 568 transitions. Word has length 95 [2021-12-06 22:16:53,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:16:53,136 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 568 transitions. [2021-12-06 22:16:53,136 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 22:16:53,136 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 568 transitions. [2021-12-06 22:16:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-12-06 22:16:53,139 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:16:53,139 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 22:16:53,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-06 22:16:53,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-06 22:16:53,341 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:16:53,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:16:53,343 INFO L85 PathProgramCache]: Analyzing trace with hash 325062734, now seen corresponding path program 3 times [2021-12-06 22:16:53,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:16:53,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212572790] [2021-12-06 22:16:53,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:53,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:16:53,376 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 22:16:53,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1350210396] [2021-12-06 22:16:53,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 22:16:53,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:53,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:16:53,378 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:16:53,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 22:16:53,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2021-12-06 22:16:53,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:16:53,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-06 22:16:53,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:16:53,701 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 22:16:53,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:16:53,957 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 22:16:53,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:16:53,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212572790] [2021-12-06 22:16:53,957 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 22:16:53,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350210396] [2021-12-06 22:16:53,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350210396] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:16:53,957 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:16:53,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-12-06 22:16:53,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749353472] [2021-12-06 22:16:53,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:16:53,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-06 22:16:53,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:16:53,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-06 22:16:53,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2021-12-06 22:16:53,959 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 22:16:54,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:16:54,440 INFO L93 Difference]: Finished difference Result 1148 states and 1345 transitions. [2021-12-06 22:16:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-06 22:16:54,441 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 22:16:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:16:54,447 INFO L225 Difference]: With dead ends: 1148 [2021-12-06 22:16:54,447 INFO L226 Difference]: Without dead ends: 1139 [2021-12-06 22:16:54,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2021-12-06 22:16:54,448 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 22:16:54,449 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 22:16:54,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-12-06 22:16:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2021-12-06 22:16:54,503 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 22:16:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1288 transitions. [2021-12-06 22:16:54,508 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1288 transitions. Word has length 209 [2021-12-06 22:16:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:16:54,509 INFO L470 AbstractCegarLoop]: Abstraction has 1139 states and 1288 transitions. [2021-12-06 22:16:54,509 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 22:16:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1288 transitions. [2021-12-06 22:16:54,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2021-12-06 22:16:54,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:16:54,520 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 22:16:54,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 22:16:54,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-06 22:16:54,721 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:16:54,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:16:54,721 INFO L85 PathProgramCache]: Analyzing trace with hash -767722162, now seen corresponding path program 4 times [2021-12-06 22:16:54,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:16:54,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426235151] [2021-12-06 22:16:54,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:54,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:16:54,734 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 22:16:54,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1178567029] [2021-12-06 22:16:54,734 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-06 22:16:54,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:54,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:16:54,735 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:16:54,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 22:16:54,858 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-06 22:16:54,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:16:54,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-06 22:16:54,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:16:55,388 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 22:16:55,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:16:56,067 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 22:16:56,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:16:56,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426235151] [2021-12-06 22:16:56,068 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 22:16:56,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178567029] [2021-12-06 22:16:56,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178567029] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:16:56,068 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:16:56,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2021-12-06 22:16:56,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859311394] [2021-12-06 22:16:56,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:16:56,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-06 22:16:56,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:16:56,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-06 22:16:56,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2021-12-06 22:16:56,072 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 22:16:57,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:16:57,341 INFO L93 Difference]: Finished difference Result 2420 states and 2833 transitions. [2021-12-06 22:16:57,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-12-06 22:16:57,342 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 22:16:57,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:16:57,352 INFO L225 Difference]: With dead ends: 2420 [2021-12-06 22:16:57,352 INFO L226 Difference]: Without dead ends: 2411 [2021-12-06 22:16:57,355 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 22:16:57,356 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 22:16:57,356 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 22:16:57,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2021-12-06 22:16:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2411. [2021-12-06 22:16:57,476 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 22:16:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2728 transitions. [2021-12-06 22:16:57,485 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2728 transitions. Word has length 437 [2021-12-06 22:16:57,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:16:57,486 INFO L470 AbstractCegarLoop]: Abstraction has 2411 states and 2728 transitions. [2021-12-06 22:16:57,486 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 22:16:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2728 transitions. [2021-12-06 22:16:57,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2021-12-06 22:16:57,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:16:57,513 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 22:16:57,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-06 22:16:57,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:57,714 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:16:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:16:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash -776415410, now seen corresponding path program 5 times [2021-12-06 22:16:57,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:16:57,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599720561] [2021-12-06 22:16:57,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:57,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:16:57,735 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 22:16:57,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229792639] [2021-12-06 22:16:57,735 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-06 22:16:57,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:16:57,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:16:57,736 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:16:57,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 22:18:07,142 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2021-12-06 22:18:07,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:18:07,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 95 conjunts are in the unsatisfiable core [2021-12-06 22:18:07,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:18:08,462 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 22:18:08,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:18:09,193 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 22:18:09,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:18:09,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599720561] [2021-12-06 22:18:09,193 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-06 22:18:09,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229792639] [2021-12-06 22:18:09,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229792639] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:18:09,193 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 22:18:09,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2021-12-06 22:18:09,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198526056] [2021-12-06 22:18:09,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 22:18:09,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-12-06 22:18:09,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:18:09,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-12-06 22:18:09,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2021-12-06 22:18:09,197 INFO L87 Difference]: Start difference. First operand 2411 states and 2728 transitions. Second operand has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 50 states have call predecessors, (280), 50 states have call successors, (280) [2021-12-06 22:18:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:18:10,455 INFO L93 Difference]: Finished difference Result 2632 states and 2993 transitions. [2021-12-06 22:18:10,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2021-12-06 22:18:10,456 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 50 states have call predecessors, (280), 50 states have call successors, (280) Word has length 893 [2021-12-06 22:18:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:18:10,467 INFO L225 Difference]: With dead ends: 2632 [2021-12-06 22:18:10,467 INFO L226 Difference]: Without dead ends: 2623 [2021-12-06 22:18:10,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1833 GetRequests, 1731 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2021-12-06 22:18:10,471 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 470 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 22:18:10,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 687 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 22:18:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2021-12-06 22:18:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2623. [2021-12-06 22:18:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 1734 states have (on average 1.0876585928489042) internal successors, (1886), 1784 states have internal predecessors, (1886), 542 states have call successors, (542), 346 states have call predecessors, (542), 346 states have return successors, (540), 492 states have call predecessors, (540), 540 states have call successors, (540) [2021-12-06 22:18:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 2968 transitions. [2021-12-06 22:18:10,611 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 2968 transitions. Word has length 893 [2021-12-06 22:18:10,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:18:10,612 INFO L470 AbstractCegarLoop]: Abstraction has 2623 states and 2968 transitions. [2021-12-06 22:18:10,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 50 states have call predecessors, (280), 50 states have call successors, (280) [2021-12-06 22:18:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 2968 transitions. [2021-12-06 22:18:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2021-12-06 22:18:10,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:18:10,630 INFO L514 BasicCegarLoop]: trace histogram [151, 150, 150, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:18:10,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 22:18:10,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-06 22:18:10,831 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:18:10,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:18:10,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1208919630, now seen corresponding path program 6 times [2021-12-06 22:18:10,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:18:10,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638888432] [2021-12-06 22:18:10,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:18:10,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:18:10,869 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-06 22:18:10,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1527027345] [2021-12-06 22:18:10,870 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-06 22:18:10,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:18:10,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:18:10,872 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:18:10,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 22:18:15,184 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 98 check-sat command(s) [2021-12-06 22:18:15,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-06 22:18:15,184 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:18:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:18:15,547 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:18:15,547 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 22:18:15,548 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 22:18:15,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-06 22:18:15,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-06 22:18:15,759 INFO L732 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:18:15,772 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 22:18:15,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 10:18:15 BoogieIcfgContainer [2021-12-06 22:18:15,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 22:18:15,936 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 22:18:15,936 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 22:18:15,937 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 22:18:15,937 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:16:46" (3/4) ... [2021-12-06 22:18:15,938 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 22:18:16,108 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 22:18:16,108 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 22:18:16,108 INFO L158 Benchmark]: Toolchain (without parser) took 89702.67ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 74.0MB in the beginning and 50.9MB in the end (delta: 23.2MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. [2021-12-06 22:18:16,109 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 69.2MB. Free memory is still 38.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 22:18:16,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.40ms. Allocated memory is still 96.5MB. Free memory was 73.8MB in the beginning and 63.8MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 22:18:16,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.68ms. Allocated memory is still 96.5MB. Free memory was 63.6MB in the beginning and 62.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 22:18:16,109 INFO L158 Benchmark]: Boogie Preprocessor took 14.90ms. Allocated memory is still 96.5MB. Free memory was 62.1MB in the beginning and 61.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 22:18:16,110 INFO L158 Benchmark]: RCFGBuilder took 213.20ms. Allocated memory is still 96.5MB. Free memory was 61.0MB in the beginning and 74.3MB in the end (delta: -13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-06 22:18:16,110 INFO L158 Benchmark]: TraceAbstraction took 89112.25ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 74.0MB in the beginning and 47.3MB in the end (delta: 26.7MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. [2021-12-06 22:18:16,110 INFO L158 Benchmark]: Witness Printer took 171.53ms. Allocated memory is still 142.6MB. Free memory was 47.3MB in the beginning and 50.9MB in the end (delta: -3.5MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2021-12-06 22:18:16,112 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.14ms. Allocated memory is still 69.2MB. Free memory is still 38.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.40ms. Allocated memory is still 96.5MB. Free memory was 73.8MB in the beginning and 63.8MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.68ms. Allocated memory is still 96.5MB. Free memory was 63.6MB in the beginning and 62.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.90ms. Allocated memory is still 96.5MB. Free memory was 62.1MB in the beginning and 61.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 213.20ms. Allocated memory is still 96.5MB. Free memory was 61.0MB in the beginning and 74.3MB in the end (delta: -13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 89112.25ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 74.0MB in the beginning and 47.3MB in the end (delta: 26.7MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. * Witness Printer took 171.53ms. Allocated memory is still 142.6MB. Free memory was 47.3MB in the beginning and 50.9MB in the end (delta: -3.5MB). Peak memory consumption was 13.5MB. 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=103, 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=103, y=2] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=103, b=2, counter=0, p=1, q=0, r=0, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=103, b=2, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=103, b=2, counter=1, p=1, q=0, r=0, s=1, x=103, 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=103, b=2, counter=1, p=1, q=0, r=0, s=1, x=103, 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=103, b=2, counter=1, p=1, q=0, r=0, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=103, b=2, counter=1, p=1, q=0, r=0, s=1, x=103, 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=1, p=1, q=0, r=-1, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=101, b=2, counter=2, counter++=1, p=1, q=0, r=-1, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=101, b=2, counter=2, p=1, q=0, r=-1, s=1, x=103, 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=101, b=2, counter=2, p=1, q=0, r=-1, s=1, x=103, 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=101, b=2, counter=2, p=1, q=0, r=-1, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=101, b=2, counter=2, p=1, q=0, r=-1, s=1, x=103, 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=2, p=1, q=0, r=-2, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=99, b=2, counter=3, counter++=2, p=1, q=0, r=-2, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=99, b=2, counter=3, p=1, q=0, r=-2, s=1, x=103, 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=99, b=2, counter=3, p=1, q=0, r=-2, s=1, x=103, 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=99, b=2, counter=3, p=1, q=0, r=-2, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=99, b=2, counter=3, p=1, q=0, r=-2, s=1, x=103, 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=3, p=1, q=0, r=-3, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=97, b=2, counter=4, counter++=3, p=1, q=0, r=-3, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=97, b=2, counter=4, p=1, q=0, r=-3, s=1, x=103, 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=97, b=2, counter=4, p=1, q=0, r=-3, s=1, x=103, 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=97, b=2, counter=4, p=1, q=0, r=-3, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=97, b=2, counter=4, p=1, q=0, r=-3, s=1, x=103, 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=4, p=1, q=0, r=-4, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=95, b=2, counter=5, counter++=4, p=1, q=0, r=-4, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=95, b=2, counter=5, p=1, q=0, r=-4, s=1, x=103, 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=95, b=2, counter=5, p=1, q=0, r=-4, s=1, x=103, 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=95, b=2, counter=5, p=1, q=0, r=-4, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=95, b=2, counter=5, p=1, q=0, r=-4, s=1, x=103, 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=5, p=1, q=0, r=-5, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=93, b=2, counter=6, counter++=5, p=1, q=0, r=-5, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=93, b=2, counter=6, p=1, q=0, r=-5, s=1, x=103, 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=93, b=2, counter=6, p=1, q=0, r=-5, s=1, x=103, 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=93, b=2, counter=6, p=1, q=0, r=-5, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=93, b=2, counter=6, p=1, q=0, r=-5, s=1, x=103, 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=6, p=1, q=0, r=-6, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=91, b=2, counter=7, counter++=6, p=1, q=0, r=-6, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=91, b=2, counter=7, p=1, q=0, r=-6, s=1, x=103, 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=91, b=2, counter=7, p=1, q=0, r=-6, s=1, x=103, 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=91, b=2, counter=7, p=1, q=0, r=-6, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=91, b=2, counter=7, p=1, q=0, r=-6, s=1, x=103, 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=7, p=1, q=0, r=-7, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=89, b=2, counter=8, counter++=7, p=1, q=0, r=-7, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=89, b=2, counter=8, p=1, q=0, r=-7, s=1, x=103, 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=89, b=2, counter=8, p=1, q=0, r=-7, s=1, x=103, 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=89, b=2, counter=8, p=1, q=0, r=-7, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=89, b=2, counter=8, p=1, q=0, r=-7, s=1, x=103, 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=8, p=1, q=0, r=-8, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=87, b=2, counter=9, counter++=8, p=1, q=0, r=-8, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=87, b=2, counter=9, p=1, q=0, r=-8, s=1, x=103, 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=87, b=2, counter=9, p=1, q=0, r=-8, s=1, x=103, 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=87, b=2, counter=9, p=1, q=0, r=-8, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=87, b=2, counter=9, p=1, q=0, r=-8, s=1, x=103, 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=9, p=1, q=0, r=-9, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=85, b=2, counter=10, counter++=9, p=1, q=0, r=-9, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=85, b=2, counter=10, p=1, q=0, r=-9, s=1, x=103, 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=85, b=2, counter=10, p=1, q=0, r=-9, s=1, x=103, 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=85, b=2, counter=10, p=1, q=0, r=-9, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=85, b=2, counter=10, p=1, q=0, r=-9, s=1, x=103, 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=10, p=1, q=0, r=-10, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=83, b=2, counter=11, counter++=10, p=1, q=0, r=-10, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=83, b=2, counter=11, p=1, q=0, r=-10, s=1, x=103, 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=83, b=2, counter=11, p=1, q=0, r=-10, s=1, x=103, 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=83, b=2, counter=11, p=1, q=0, r=-10, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=83, b=2, counter=11, p=1, q=0, r=-10, s=1, x=103, 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=11, p=1, q=0, r=-11, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=81, b=2, counter=12, counter++=11, p=1, q=0, r=-11, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=81, b=2, counter=12, p=1, q=0, r=-11, s=1, x=103, 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=81, b=2, counter=12, p=1, q=0, r=-11, s=1, x=103, 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=81, b=2, counter=12, p=1, q=0, r=-11, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=81, b=2, counter=12, p=1, q=0, r=-11, s=1, x=103, 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=12, p=1, q=0, r=-12, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=79, b=2, counter=13, counter++=12, p=1, q=0, r=-12, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=79, b=2, counter=13, p=1, q=0, r=-12, s=1, x=103, 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=79, b=2, counter=13, p=1, q=0, r=-12, s=1, x=103, 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=79, b=2, counter=13, p=1, q=0, r=-12, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=79, b=2, counter=13, p=1, q=0, r=-12, s=1, x=103, 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=13, p=1, q=0, r=-13, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=77, b=2, counter=14, counter++=13, p=1, q=0, r=-13, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=77, b=2, counter=14, p=1, q=0, r=-13, s=1, x=103, 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=77, b=2, counter=14, p=1, q=0, r=-13, s=1, x=103, 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=77, b=2, counter=14, p=1, q=0, r=-13, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=77, b=2, counter=14, p=1, q=0, r=-13, s=1, x=103, 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=14, p=1, q=0, r=-14, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=75, b=2, counter=15, counter++=14, p=1, q=0, r=-14, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=75, b=2, counter=15, p=1, q=0, r=-14, s=1, x=103, 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=75, b=2, counter=15, p=1, q=0, r=-14, s=1, x=103, 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=75, b=2, counter=15, p=1, q=0, r=-14, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=75, b=2, counter=15, p=1, q=0, r=-14, s=1, x=103, 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=15, p=1, q=0, r=-15, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=73, b=2, counter=16, counter++=15, p=1, q=0, r=-15, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=73, b=2, counter=16, p=1, q=0, r=-15, s=1, x=103, 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=73, b=2, counter=16, p=1, q=0, r=-15, s=1, x=103, 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=73, b=2, counter=16, p=1, q=0, r=-15, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=73, b=2, counter=16, p=1, q=0, r=-15, s=1, x=103, 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=16, p=1, q=0, r=-16, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=71, b=2, counter=17, counter++=16, p=1, q=0, r=-16, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=71, b=2, counter=17, p=1, q=0, r=-16, s=1, x=103, 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=71, b=2, counter=17, p=1, q=0, r=-16, s=1, x=103, 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=71, b=2, counter=17, p=1, q=0, r=-16, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=71, b=2, counter=17, p=1, q=0, r=-16, s=1, x=103, 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=17, p=1, q=0, r=-17, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=69, b=2, counter=18, counter++=17, p=1, q=0, r=-17, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=69, b=2, counter=18, p=1, q=0, r=-17, s=1, x=103, 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=69, b=2, counter=18, p=1, q=0, r=-17, s=1, x=103, 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=69, b=2, counter=18, p=1, q=0, r=-17, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=69, b=2, counter=18, p=1, q=0, r=-17, s=1, x=103, 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=18, p=1, q=0, r=-18, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=67, b=2, counter=19, counter++=18, p=1, q=0, r=-18, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=67, b=2, counter=19, p=1, q=0, r=-18, s=1, x=103, 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=67, b=2, counter=19, p=1, q=0, r=-18, s=1, x=103, 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=67, b=2, counter=19, p=1, q=0, r=-18, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=67, b=2, counter=19, p=1, q=0, r=-18, s=1, x=103, 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=19, p=1, q=0, r=-19, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=65, b=2, counter=20, counter++=19, p=1, q=0, r=-19, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=65, b=2, counter=20, p=1, q=0, r=-19, s=1, x=103, 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=65, b=2, counter=20, p=1, q=0, r=-19, s=1, x=103, 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=65, b=2, counter=20, p=1, q=0, r=-19, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=65, b=2, counter=20, p=1, q=0, r=-19, s=1, x=103, 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=20, p=1, q=0, r=-20, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=63, b=2, counter=21, counter++=20, p=1, q=0, r=-20, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=63, b=2, counter=21, p=1, q=0, r=-20, s=1, x=103, 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=63, b=2, counter=21, p=1, q=0, r=-20, s=1, x=103, 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=63, b=2, counter=21, p=1, q=0, r=-20, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=63, b=2, counter=21, p=1, q=0, r=-20, s=1, x=103, 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=21, p=1, q=0, r=-21, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=61, b=2, counter=22, counter++=21, p=1, q=0, r=-21, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=61, b=2, counter=22, p=1, q=0, r=-21, s=1, x=103, 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=61, b=2, counter=22, p=1, q=0, r=-21, s=1, x=103, 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=61, b=2, counter=22, p=1, q=0, r=-21, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=61, b=2, counter=22, p=1, q=0, r=-21, s=1, x=103, 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=22, p=1, q=0, r=-22, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=59, b=2, counter=23, counter++=22, p=1, q=0, r=-22, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=59, b=2, counter=23, p=1, q=0, r=-22, s=1, x=103, 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=59, b=2, counter=23, p=1, q=0, r=-22, s=1, x=103, 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=59, b=2, counter=23, p=1, q=0, r=-22, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=59, b=2, counter=23, p=1, q=0, r=-22, s=1, x=103, 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=23, p=1, q=0, r=-23, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=57, b=2, counter=24, counter++=23, p=1, q=0, r=-23, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=57, b=2, counter=24, p=1, q=0, r=-23, s=1, x=103, 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=57, b=2, counter=24, p=1, q=0, r=-23, s=1, x=103, 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=57, b=2, counter=24, p=1, q=0, r=-23, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=57, b=2, counter=24, p=1, q=0, r=-23, s=1, x=103, 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=24, p=1, q=0, r=-24, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=55, b=2, counter=25, counter++=24, p=1, q=0, r=-24, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=55, b=2, counter=25, p=1, q=0, r=-24, s=1, x=103, 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=55, b=2, counter=25, p=1, q=0, r=-24, s=1, x=103, 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=55, b=2, counter=25, p=1, q=0, r=-24, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=55, b=2, counter=25, p=1, q=0, r=-24, s=1, x=103, 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=25, p=1, q=0, r=-25, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=53, b=2, counter=26, counter++=25, p=1, q=0, r=-25, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=53, b=2, counter=26, p=1, q=0, r=-25, s=1, x=103, 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=53, b=2, counter=26, p=1, q=0, r=-25, s=1, x=103, 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=53, b=2, counter=26, p=1, q=0, r=-25, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=53, b=2, counter=26, p=1, q=0, r=-25, s=1, x=103, 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=26, p=1, q=0, r=-26, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=51, b=2, counter=27, counter++=26, p=1, q=0, r=-26, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=51, b=2, counter=27, p=1, q=0, r=-26, s=1, x=103, 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=51, b=2, counter=27, p=1, q=0, r=-26, s=1, x=103, 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=51, b=2, counter=27, p=1, q=0, r=-26, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=51, b=2, counter=27, p=1, q=0, r=-26, s=1, x=103, 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=27, p=1, q=0, r=-27, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=49, b=2, counter=28, counter++=27, p=1, q=0, r=-27, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=49, b=2, counter=28, p=1, q=0, r=-27, s=1, x=103, 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=49, b=2, counter=28, p=1, q=0, r=-27, s=1, x=103, 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=49, b=2, counter=28, p=1, q=0, r=-27, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=49, b=2, counter=28, p=1, q=0, r=-27, s=1, x=103, 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=28, p=1, q=0, r=-28, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=47, b=2, counter=29, counter++=28, p=1, q=0, r=-28, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=47, b=2, counter=29, p=1, q=0, r=-28, s=1, x=103, 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=47, b=2, counter=29, p=1, q=0, r=-28, s=1, x=103, 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=47, b=2, counter=29, p=1, q=0, r=-28, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=47, b=2, counter=29, p=1, q=0, r=-28, s=1, x=103, 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=29, p=1, q=0, r=-29, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=45, b=2, counter=30, counter++=29, p=1, q=0, r=-29, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=45, b=2, counter=30, p=1, q=0, r=-29, s=1, x=103, 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=45, b=2, counter=30, p=1, q=0, r=-29, s=1, x=103, 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=45, b=2, counter=30, p=1, q=0, r=-29, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=45, b=2, counter=30, p=1, q=0, r=-29, s=1, x=103, 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=30, p=1, q=0, r=-30, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=43, b=2, counter=31, counter++=30, p=1, q=0, r=-30, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=43, b=2, counter=31, p=1, q=0, r=-30, s=1, x=103, 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=43, b=2, counter=31, p=1, q=0, r=-30, s=1, x=103, 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=43, b=2, counter=31, p=1, q=0, r=-30, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=43, b=2, counter=31, p=1, q=0, r=-30, s=1, x=103, 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=31, p=1, q=0, r=-31, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=41, b=2, counter=32, counter++=31, p=1, q=0, r=-31, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=41, b=2, counter=32, p=1, q=0, r=-31, s=1, x=103, 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=41, b=2, counter=32, p=1, q=0, r=-31, s=1, x=103, 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=41, b=2, counter=32, p=1, q=0, r=-31, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=41, b=2, counter=32, p=1, q=0, r=-31, s=1, x=103, 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=32, p=1, q=0, r=-32, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=39, b=2, counter=33, counter++=32, p=1, q=0, r=-32, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=39, b=2, counter=33, p=1, q=0, r=-32, s=1, x=103, 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=39, b=2, counter=33, p=1, q=0, r=-32, s=1, x=103, 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=39, b=2, counter=33, p=1, q=0, r=-32, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=39, b=2, counter=33, p=1, q=0, r=-32, s=1, x=103, 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=33, p=1, q=0, r=-33, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=37, b=2, counter=34, counter++=33, p=1, q=0, r=-33, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=37, b=2, counter=34, p=1, q=0, r=-33, s=1, x=103, 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=37, b=2, counter=34, p=1, q=0, r=-33, s=1, x=103, 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=37, b=2, counter=34, p=1, q=0, r=-33, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=37, b=2, counter=34, p=1, q=0, r=-33, s=1, x=103, 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=34, p=1, q=0, r=-34, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=35, b=2, counter=35, counter++=34, p=1, q=0, r=-34, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=35, b=2, counter=35, p=1, q=0, r=-34, s=1, x=103, 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=35, b=2, counter=35, p=1, q=0, r=-34, s=1, x=103, 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=35, b=2, counter=35, p=1, q=0, r=-34, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=35, b=2, counter=35, p=1, q=0, r=-34, s=1, x=103, 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=35, p=1, q=0, r=-35, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=33, b=2, counter=36, counter++=35, p=1, q=0, r=-35, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=33, b=2, counter=36, p=1, q=0, r=-35, s=1, x=103, 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=33, b=2, counter=36, p=1, q=0, r=-35, s=1, x=103, 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=33, b=2, counter=36, p=1, q=0, r=-35, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=33, b=2, counter=36, p=1, q=0, r=-35, s=1, x=103, 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=36, p=1, q=0, r=-36, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=31, b=2, counter=37, counter++=36, p=1, q=0, r=-36, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=31, b=2, counter=37, p=1, q=0, r=-36, s=1, x=103, 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=31, b=2, counter=37, p=1, q=0, r=-36, s=1, x=103, 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=31, b=2, counter=37, p=1, q=0, r=-36, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=31, b=2, counter=37, p=1, q=0, r=-36, s=1, x=103, 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=37, p=1, q=0, r=-37, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=29, b=2, counter=38, counter++=37, p=1, q=0, r=-37, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=29, b=2, counter=38, p=1, q=0, r=-37, s=1, x=103, 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=29, b=2, counter=38, p=1, q=0, r=-37, s=1, x=103, 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=29, b=2, counter=38, p=1, q=0, r=-37, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=29, b=2, counter=38, p=1, q=0, r=-37, s=1, x=103, 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=38, p=1, q=0, r=-38, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=27, b=2, counter=39, counter++=38, p=1, q=0, r=-38, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=27, b=2, counter=39, p=1, q=0, r=-38, s=1, x=103, 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=27, b=2, counter=39, p=1, q=0, r=-38, s=1, x=103, 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=27, b=2, counter=39, p=1, q=0, r=-38, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=27, b=2, counter=39, p=1, q=0, r=-38, s=1, x=103, 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=39, p=1, q=0, r=-39, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=25, b=2, counter=40, counter++=39, p=1, q=0, r=-39, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=25, b=2, counter=40, p=1, q=0, r=-39, s=1, x=103, 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=25, b=2, counter=40, p=1, q=0, r=-39, s=1, x=103, 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=25, b=2, counter=40, p=1, q=0, r=-39, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=25, b=2, counter=40, p=1, q=0, r=-39, s=1, x=103, 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=40, p=1, q=0, r=-40, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=23, b=2, counter=41, counter++=40, p=1, q=0, r=-40, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=23, b=2, counter=41, p=1, q=0, r=-40, s=1, x=103, 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=23, b=2, counter=41, p=1, q=0, r=-40, s=1, x=103, 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=23, b=2, counter=41, p=1, q=0, r=-40, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=23, b=2, counter=41, p=1, q=0, r=-40, s=1, x=103, 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=41, p=1, q=0, r=-41, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=21, b=2, counter=42, counter++=41, p=1, q=0, r=-41, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=21, b=2, counter=42, p=1, q=0, r=-41, s=1, x=103, 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=21, b=2, counter=42, p=1, q=0, r=-41, s=1, x=103, 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=21, b=2, counter=42, p=1, q=0, r=-41, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=21, b=2, counter=42, p=1, q=0, r=-41, s=1, x=103, 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=42, p=1, q=0, r=-42, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=19, b=2, counter=43, counter++=42, p=1, q=0, r=-42, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=19, b=2, counter=43, p=1, q=0, r=-42, s=1, x=103, 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=19, b=2, counter=43, p=1, q=0, r=-42, s=1, x=103, 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=19, b=2, counter=43, p=1, q=0, r=-42, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=19, b=2, counter=43, p=1, q=0, r=-42, s=1, x=103, 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=43, p=1, q=0, r=-43, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=17, b=2, counter=44, counter++=43, p=1, q=0, r=-43, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=17, b=2, counter=44, p=1, q=0, r=-43, s=1, x=103, 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=17, b=2, counter=44, p=1, q=0, r=-43, s=1, x=103, 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=17, b=2, counter=44, p=1, q=0, r=-43, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=17, b=2, counter=44, p=1, q=0, r=-43, s=1, x=103, 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=44, p=1, q=0, r=-44, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=15, b=2, counter=45, counter++=44, p=1, q=0, r=-44, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=15, b=2, counter=45, p=1, q=0, r=-44, s=1, x=103, 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=15, b=2, counter=45, p=1, q=0, r=-44, s=1, x=103, 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=15, b=2, counter=45, p=1, q=0, r=-44, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=15, b=2, counter=45, p=1, q=0, r=-44, s=1, x=103, 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=45, p=1, q=0, r=-45, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=13, b=2, counter=46, counter++=45, p=1, q=0, r=-45, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=13, b=2, counter=46, p=1, q=0, r=-45, s=1, x=103, 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=13, b=2, counter=46, p=1, q=0, r=-45, s=1, x=103, 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=13, b=2, counter=46, p=1, q=0, r=-45, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=13, b=2, counter=46, p=1, q=0, r=-45, s=1, x=103, 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=46, p=1, q=0, r=-46, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=11, b=2, counter=47, counter++=46, p=1, q=0, r=-46, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=2, counter=47, p=1, q=0, r=-46, s=1, x=103, 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=11, b=2, counter=47, p=1, q=0, r=-46, s=1, x=103, 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=11, b=2, counter=47, p=1, q=0, r=-46, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=2, counter=47, p=1, q=0, r=-46, s=1, x=103, 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=47, p=1, q=0, r=-47, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=9, b=2, counter=48, counter++=47, p=1, q=0, r=-47, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=2, counter=48, p=1, q=0, r=-47, s=1, x=103, 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=9, b=2, counter=48, p=1, q=0, r=-47, s=1, x=103, 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=9, b=2, counter=48, p=1, q=0, r=-47, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=2, counter=48, p=1, q=0, r=-47, s=1, x=103, 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=48, p=1, q=0, r=-48, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=7, b=2, counter=49, counter++=48, p=1, q=0, r=-48, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=2, counter=49, p=1, q=0, r=-48, s=1, x=103, 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=7, b=2, counter=49, p=1, q=0, r=-48, s=1, x=103, 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=7, b=2, counter=49, p=1, q=0, r=-48, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=2, counter=49, p=1, q=0, r=-48, s=1, x=103, 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=49, p=1, q=0, r=-49, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=5, b=2, counter=50, counter++=49, p=1, q=0, r=-49, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=2, counter=50, p=1, q=0, r=-49, s=1, x=103, 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=5, b=2, counter=50, p=1, q=0, r=-49, s=1, x=103, 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=5, b=2, counter=50, p=1, q=0, r=-49, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=2, counter=50, p=1, q=0, r=-49, s=1, x=103, 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=50, p=1, q=0, r=-50, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=3, b=2, counter=51, counter++=50, p=1, q=0, r=-50, s=1, x=103, y=2] [L34] COND FALSE !(counter++<50) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=51] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L13] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 88.9s, OverallIterations: 16, TraceHistogramMax: 151, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1571 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1539 mSDsluCounter, 3608 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2722 mSDsCounter, 954 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2501 IncrementalHoareTripleChecker+Invalid, 3455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 954 mSolverCounterUnsat, 886 mSDtfsCounter, 2501 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3931 GetRequests, 3598 SyntacticMatches, 6 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2941 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2623occurred in iteration=15, InterpolantAutomatonStates: 330, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 39 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 74.2s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2963 NumberOfCodeBlocks, 2948 NumberOfCodeBlocksAsserted, 224 NumberOfCheckSat, 3811 ConstructedInterpolants, 0 QuantifiedInterpolants, 9526 SizeOfPredicates, 99 NumberOfNonLiveVariables, 4531 ConjunctsInSsa, 286 ConjunctsInUnsatCore, 24 InterpolantComputations, 8 PerfectInterpolantSequences, 50821/117041 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 22:18:16,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e3cb0-b980-415b-a2fd-e3759cc75ab6/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