./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7e70badd Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f5161832faa85efa7698287d22f9a23de4fa8b958c1b2d2c225d3d8c999a24ce --- Real Ultimate output --- This is Ultimate 0.2.1-dev-7e70bad [2021-11-23 13:09:23,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 13:09:23,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 13:09:23,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 13:09:23,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 13:09:23,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 13:09:23,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 13:09:23,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 13:09:23,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 13:09:23,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 13:09:23,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 13:09:23,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 13:09:23,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 13:09:23,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 13:09:23,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 13:09:23,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 13:09:23,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 13:09:23,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 13:09:23,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 13:09:23,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 13:09:23,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 13:09:23,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 13:09:23,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 13:09:23,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 13:09:23,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 13:09:23,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 13:09:23,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 13:09:23,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 13:09:23,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 13:09:23,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 13:09:23,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 13:09:23,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 13:09:23,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 13:09:23,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 13:09:23,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 13:09:23,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 13:09:23,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 13:09:23,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 13:09:23,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 13:09:23,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 13:09:23,897 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 13:09:23,898 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-23 13:09:23,959 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 13:09:23,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 13:09:23,959 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 13:09:23,959 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 13:09:23,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 13:09:23,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 13:09:23,961 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 13:09:23,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 13:09:23,962 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 13:09:23,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 13:09:23,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 13:09:23,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 13:09:23,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 13:09:23,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 13:09:23,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 13:09:23,966 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 13:09:23,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 13:09:23,966 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 13:09:23,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 13:09:23,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 13:09:23,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 13:09:23,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 13:09:23,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:09:23,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 13:09:23,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 13:09:23,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 13:09:23,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 13:09:23,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 13:09:23,970 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-23 13:09:23,972 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-23 13:09:23,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 13:09:23,972 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 13:09:23,973 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_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/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_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f5161832faa85efa7698287d22f9a23de4fa8b958c1b2d2c225d3d8c999a24ce [2021-11-23 13:09:24,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 13:09:24,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 13:09:24,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 13:09:24,261 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 13:09:24,261 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 13:09:24,263 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c [2021-11-23 13:09:24,330 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/data/a9aaeb59e/b89849ff098b454d9fd2edea76fa2e97/FLAG2c1998aec [2021-11-23 13:09:24,729 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 13:09:24,729 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c [2021-11-23 13:09:24,735 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/data/a9aaeb59e/b89849ff098b454d9fd2edea76fa2e97/FLAG2c1998aec [2021-11-23 13:09:25,124 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/data/a9aaeb59e/b89849ff098b454d9fd2edea76fa2e97 [2021-11-23 13:09:25,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 13:09:25,128 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 13:09:25,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 13:09:25,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 13:09:25,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 13:09:25,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:25" (1/1) ... [2021-11-23 13:09:25,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ab9629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25, skipping insertion in model container [2021-11-23 13:09:25,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:25" (1/1) ... [2021-11-23 13:09:25,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 13:09:25,175 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 13:09:25,372 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_d258ccf7-e466-4180-94a0-2fd4b7c2843c/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c[489,502] [2021-11-23 13:09:25,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:09:25,448 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 13:09:25,464 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_d258ccf7-e466-4180-94a0-2fd4b7c2843c/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound100.c[489,502] [2021-11-23 13:09:25,479 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:09:25,499 INFO L208 MainTranslator]: Completed translation [2021-11-23 13:09:25,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25 WrapperNode [2021-11-23 13:09:25,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 13:09:25,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 13:09:25,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 13:09:25,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 13:09:25,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2021-11-23 13:09:25,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2021-11-23 13:09:25,572 INFO L137 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 100 [2021-11-23 13:09:25,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 13:09:25,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 13:09:25,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 13:09:25,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 13:09:25,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2021-11-23 13:09:25,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2021-11-23 13:09:25,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2021-11-23 13:09:25,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2021-11-23 13:09:25,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2021-11-23 13:09:25,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2021-11-23 13:09:25,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2021-11-23 13:09:25,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 13:09:25,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 13:09:25,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 13:09:25,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 13:09:25,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (1/1) ... [2021-11-23 13:09:25,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:09:25,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:09:25,659 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 13:09:25,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 13:09:25,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 13:09:25,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 13:09:25,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 13:09:25,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 13:09:25,790 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 13:09:25,795 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 13:09:25,998 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 13:09:26,007 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 13:09:26,007 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 13:09:26,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:26 BoogieIcfgContainer [2021-11-23 13:09:26,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 13:09:26,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 13:09:26,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 13:09:26,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 13:09:26,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:09:25" (1/3) ... [2021-11-23 13:09:26,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1996516a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:09:26, skipping insertion in model container [2021-11-23 13:09:26,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:25" (2/3) ... [2021-11-23 13:09:26,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1996516a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:09:26, skipping insertion in model container [2021-11-23 13:09:26,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:26" (3/3) ... [2021-11-23 13:09:26,037 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound100.c [2021-11-23 13:09:26,044 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 13:09:26,044 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-11-23 13:09:26,102 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 13:09:26,112 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-11-23 13:09:26,112 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-23 13:09:26,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 34 states have (on average 1.588235294117647) internal successors, (54), 41 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 13:09:26,138 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:09:26,139 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:09:26,140 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:09:26,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:09:26,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1236199694, now seen corresponding path program 1 times [2021-11-23 13:09:26,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:09:26,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479980523] [2021-11-23 13:09:26,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:26,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:09:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:09:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:26,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:09:26,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479980523] [2021-11-23 13:09:26,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479980523] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:09:26,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:09:26,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:09:26,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974446439] [2021-11-23 13:09:26,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:09:26,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-23 13:09:26,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:09:26,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-23 13:09:26,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-23 13:09:26,376 INFO L87 Difference]: Start difference. First operand has 42 states, 34 states have (on average 1.588235294117647) internal successors, (54), 41 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:26,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:09:26,398 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2021-11-23 13:09:26,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-23 13:09:26,401 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-23 13:09:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:09:26,411 INFO L225 Difference]: With dead ends: 81 [2021-11-23 13:09:26,411 INFO L226 Difference]: Without dead ends: 38 [2021-11-23 13:09:26,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11-23 13:09:26,420 INFO L933 BasicCegarLoop]: 44 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, 44 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-11-23 13:09:26,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:09:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-11-23 13:09:26,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-11-23 13:09:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2021-11-23 13:09:26,465 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 10 [2021-11-23 13:09:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:09:26,466 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2021-11-23 13:09:26,466 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2021-11-23 13:09:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 13:09:26,468 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:09:26,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:09:26,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 13:09:26,469 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:09:26,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:09:26,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1988288018, now seen corresponding path program 1 times [2021-11-23 13:09:26,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:09:26,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322020311] [2021-11-23 13:09:26,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:26,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:09:26,500 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 13:09:26,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2131568660] [2021-11-23 13:09:26,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:26,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:26,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:09:26,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:09:26,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 13:09:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:09:26,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 13:09:26,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:09:26,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:26,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 13:09:26,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:09:26,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322020311] [2021-11-23 13:09:26,820 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 13:09:26,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131568660] [2021-11-23 13:09:26,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131568660] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:09:26,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:09:26,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:09:26,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151985513] [2021-11-23 13:09:26,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:09:26,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:09:26,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:09:26,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:09:26,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:09:26,825 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:09:26,989 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2021-11-23 13:09:26,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:09:26,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-23 13:09:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:09:26,995 INFO L225 Difference]: With dead ends: 70 [2021-11-23 13:09:26,997 INFO L226 Difference]: Without dead ends: 66 [2021-11-23 13:09:26,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:09:27,001 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 27 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:09:27,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 78 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:09:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-23 13:09:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2021-11-23 13:09:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 53 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2021-11-23 13:09:27,025 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 10 [2021-11-23 13:09:27,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:09:27,026 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2021-11-23 13:09:27,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2021-11-23 13:09:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 13:09:27,028 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:09:27,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:09:27,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-23 13:09:27,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:27,230 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:09:27,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:09:27,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1507401246, now seen corresponding path program 1 times [2021-11-23 13:09:27,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:09:27,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890508705] [2021-11-23 13:09:27,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:27,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:09:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:09:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:27,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:09:27,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890508705] [2021-11-23 13:09:27,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890508705] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:09:27,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:09:27,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:09:27,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318810201] [2021-11-23 13:09:27,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:09:27,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:09:27,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:09:27,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:09:27,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:09:27,412 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:09:27,453 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2021-11-23 13:09:27,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:09:27,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-23 13:09:27,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:09:27,456 INFO L225 Difference]: With dead ends: 70 [2021-11-23 13:09:27,456 INFO L226 Difference]: Without dead ends: 56 [2021-11-23 13:09:27,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-23 13:09:27,459 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 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-11-23 13:09:27,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:09:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-23 13:09:27,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-11-23 13:09:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 55 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2021-11-23 13:09:27,473 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 11 [2021-11-23 13:09:27,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:09:27,474 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2021-11-23 13:09:27,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2021-11-23 13:09:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-23 13:09:27,475 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:09:27,475 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:09:27,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 13:09:27,476 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:09:27,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:09:27,477 INFO L85 PathProgramCache]: Analyzing trace with hash 515817425, now seen corresponding path program 1 times [2021-11-23 13:09:27,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:09:27,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096457822] [2021-11-23 13:09:27,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:27,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:09:27,493 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 13:09:27,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492618060] [2021-11-23 13:09:27,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:27,494 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:27,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:09:27,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:09:27,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 13:09:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:09:27,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-23 13:09:27,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:09:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:27,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 13:09:27,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:09:27,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096457822] [2021-11-23 13:09:27,826 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 13:09:27,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492618060] [2021-11-23 13:09:27,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492618060] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:09:27,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:09:27,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 13:09:27,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770148966] [2021-11-23 13:09:27,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:09:27,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 13:09:27,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:09:27,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 13:09:27,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-23 13:09:27,837 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:28,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:09:28,041 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2021-11-23 13:09:28,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 13:09:28,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-23 13:09:28,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:09:28,051 INFO L225 Difference]: With dead ends: 102 [2021-11-23 13:09:28,051 INFO L226 Difference]: Without dead ends: 100 [2021-11-23 13:09:28,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-11-23 13:09:28,055 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 158 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:09:28,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 66 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:09:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-23 13:09:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 74. [2021-11-23 13:09:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 73 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2021-11-23 13:09:28,085 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2021-11-23 13:09:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:09:28,085 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2021-11-23 13:09:28,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2021-11-23 13:09:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 13:09:28,086 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:09:28,087 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:09:28,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 13:09:28,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:28,312 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:09:28,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:09:28,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1779462740, now seen corresponding path program 1 times [2021-11-23 13:09:28,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:09:28,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82168161] [2021-11-23 13:09:28,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:28,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:09:28,324 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 13:09:28,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1271967450] [2021-11-23 13:09:28,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:28,331 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:28,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:09:28,333 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:09:28,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 13:09:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:09:28,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-23 13:09:28,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:09:28,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:28,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 13:09:28,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:09:28,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82168161] [2021-11-23 13:09:28,551 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 13:09:28,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271967450] [2021-11-23 13:09:28,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271967450] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:09:28,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:09:28,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 13:09:28,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093449528] [2021-11-23 13:09:28,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:09:28,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 13:09:28,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:09:28,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 13:09:28,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 13:09:28,553 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:09:28,683 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2021-11-23 13:09:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 13:09:28,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-23 13:09:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:09:28,685 INFO L225 Difference]: With dead ends: 91 [2021-11-23 13:09:28,685 INFO L226 Difference]: Without dead ends: 83 [2021-11-23 13:09:28,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-23 13:09:28,687 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 73 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:09:28,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 95 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:09:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-11-23 13:09:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2021-11-23 13:09:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.323076923076923) internal successors, (86), 71 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2021-11-23 13:09:28,715 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 14 [2021-11-23 13:09:28,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:09:28,715 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2021-11-23 13:09:28,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2021-11-23 13:09:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-23 13:09:28,717 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:09:28,717 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:09:28,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 13:09:28,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:28,939 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:09:28,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:09:28,940 INFO L85 PathProgramCache]: Analyzing trace with hash 908148451, now seen corresponding path program 1 times [2021-11-23 13:09:28,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:09:28,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280090496] [2021-11-23 13:09:28,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:28,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:09:28,950 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 13:09:28,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1290130707] [2021-11-23 13:09:28,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:28,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:28,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:09:28,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:09:28,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 13:09:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:09:29,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 13:09:29,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:09:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:29,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 13:09:29,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:09:29,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280090496] [2021-11-23 13:09:29,047 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 13:09:29,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290130707] [2021-11-23 13:09:29,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290130707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:09:29,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:09:29,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:09:29,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457194495] [2021-11-23 13:09:29,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:09:29,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:09:29,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:09:29,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:09:29,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:09:29,052 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:09:29,105 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2021-11-23 13:09:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:09:29,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-23 13:09:29,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:09:29,107 INFO L225 Difference]: With dead ends: 92 [2021-11-23 13:09:29,107 INFO L226 Difference]: Without dead ends: 90 [2021-11-23 13:09:29,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:09:29,108 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 13 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:09:29,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:09:29,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-11-23 13:09:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2021-11-23 13:09:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 75 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2021-11-23 13:09:29,129 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 18 [2021-11-23 13:09:29,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:09:29,130 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2021-11-23 13:09:29,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:29,130 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2021-11-23 13:09:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 13:09:29,132 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:09:29,132 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:09:29,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 13:09:29,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:29,352 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:09:29,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:09:29,352 INFO L85 PathProgramCache]: Analyzing trace with hash 903222721, now seen corresponding path program 1 times [2021-11-23 13:09:29,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:09:29,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185012425] [2021-11-23 13:09:29,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:29,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:09:29,363 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 13:09:29,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2049152424] [2021-11-23 13:09:29,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:29,364 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:29,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:09:29,365 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:09:29,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 13:09:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:09:29,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-23 13:09:29,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:09:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 13:09:29,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:09:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:30,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:09:30,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185012425] [2021-11-23 13:09:30,252 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 13:09:30,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049152424] [2021-11-23 13:09:30,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049152424] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:09:30,253 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 13:09:30,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2021-11-23 13:09:30,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044024039] [2021-11-23 13:09:30,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 13:09:30,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 13:09:30,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:09:30,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 13:09:30,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=17, Unknown=1, NotChecked=0, Total=30 [2021-11-23 13:09:30,258 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:30,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:09:30,350 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2021-11-23 13:09:30,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:09:30,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-23 13:09:30,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:09:30,358 INFO L225 Difference]: With dead ends: 99 [2021-11-23 13:09:30,359 INFO L226 Difference]: Without dead ends: 95 [2021-11-23 13:09:30,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=23, Unknown=1, NotChecked=0, Total=42 [2021-11-23 13:09:30,361 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 37 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:09:30,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 113 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 18 Unchecked, 0.1s Time] [2021-11-23 13:09:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-23 13:09:30,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2021-11-23 13:09:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 83 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2021-11-23 13:09:30,381 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 20 [2021-11-23 13:09:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:09:30,381 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2021-11-23 13:09:30,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:30,382 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2021-11-23 13:09:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 13:09:30,383 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:09:30,384 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:09:30,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 13:09:30,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-23 13:09:30,603 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:09:30,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:09:30,604 INFO L85 PathProgramCache]: Analyzing trace with hash 852457862, now seen corresponding path program 1 times [2021-11-23 13:09:30,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:09:30,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836901942] [2021-11-23 13:09:30,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:30,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:09:30,615 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 13:09:30,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [505221812] [2021-11-23 13:09:30,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:30,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:30,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:09:30,635 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:09:30,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 13:09:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:09:30,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-23 13:09:30,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:09:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:30,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 13:09:30,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:09:30,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836901942] [2021-11-23 13:09:30,799 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 13:09:30,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505221812] [2021-11-23 13:09:30,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505221812] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:09:30,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:09:30,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 13:09:30,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166419147] [2021-11-23 13:09:30,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:09:30,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 13:09:30,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:09:30,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 13:09:30,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 13:09:30,802 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:09:31,011 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2021-11-23 13:09:31,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 13:09:31,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-23 13:09:31,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:09:31,013 INFO L225 Difference]: With dead ends: 127 [2021-11-23 13:09:31,013 INFO L226 Difference]: Without dead ends: 119 [2021-11-23 13:09:31,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-23 13:09:31,015 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 45 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:09:31,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 124 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:09:31,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-23 13:09:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2021-11-23 13:09:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 90 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2021-11-23 13:09:31,039 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 20 [2021-11-23 13:09:31,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:09:31,040 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2021-11-23 13:09:31,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:31,040 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2021-11-23 13:09:31,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 13:09:31,041 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:09:31,042 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:09:31,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 13:09:31,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:31,263 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:09:31,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:09:31,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2122139855, now seen corresponding path program 1 times [2021-11-23 13:09:31,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:09:31,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736548491] [2021-11-23 13:09:31,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:31,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:09:31,280 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 13:09:31,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2019870888] [2021-11-23 13:09:31,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:31,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:31,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:09:31,281 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:09:31,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 13:09:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:09:31,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 13:09:31,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:09:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:31,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:09:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:31,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:09:31,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736548491] [2021-11-23 13:09:31,447 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 13:09:31,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019870888] [2021-11-23 13:09:31,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019870888] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:09:31,447 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 13:09:31,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-11-23 13:09:31,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789646287] [2021-11-23 13:09:31,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 13:09:31,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 13:09:31,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:09:31,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 13:09:31,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:09:31,449 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:31,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:09:31,503 INFO L93 Difference]: Finished difference Result 218 states and 254 transitions. [2021-11-23 13:09:31,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 13:09:31,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-23 13:09:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:09:31,505 INFO L225 Difference]: With dead ends: 218 [2021-11-23 13:09:31,505 INFO L226 Difference]: Without dead ends: 192 [2021-11-23 13:09:31,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 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-11-23 13:09:31,506 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 77 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:09:31,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 223 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:09:31,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-11-23 13:09:31,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 154. [2021-11-23 13:09:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 147 states have (on average 1.2585034013605443) internal successors, (185), 153 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 185 transitions. [2021-11-23 13:09:31,522 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 185 transitions. Word has length 21 [2021-11-23 13:09:31,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:09:31,523 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 185 transitions. [2021-11-23 13:09:31,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 185 transitions. [2021-11-23 13:09:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 13:09:31,524 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:09:31,524 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:09:31,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 13:09:31,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:31,741 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:09:31,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:09:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1361210270, now seen corresponding path program 1 times [2021-11-23 13:09:31,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:09:31,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187333279] [2021-11-23 13:09:31,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:31,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:09:31,748 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 13:09:31,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1945815172] [2021-11-23 13:09:31,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:31,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:31,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:09:31,751 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:09:31,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 13:09:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:09:31,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-23 13:09:31,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:09:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:32,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:09:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:32,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:09:32,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187333279] [2021-11-23 13:09:32,145 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 13:09:32,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945815172] [2021-11-23 13:09:32,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945815172] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:09:32,145 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 13:09:32,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-11-23 13:09:32,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192316785] [2021-11-23 13:09:32,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 13:09:32,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 13:09:32,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:09:32,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 13:09:32,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-23 13:09:32,149 INFO L87 Difference]: Start difference. First operand 154 states and 185 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:32,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:09:32,735 INFO L93 Difference]: Finished difference Result 191 states and 229 transitions. [2021-11-23 13:09:32,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 13:09:32,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-23 13:09:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:09:32,738 INFO L225 Difference]: With dead ends: 191 [2021-11-23 13:09:32,738 INFO L226 Difference]: Without dead ends: 175 [2021-11-23 13:09:32,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-23 13:09:32,740 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 92 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 13:09:32,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 88 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 13:09:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-23 13:09:32,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 124. [2021-11-23 13:09:32,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 120 states have (on average 1.1583333333333334) internal successors, (139), 123 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:32,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 139 transitions. [2021-11-23 13:09:32,760 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 139 transitions. Word has length 22 [2021-11-23 13:09:32,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:09:32,761 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 139 transitions. [2021-11-23 13:09:32,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:32,761 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 139 transitions. [2021-11-23 13:09:32,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-23 13:09:32,762 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:09:32,763 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:09:32,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-23 13:09:32,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-23 13:09:32,983 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:09:32,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:09:32,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1856227666, now seen corresponding path program 1 times [2021-11-23 13:09:32,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:09:32,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949385845] [2021-11-23 13:09:32,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:32,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:09:32,996 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 13:09:32,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [591297859] [2021-11-23 13:09:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:32,997 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:32,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:09:32,998 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:09:33,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 13:09:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:09:33,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-23 13:09:33,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:09:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:33,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:09:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-23 13:09:33,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:09:33,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949385845] [2021-11-23 13:09:33,538 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 13:09:33,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591297859] [2021-11-23 13:09:33,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591297859] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:09:33,538 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 13:09:33,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2021-11-23 13:09:33,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576632008] [2021-11-23 13:09:33,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 13:09:33,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 13:09:33,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:09:33,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 13:09:33,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-23 13:09:33,543 INFO L87 Difference]: Start difference. First operand 124 states and 139 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:33,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:09:33,768 INFO L93 Difference]: Finished difference Result 140 states and 158 transitions. [2021-11-23 13:09:33,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 13:09:33,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-23 13:09:33,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:09:33,770 INFO L225 Difference]: With dead ends: 140 [2021-11-23 13:09:33,770 INFO L226 Difference]: Without dead ends: 124 [2021-11-23 13:09:33,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-11-23 13:09:33,772 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 33 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:09:33,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 118 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:09:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-11-23 13:09:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 56. [2021-11-23 13:09:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-11-23 13:09:33,785 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 30 [2021-11-23 13:09:33,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:09:33,785 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-11-23 13:09:33,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-11-23 13:09:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-23 13:09:33,788 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:09:33,788 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:09:33,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 13:09:34,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:34,015 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:09:34,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:09:34,016 INFO L85 PathProgramCache]: Analyzing trace with hash 374173342, now seen corresponding path program 2 times [2021-11-23 13:09:34,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:09:34,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070394433] [2021-11-23 13:09:34,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:34,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:09:34,028 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 13:09:34,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [437911170] [2021-11-23 13:09:34,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 13:09:34,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:34,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:09:34,030 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:09:34,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 13:09:34,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-23 13:09:34,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 13:09:34,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-23 13:09:34,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:09:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:34,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:09:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:34,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:09:34,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070394433] [2021-11-23 13:09:34,498 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 13:09:34,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437911170] [2021-11-23 13:09:34,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437911170] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:09:34,499 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 13:09:34,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-11-23 13:09:34,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646830610] [2021-11-23 13:09:34,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 13:09:34,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-23 13:09:34,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:09:34,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-23 13:09:34,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-11-23 13:09:34,501 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:09:34,673 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2021-11-23 13:09:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-23 13:09:34,674 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-23 13:09:34,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:09:34,675 INFO L225 Difference]: With dead ends: 124 [2021-11-23 13:09:34,675 INFO L226 Difference]: Without dead ends: 116 [2021-11-23 13:09:34,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2021-11-23 13:09:34,677 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 74 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:09:34,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 171 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:09:34,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-23 13:09:34,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-11-23 13:09:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.105263157894737) internal successors, (126), 115 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2021-11-23 13:09:34,717 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 51 [2021-11-23 13:09:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:09:34,720 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2021-11-23 13:09:34,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:34,720 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2021-11-23 13:09:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-11-23 13:09:34,726 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:09:34,727 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:09:34,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 13:09:34,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:34,947 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:09:34,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:09:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1351174344, now seen corresponding path program 3 times [2021-11-23 13:09:34,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:09:34,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011589269] [2021-11-23 13:09:34,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:34,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:09:34,961 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 13:09:34,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2000868804] [2021-11-23 13:09:34,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 13:09:34,962 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:34,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:09:34,978 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:09:35,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-23 13:09:35,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-11-23 13:09:35,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 13:09:35,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 13:09:35,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:09:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:35,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:09:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:35,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:09:35,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011589269] [2021-11-23 13:09:35,896 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 13:09:35,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000868804] [2021-11-23 13:09:35,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000868804] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:09:35,896 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 13:09:35,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2021-11-23 13:09:35,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844758224] [2021-11-23 13:09:35,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 13:09:35,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-23 13:09:35,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:09:35,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-23 13:09:35,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2021-11-23 13:09:35,898 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand has 26 states, 26 states have (on average 8.423076923076923) internal successors, (219), 25 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:09:36,314 INFO L93 Difference]: Finished difference Result 244 states and 277 transitions. [2021-11-23 13:09:36,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-23 13:09:36,315 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.423076923076923) internal successors, (219), 25 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-11-23 13:09:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:09:36,317 INFO L225 Difference]: With dead ends: 244 [2021-11-23 13:09:36,317 INFO L226 Difference]: Without dead ends: 236 [2021-11-23 13:09:36,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2021-11-23 13:09:36,319 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 164 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:09:36,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 303 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:09:36,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-11-23 13:09:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-11-23 13:09:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 234 states have (on average 1.1025641025641026) internal successors, (258), 235 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 258 transitions. [2021-11-23 13:09:36,358 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 258 transitions. Word has length 111 [2021-11-23 13:09:36,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:09:36,358 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 258 transitions. [2021-11-23 13:09:36,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.423076923076923) internal successors, (219), 25 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 258 transitions. [2021-11-23 13:09:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-11-23 13:09:36,361 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:09:36,361 INFO L514 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:09:36,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-23 13:09:36,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:36,583 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:09:36,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:09:36,584 INFO L85 PathProgramCache]: Analyzing trace with hash -77369492, now seen corresponding path program 4 times [2021-11-23 13:09:36,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:09:36,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293615736] [2021-11-23 13:09:36,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:36,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:09:36,600 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 13:09:36,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1317128590] [2021-11-23 13:09:36,600 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 13:09:36,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:36,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:09:36,602 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:09:36,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-23 13:09:36,819 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 13:09:36,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 13:09:36,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 47 conjunts are in the unsatisfiable core [2021-11-23 13:09:36,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:09:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 0 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:37,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:09:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 0 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:09:39,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:09:39,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293615736] [2021-11-23 13:09:39,183 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 13:09:39,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317128590] [2021-11-23 13:09:39,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317128590] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:09:39,183 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 13:09:39,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2021-11-23 13:09:39,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370240135] [2021-11-23 13:09:39,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 13:09:39,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-11-23 13:09:39,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:09:39,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-11-23 13:09:39,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2021-11-23 13:09:39,188 INFO L87 Difference]: Start difference. First operand 236 states and 258 transitions. Second operand has 50 states, 50 states have (on average 9.18) internal successors, (459), 49 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:40,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:09:40,614 INFO L93 Difference]: Finished difference Result 484 states and 553 transitions. [2021-11-23 13:09:40,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-11-23 13:09:40,615 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 9.18) internal successors, (459), 49 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2021-11-23 13:09:40,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:09:40,618 INFO L225 Difference]: With dead ends: 484 [2021-11-23 13:09:40,619 INFO L226 Difference]: Without dead ends: 476 [2021-11-23 13:09:40,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2021-11-23 13:09:40,624 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 346 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:09:40,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 506 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:09:40,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-11-23 13:09:40,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2021-11-23 13:09:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 474 states have (on average 1.1012658227848102) internal successors, (522), 475 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 522 transitions. [2021-11-23 13:09:40,706 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 522 transitions. Word has length 231 [2021-11-23 13:09:40,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:09:40,707 INFO L470 AbstractCegarLoop]: Abstraction has 476 states and 522 transitions. [2021-11-23 13:09:40,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 9.18) internal successors, (459), 49 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:09:40,708 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 522 transitions. [2021-11-23 13:09:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2021-11-23 13:09:40,722 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:09:40,723 INFO L514 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:09:40,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-23 13:09:40,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:40,951 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:09:40,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:09:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1721465812, now seen corresponding path program 5 times [2021-11-23 13:09:40,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:09:40,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982725756] [2021-11-23 13:09:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:09:40,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:09:40,987 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 13:09:40,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723615344] [2021-11-23 13:09:40,993 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-23 13:09:40,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:09:40,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:09:40,995 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:09:41,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-23 13:14:23,126 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2021-11-23 13:14:23,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 13:14:23,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 95 conjunts are in the unsatisfiable core [2021-11-23 13:14:23,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:14:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10442 backedges. 0 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:14:25,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:14:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10442 backedges. 0 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:14:29,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:14:29,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982725756] [2021-11-23 13:14:29,302 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 13:14:29,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723615344] [2021-11-23 13:14:29,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723615344] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:14:29,303 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 13:14:29,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2021-11-23 13:14:29,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628787704] [2021-11-23 13:14:29,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 13:14:29,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2021-11-23 13:14:29,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:14:29,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-11-23 13:14:29,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2021-11-23 13:14:29,313 INFO L87 Difference]: Start difference. First operand 476 states and 522 transitions. Second operand has 98 states, 98 states have (on average 9.581632653061224) internal successors, (939), 97 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:14:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:14:33,954 INFO L93 Difference]: Finished difference Result 964 states and 1105 transitions. [2021-11-23 13:14:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2021-11-23 13:14:33,955 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 9.581632653061224) internal successors, (939), 97 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 471 [2021-11-23 13:14:33,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:14:33,963 INFO L225 Difference]: With dead ends: 964 [2021-11-23 13:14:33,963 INFO L226 Difference]: Without dead ends: 956 [2021-11-23 13:14:33,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1033 GetRequests, 844 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2021-11-23 13:14:33,984 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 799 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 13:14:33,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [799 Valid, 935 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 13:14:33,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2021-11-23 13:14:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 956. [2021-11-23 13:14:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 954 states have (on average 1.10062893081761) internal successors, (1050), 955 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:14:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1050 transitions. [2021-11-23 13:14:34,151 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1050 transitions. Word has length 471 [2021-11-23 13:14:34,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:14:34,154 INFO L470 AbstractCegarLoop]: Abstraction has 956 states and 1050 transitions. [2021-11-23 13:14:34,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 9.581632653061224) internal successors, (939), 97 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:14:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1050 transitions. [2021-11-23 13:14:34,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2021-11-23 13:14:34,199 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:14:34,200 INFO L514 BasicCegarLoop]: trace histogram [95, 94, 94, 94, 94, 94, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:14:34,263 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-11-23 13:14:34,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-23 13:14:34,415 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:14:34,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:14:34,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1674181468, now seen corresponding path program 6 times [2021-11-23 13:14:34,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:14:34,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063811968] [2021-11-23 13:14:34,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:14:34,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:14:34,459 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 13:14:34,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315929966] [2021-11-23 13:14:34,460 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-23 13:14:34,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:14:34,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:14:34,461 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:14:34,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-23 13:14:45,176 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2021-11-23 13:14:45,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 13:14:45,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 2791 conjuncts, 191 conjunts are in the unsatisfiable core [2021-11-23 13:14:45,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:14:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 43898 backedges. 0 proven. 43898 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:14:50,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:14:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 43898 backedges. 0 proven. 43898 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:14:53,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:14:53,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063811968] [2021-11-23 13:14:53,057 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-23 13:14:53,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315929966] [2021-11-23 13:14:53,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315929966] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:14:53,058 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 13:14:53,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 103 [2021-11-23 13:14:53,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414092858] [2021-11-23 13:14:53,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 13:14:53,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2021-11-23 13:14:53,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:14:53,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-11-23 13:14:53,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2021-11-23 13:14:53,067 INFO L87 Difference]: Start difference. First operand 956 states and 1050 transitions. Second operand has 104 states, 104 states have (on average 9.701923076923077) internal successors, (1009), 103 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:14:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:14:58,438 INFO L93 Difference]: Finished difference Result 1024 states and 1129 transitions. [2021-11-23 13:14:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2021-11-23 13:14:58,439 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 9.701923076923077) internal successors, (1009), 103 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 951 [2021-11-23 13:14:58,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:14:58,446 INFO L225 Difference]: With dead ends: 1024 [2021-11-23 13:14:58,446 INFO L226 Difference]: Without dead ends: 1016 [2021-11-23 13:14:58,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1999 GetRequests, 1797 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5055 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2021-11-23 13:14:58,451 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 465 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 13:14:58,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [465 Valid, 1005 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 13:14:58,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2021-11-23 13:14:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2021-11-23 13:14:58,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1014 states have (on average 1.1005917159763314) internal successors, (1116), 1015 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:14:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1116 transitions. [2021-11-23 13:14:58,573 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1116 transitions. Word has length 951 [2021-11-23 13:14:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:14:58,575 INFO L470 AbstractCegarLoop]: Abstraction has 1016 states and 1116 transitions. [2021-11-23 13:14:58,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 9.701923076923077) internal successors, (1009), 103 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:14:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1116 transitions. [2021-11-23 13:14:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2021-11-23 13:14:58,611 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:14:58,612 INFO L514 BasicCegarLoop]: trace histogram [101, 100, 100, 100, 100, 100, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:14:58,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-11-23 13:14:58,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-23 13:14:58,835 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 13:14:58,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:14:58,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1949044798, now seen corresponding path program 7 times [2021-11-23 13:14:58,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:14:58,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931690132] [2021-11-23 13:14:58,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:14:58,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:14:58,867 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-23 13:14:58,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [176901114] [2021-11-23 13:14:58,867 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 13:14:58,868 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 13:14:58,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:14:58,870 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 13:14:58,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-23 13:14:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 13:14:59,950 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 13:15:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 13:15:01,043 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 13:15:01,044 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-23 13:15:01,045 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-11-23 13:15:01,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-11-23 13:15:01,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2021-11-23 13:15:01,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2021-11-23 13:15:01,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2021-11-23 13:15:01,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2021-11-23 13:15:01,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-11-23 13:15:01,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-23 13:15:01,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-23 13:15:01,271 INFO L732 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:15:01,279 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 13:15:01,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:15:01 BoogieIcfgContainer [2021-11-23 13:15:01,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 13:15:01,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 13:15:01,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 13:15:01,689 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 13:15:01,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:26" (3/4) ... [2021-11-23 13:15:01,691 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 13:15:02,190 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/witness.graphml [2021-11-23 13:15:02,190 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 13:15:02,191 INFO L158 Benchmark]: Toolchain (without parser) took 337063.18ms. Allocated memory was 86.0MB in the beginning and 197.1MB in the end (delta: 111.1MB). Free memory was 46.7MB in the beginning and 78.9MB in the end (delta: -32.2MB). Peak memory consumption was 122.2MB. Max. memory is 16.1GB. [2021-11-23 13:15:02,192 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 86.0MB. Free memory is still 63.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 13:15:02,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.79ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 46.5MB in the beginning and 88.7MB in the end (delta: -42.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-23 13:15:02,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.89ms. Allocated memory is still 113.2MB. Free memory was 88.7MB in the beginning and 87.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 13:15:02,194 INFO L158 Benchmark]: Boogie Preprocessor took 45.42ms. Allocated memory is still 113.2MB. Free memory was 87.0MB in the beginning and 85.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 13:15:02,194 INFO L158 Benchmark]: RCFGBuilder took 386.60ms. Allocated memory is still 113.2MB. Free memory was 85.7MB in the beginning and 74.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 13:15:02,195 INFO L158 Benchmark]: TraceAbstraction took 335674.85ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 74.4MB in the beginning and 57.9MB in the end (delta: 16.5MB). Peak memory consumption was 122.8MB. Max. memory is 16.1GB. [2021-11-23 13:15:02,195 INFO L158 Benchmark]: Witness Printer took 502.14ms. Allocated memory is still 197.1MB. Free memory was 57.9MB in the beginning and 78.9MB in the end (delta: -20.9MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2021-11-23 13:15:02,203 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.26ms. Allocated memory is still 86.0MB. Free memory is still 63.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.79ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 46.5MB in the beginning and 88.7MB in the end (delta: -42.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.89ms. Allocated memory is still 113.2MB. Free memory was 88.7MB in the beginning and 87.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.42ms. Allocated memory is still 113.2MB. Free memory was 87.0MB in the beginning and 85.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 386.60ms. Allocated memory is still 113.2MB. Free memory was 85.7MB in the beginning and 74.8MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 335674.85ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 74.4MB in the beginning and 57.9MB in the end (delta: 16.5MB). Peak memory consumption was 122.8MB. Max. memory is 16.1GB. * Witness Printer took 502.14ms. Allocated memory is still 197.1MB. Free memory was 57.9MB in the beginning and 78.9MB in the end (delta: -20.9MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) [L25] CALL assume_abort_if_not(y >= 1) [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=102, b=1, counter=0, p=1, q=0, r=0, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=102, b=1, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=102, b=1, counter=1, p=1, q=0, r=0, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=101, b=1, counter=1, p=1, q=0, r=-1, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=101, b=1, counter=2, counter++=1, p=1, q=0, r=-1, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=101, b=1, counter=2, p=1, q=0, r=-1, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=100, b=1, counter=2, p=1, q=0, r=-2, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=100, b=1, counter=3, counter++=2, p=1, q=0, r=-2, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=100, b=1, counter=3, p=1, q=0, r=-2, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=99, b=1, counter=3, p=1, q=0, r=-3, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=99, b=1, counter=4, counter++=3, p=1, q=0, r=-3, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=99, b=1, counter=4, p=1, q=0, r=-3, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=98, b=1, counter=4, p=1, q=0, r=-4, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=98, b=1, counter=5, counter++=4, p=1, q=0, r=-4, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=98, b=1, counter=5, p=1, q=0, r=-4, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=97, b=1, counter=5, p=1, q=0, r=-5, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=97, b=1, counter=6, counter++=5, p=1, q=0, r=-5, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=97, b=1, counter=6, p=1, q=0, r=-5, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=96, b=1, counter=6, p=1, q=0, r=-6, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=96, b=1, counter=7, counter++=6, p=1, q=0, r=-6, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=96, b=1, counter=7, p=1, q=0, r=-6, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=95, b=1, counter=7, p=1, q=0, r=-7, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=95, b=1, counter=8, counter++=7, p=1, q=0, r=-7, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=95, b=1, counter=8, p=1, q=0, r=-7, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=94, b=1, counter=8, p=1, q=0, r=-8, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=94, b=1, counter=9, counter++=8, p=1, q=0, r=-8, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=94, b=1, counter=9, p=1, q=0, r=-8, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=93, b=1, counter=9, p=1, q=0, r=-9, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=93, b=1, counter=10, counter++=9, p=1, q=0, r=-9, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=93, b=1, counter=10, p=1, q=0, r=-9, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=92, b=1, counter=10, p=1, q=0, r=-10, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=92, b=1, counter=11, counter++=10, p=1, q=0, r=-10, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=92, b=1, counter=11, p=1, q=0, r=-10, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=91, b=1, counter=11, p=1, q=0, r=-11, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=91, b=1, counter=12, counter++=11, p=1, q=0, r=-11, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=91, b=1, counter=12, p=1, q=0, r=-11, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=90, b=1, counter=12, p=1, q=0, r=-12, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=90, b=1, counter=13, counter++=12, p=1, q=0, r=-12, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=90, b=1, counter=13, p=1, q=0, r=-12, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=89, b=1, counter=13, p=1, q=0, r=-13, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=89, b=1, counter=14, counter++=13, p=1, q=0, r=-13, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=89, b=1, counter=14, p=1, q=0, r=-13, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=88, b=1, counter=14, p=1, q=0, r=-14, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=88, b=1, counter=15, counter++=14, p=1, q=0, r=-14, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=88, b=1, counter=15, p=1, q=0, r=-14, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=87, b=1, counter=15, p=1, q=0, r=-15, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=87, b=1, counter=16, counter++=15, p=1, q=0, r=-15, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=87, b=1, counter=16, p=1, q=0, r=-15, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=86, b=1, counter=16, p=1, q=0, r=-16, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=86, b=1, counter=17, counter++=16, p=1, q=0, r=-16, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=86, b=1, counter=17, p=1, q=0, r=-16, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=85, b=1, counter=17, p=1, q=0, r=-17, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=85, b=1, counter=18, counter++=17, p=1, q=0, r=-17, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=85, b=1, counter=18, p=1, q=0, r=-17, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=84, b=1, counter=18, p=1, q=0, r=-18, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=84, b=1, counter=19, counter++=18, p=1, q=0, r=-18, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=84, b=1, counter=19, p=1, q=0, r=-18, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=83, b=1, counter=19, p=1, q=0, r=-19, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=83, b=1, counter=20, counter++=19, p=1, q=0, r=-19, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=83, b=1, counter=20, p=1, q=0, r=-19, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=82, b=1, counter=20, p=1, q=0, r=-20, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=82, b=1, counter=21, counter++=20, p=1, q=0, r=-20, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=82, b=1, counter=21, p=1, q=0, r=-20, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=81, b=1, counter=21, p=1, q=0, r=-21, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=81, b=1, counter=22, counter++=21, p=1, q=0, r=-21, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=81, b=1, counter=22, p=1, q=0, r=-21, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=80, b=1, counter=22, p=1, q=0, r=-22, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=80, b=1, counter=23, counter++=22, p=1, q=0, r=-22, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=80, b=1, counter=23, p=1, q=0, r=-22, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=79, b=1, counter=23, p=1, q=0, r=-23, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=79, b=1, counter=24, counter++=23, p=1, q=0, r=-23, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=79, b=1, counter=24, p=1, q=0, r=-23, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=78, b=1, counter=24, p=1, q=0, r=-24, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=78, b=1, counter=25, counter++=24, p=1, q=0, r=-24, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=78, b=1, counter=25, p=1, q=0, r=-24, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=77, b=1, counter=25, p=1, q=0, r=-25, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=77, b=1, counter=26, counter++=25, p=1, q=0, r=-25, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=77, b=1, counter=26, p=1, q=0, r=-25, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=76, b=1, counter=26, p=1, q=0, r=-26, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=76, b=1, counter=27, counter++=26, p=1, q=0, r=-26, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=76, b=1, counter=27, p=1, q=0, r=-26, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=75, b=1, counter=27, p=1, q=0, r=-27, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=75, b=1, counter=28, counter++=27, p=1, q=0, r=-27, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=75, b=1, counter=28, p=1, q=0, r=-27, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=74, b=1, counter=28, p=1, q=0, r=-28, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=74, b=1, counter=29, counter++=28, p=1, q=0, r=-28, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=74, b=1, counter=29, p=1, q=0, r=-28, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=73, b=1, counter=29, p=1, q=0, r=-29, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=73, b=1, counter=30, counter++=29, p=1, q=0, r=-29, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=73, b=1, counter=30, p=1, q=0, r=-29, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=72, b=1, counter=30, p=1, q=0, r=-30, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=72, b=1, counter=31, counter++=30, p=1, q=0, r=-30, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=72, b=1, counter=31, p=1, q=0, r=-30, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=71, b=1, counter=31, p=1, q=0, r=-31, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=71, b=1, counter=32, counter++=31, p=1, q=0, r=-31, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=71, b=1, counter=32, p=1, q=0, r=-31, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=70, b=1, counter=32, p=1, q=0, r=-32, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=70, b=1, counter=33, counter++=32, p=1, q=0, r=-32, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=70, b=1, counter=33, p=1, q=0, r=-32, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=69, b=1, counter=33, p=1, q=0, r=-33, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=69, b=1, counter=34, counter++=33, p=1, q=0, r=-33, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=69, b=1, counter=34, p=1, q=0, r=-33, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=68, b=1, counter=34, p=1, q=0, r=-34, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=68, b=1, counter=35, counter++=34, p=1, q=0, r=-34, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=68, b=1, counter=35, p=1, q=0, r=-34, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=67, b=1, counter=35, p=1, q=0, r=-35, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=67, b=1, counter=36, counter++=35, p=1, q=0, r=-35, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=67, b=1, counter=36, p=1, q=0, r=-35, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=66, b=1, counter=36, p=1, q=0, r=-36, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=66, b=1, counter=37, counter++=36, p=1, q=0, r=-36, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=66, b=1, counter=37, p=1, q=0, r=-36, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=65, b=1, counter=37, p=1, q=0, r=-37, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=65, b=1, counter=38, counter++=37, p=1, q=0, r=-37, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=65, b=1, counter=38, p=1, q=0, r=-37, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=64, b=1, counter=38, p=1, q=0, r=-38, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=64, b=1, counter=39, counter++=38, p=1, q=0, r=-38, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=64, b=1, counter=39, p=1, q=0, r=-38, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=63, b=1, counter=39, p=1, q=0, r=-39, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=63, b=1, counter=40, counter++=39, p=1, q=0, r=-39, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=63, b=1, counter=40, p=1, q=0, r=-39, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=62, b=1, counter=40, p=1, q=0, r=-40, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=62, b=1, counter=41, counter++=40, p=1, q=0, r=-40, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=62, b=1, counter=41, p=1, q=0, r=-40, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=61, b=1, counter=41, p=1, q=0, r=-41, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=61, b=1, counter=42, counter++=41, p=1, q=0, r=-41, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=61, b=1, counter=42, p=1, q=0, r=-41, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=60, b=1, counter=42, p=1, q=0, r=-42, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=60, b=1, counter=43, counter++=42, p=1, q=0, r=-42, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=60, b=1, counter=43, p=1, q=0, r=-42, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=59, b=1, counter=43, p=1, q=0, r=-43, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=59, b=1, counter=44, counter++=43, p=1, q=0, r=-43, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=59, b=1, counter=44, p=1, q=0, r=-43, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=58, b=1, counter=44, p=1, q=0, r=-44, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=58, b=1, counter=45, counter++=44, p=1, q=0, r=-44, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=58, b=1, counter=45, p=1, q=0, r=-44, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=57, b=1, counter=45, p=1, q=0, r=-45, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=57, b=1, counter=46, counter++=45, p=1, q=0, r=-45, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=57, b=1, counter=46, p=1, q=0, r=-45, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=56, b=1, counter=46, p=1, q=0, r=-46, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=56, b=1, counter=47, counter++=46, p=1, q=0, r=-46, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=56, b=1, counter=47, p=1, q=0, r=-46, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=55, b=1, counter=47, p=1, q=0, r=-47, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=55, b=1, counter=48, counter++=47, p=1, q=0, r=-47, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=55, b=1, counter=48, p=1, q=0, r=-47, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=54, b=1, counter=48, p=1, q=0, r=-48, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=54, b=1, counter=49, counter++=48, p=1, q=0, r=-48, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=54, b=1, counter=49, p=1, q=0, r=-48, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=53, b=1, counter=49, p=1, q=0, r=-49, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=53, b=1, counter=50, counter++=49, p=1, q=0, r=-49, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=53, b=1, counter=50, p=1, q=0, r=-49, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=52, b=1, counter=50, p=1, q=0, r=-50, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=52, b=1, counter=51, counter++=50, p=1, q=0, r=-50, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=52, b=1, counter=51, p=1, q=0, r=-50, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=51, b=1, counter=51, p=1, q=0, r=-51, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=51, b=1, counter=52, counter++=51, p=1, q=0, r=-51, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=51, b=1, counter=52, p=1, q=0, r=-51, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=50, b=1, counter=52, p=1, q=0, r=-52, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=50, b=1, counter=53, counter++=52, p=1, q=0, r=-52, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=50, b=1, counter=53, p=1, q=0, r=-52, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=49, b=1, counter=53, p=1, q=0, r=-53, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=49, b=1, counter=54, counter++=53, p=1, q=0, r=-53, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=49, b=1, counter=54, p=1, q=0, r=-53, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=48, b=1, counter=54, p=1, q=0, r=-54, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=48, b=1, counter=55, counter++=54, p=1, q=0, r=-54, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=48, b=1, counter=55, p=1, q=0, r=-54, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=47, b=1, counter=55, p=1, q=0, r=-55, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=47, b=1, counter=56, counter++=55, p=1, q=0, r=-55, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=47, b=1, counter=56, p=1, q=0, r=-55, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=46, b=1, counter=56, p=1, q=0, r=-56, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=46, b=1, counter=57, counter++=56, p=1, q=0, r=-56, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=46, b=1, counter=57, p=1, q=0, r=-56, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=45, b=1, counter=57, p=1, q=0, r=-57, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=45, b=1, counter=58, counter++=57, p=1, q=0, r=-57, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=45, b=1, counter=58, p=1, q=0, r=-57, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=44, b=1, counter=58, p=1, q=0, r=-58, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=44, b=1, counter=59, counter++=58, p=1, q=0, r=-58, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=44, b=1, counter=59, p=1, q=0, r=-58, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=43, b=1, counter=59, p=1, q=0, r=-59, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=43, b=1, counter=60, counter++=59, p=1, q=0, r=-59, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=43, b=1, counter=60, p=1, q=0, r=-59, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=42, b=1, counter=60, p=1, q=0, r=-60, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=42, b=1, counter=61, counter++=60, p=1, q=0, r=-60, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=42, b=1, counter=61, p=1, q=0, r=-60, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=41, b=1, counter=61, p=1, q=0, r=-61, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=41, b=1, counter=62, counter++=61, p=1, q=0, r=-61, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=41, b=1, counter=62, p=1, q=0, r=-61, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=40, b=1, counter=62, p=1, q=0, r=-62, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=40, b=1, counter=63, counter++=62, p=1, q=0, r=-62, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=40, b=1, counter=63, p=1, q=0, r=-62, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=39, b=1, counter=63, p=1, q=0, r=-63, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=39, b=1, counter=64, counter++=63, p=1, q=0, r=-63, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=39, b=1, counter=64, p=1, q=0, r=-63, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=38, b=1, counter=64, p=1, q=0, r=-64, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=38, b=1, counter=65, counter++=64, p=1, q=0, r=-64, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=38, b=1, counter=65, p=1, q=0, r=-64, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=37, b=1, counter=65, p=1, q=0, r=-65, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=37, b=1, counter=66, counter++=65, p=1, q=0, r=-65, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=37, b=1, counter=66, p=1, q=0, r=-65, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=36, b=1, counter=66, p=1, q=0, r=-66, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=36, b=1, counter=67, counter++=66, p=1, q=0, r=-66, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=36, b=1, counter=67, p=1, q=0, r=-66, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=35, b=1, counter=67, p=1, q=0, r=-67, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=35, b=1, counter=68, counter++=67, p=1, q=0, r=-67, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=35, b=1, counter=68, p=1, q=0, r=-67, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=34, b=1, counter=68, p=1, q=0, r=-68, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=34, b=1, counter=69, counter++=68, p=1, q=0, r=-68, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=34, b=1, counter=69, p=1, q=0, r=-68, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=33, b=1, counter=69, p=1, q=0, r=-69, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=33, b=1, counter=70, counter++=69, p=1, q=0, r=-69, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=33, b=1, counter=70, p=1, q=0, r=-69, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=32, b=1, counter=70, p=1, q=0, r=-70, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=32, b=1, counter=71, counter++=70, p=1, q=0, r=-70, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=32, b=1, counter=71, p=1, q=0, r=-70, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=31, b=1, counter=71, p=1, q=0, r=-71, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=31, b=1, counter=72, counter++=71, p=1, q=0, r=-71, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=31, b=1, counter=72, p=1, q=0, r=-71, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=30, b=1, counter=72, p=1, q=0, r=-72, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=30, b=1, counter=73, counter++=72, p=1, q=0, r=-72, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=30, b=1, counter=73, p=1, q=0, r=-72, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=29, b=1, counter=73, p=1, q=0, r=-73, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=29, b=1, counter=74, counter++=73, p=1, q=0, r=-73, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=29, b=1, counter=74, p=1, q=0, r=-73, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=28, b=1, counter=74, p=1, q=0, r=-74, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=28, b=1, counter=75, counter++=74, p=1, q=0, r=-74, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=28, b=1, counter=75, p=1, q=0, r=-74, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=27, b=1, counter=75, p=1, q=0, r=-75, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=27, b=1, counter=76, counter++=75, p=1, q=0, r=-75, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=27, b=1, counter=76, p=1, q=0, r=-75, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=26, b=1, counter=76, p=1, q=0, r=-76, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=26, b=1, counter=77, counter++=76, p=1, q=0, r=-76, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=26, b=1, counter=77, p=1, q=0, r=-76, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=25, b=1, counter=77, p=1, q=0, r=-77, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=25, b=1, counter=78, counter++=77, p=1, q=0, r=-77, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=25, b=1, counter=78, p=1, q=0, r=-77, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=24, b=1, counter=78, p=1, q=0, r=-78, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=24, b=1, counter=79, counter++=78, p=1, q=0, r=-78, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=24, b=1, counter=79, p=1, q=0, r=-78, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=23, b=1, counter=79, p=1, q=0, r=-79, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=23, b=1, counter=80, counter++=79, p=1, q=0, r=-79, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=23, b=1, counter=80, p=1, q=0, r=-79, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=22, b=1, counter=80, p=1, q=0, r=-80, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=22, b=1, counter=81, counter++=80, p=1, q=0, r=-80, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=22, b=1, counter=81, p=1, q=0, r=-80, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=21, b=1, counter=81, p=1, q=0, r=-81, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=21, b=1, counter=82, counter++=81, p=1, q=0, r=-81, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=21, b=1, counter=82, p=1, q=0, r=-81, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=20, b=1, counter=82, p=1, q=0, r=-82, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=20, b=1, counter=83, counter++=82, p=1, q=0, r=-82, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=20, b=1, counter=83, p=1, q=0, r=-82, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=19, b=1, counter=83, p=1, q=0, r=-83, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=19, b=1, counter=84, counter++=83, p=1, q=0, r=-83, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=19, b=1, counter=84, p=1, q=0, r=-83, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=18, b=1, counter=84, p=1, q=0, r=-84, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=18, b=1, counter=85, counter++=84, p=1, q=0, r=-84, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=18, b=1, counter=85, p=1, q=0, r=-84, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=17, b=1, counter=85, p=1, q=0, r=-85, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=17, b=1, counter=86, counter++=85, p=1, q=0, r=-85, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=17, b=1, counter=86, p=1, q=0, r=-85, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=16, b=1, counter=86, p=1, q=0, r=-86, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=16, b=1, counter=87, counter++=86, p=1, q=0, r=-86, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=16, b=1, counter=87, p=1, q=0, r=-86, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=15, b=1, counter=87, p=1, q=0, r=-87, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=15, b=1, counter=88, counter++=87, p=1, q=0, r=-87, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=15, b=1, counter=88, p=1, q=0, r=-87, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=14, b=1, counter=88, p=1, q=0, r=-88, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=14, b=1, counter=89, counter++=88, p=1, q=0, r=-88, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=14, b=1, counter=89, p=1, q=0, r=-88, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=13, b=1, counter=89, p=1, q=0, r=-89, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=13, b=1, counter=90, counter++=89, p=1, q=0, r=-89, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=13, b=1, counter=90, p=1, q=0, r=-89, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=12, b=1, counter=90, p=1, q=0, r=-90, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=12, b=1, counter=91, counter++=90, p=1, q=0, r=-90, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=12, b=1, counter=91, p=1, q=0, r=-90, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=11, b=1, counter=91, p=1, q=0, r=-91, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=11, b=1, counter=92, counter++=91, p=1, q=0, r=-91, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=11, b=1, counter=92, p=1, q=0, r=-91, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=10, b=1, counter=92, p=1, q=0, r=-92, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=10, b=1, counter=93, counter++=92, p=1, q=0, r=-92, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=10, b=1, counter=93, p=1, q=0, r=-92, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=9, b=1, counter=93, p=1, q=0, r=-93, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=9, b=1, counter=94, counter++=93, p=1, q=0, r=-93, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=9, b=1, counter=94, p=1, q=0, r=-93, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=8, b=1, counter=94, p=1, q=0, r=-94, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=8, b=1, counter=95, counter++=94, p=1, q=0, r=-94, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=8, b=1, counter=95, p=1, q=0, r=-94, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=7, b=1, counter=95, p=1, q=0, r=-95, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=7, b=1, counter=96, counter++=95, p=1, q=0, r=-95, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=7, b=1, counter=96, p=1, q=0, r=-95, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=6, b=1, counter=96, p=1, q=0, r=-96, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=6, b=1, counter=97, counter++=96, p=1, q=0, r=-96, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=6, b=1, counter=97, p=1, q=0, r=-96, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=5, b=1, counter=97, p=1, q=0, r=-97, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=5, b=1, counter=98, counter++=97, p=1, q=0, r=-97, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=5, b=1, counter=98, p=1, q=0, r=-97, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=4, b=1, counter=98, p=1, q=0, r=-98, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=4, b=1, counter=99, counter++=98, p=1, q=0, r=-98, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=4, b=1, counter=99, p=1, q=0, r=-98, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=3, b=1, counter=99, p=1, q=0, r=-99, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=3, b=1, counter=100, counter++=99, p=1, q=0, r=-99, s=1, x=102, y=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L35] RET __VERIFIER_assert(1 == p * s - r * q) [L36] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L36] RET __VERIFIER_assert(a == y * r + x * p) [L37] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L37] RET __VERIFIER_assert(b == x * q + y * s) [L39] COND FALSE !(!(a != b)) VAL [a=3, b=1, counter=100, p=1, q=0, r=-99, s=1, x=102, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=2, b=1, counter=100, p=1, q=0, r=-100, s=1, x=102, y=1] [L34] EXPR counter++ VAL [a=2, b=1, counter=101, counter++=100, p=1, q=0, r=-100, s=1, x=102, y=1] [L34] COND FALSE !(counter++<100) [L53] CALL __VERIFIER_assert(a - b == 0) [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=101] [L13] reach_error() VAL [\old(cond)=0, cond=0, counter=101] - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 335.2s, OverallIterations: 17, TraceHistogramMax: 101, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2403 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2403 mSDsluCounter, 4070 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 18 IncrementalHoareTripleChecker+Unchecked, 3578 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1155 IncrementalHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 492 mSDtfsCounter, 1155 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4163 GetRequests, 3546 SyntacticMatches, 5 SemanticMatches, 612 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12168 ImplicationChecksByTransitivity, 18.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1016occurred in iteration=16, InterpolantAutomatonStates: 622, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 259 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 294.3s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 3014 NumberOfCodeBlocks, 3014 NumberOfCodeBlocksAsserted, 169 NumberOfCheckSat, 3886 ConstructedInterpolants, 12 QuantifiedInterpolants, 12653 SizeOfPredicates, 230 NumberOfNonLiveVariables, 6220 ConjunctsInSsa, 477 ConjunctsInUnsatCore, 25 InterpolantComputations, 7 PerfectInterpolantSequences, 18/114516 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-11-23 13:15:02,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d258ccf7-e466-4180-94a0-2fd4b7c2843c/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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