./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 13:58:25,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:58:25,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:58:25,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:58:25,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:58:25,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:58:25,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:58:25,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:58:25,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:58:25,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:58:25,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:58:25,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:58:25,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:58:25,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:58:25,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:58:25,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:58:25,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:58:25,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:58:25,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:58:25,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:58:25,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:58:25,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:58:25,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:58:25,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:58:25,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:58:25,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:58:25,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:58:25,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:58:25,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:58:25,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:58:25,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:58:25,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:58:25,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:58:25,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:58:25,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:58:25,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:58:25,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:58:25,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:58:25,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:58:25,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:58:25,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:58:25,803 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 13:58:25,831 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:58:25,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:58:25,832 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:58:25,832 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:58:25,833 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:58:25,834 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:58:25,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:58:25,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:58:25,835 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:58:25,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:58:25,836 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:58:25,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:58:25,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:58:25,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:58:25,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 13:58:25,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:58:25,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 13:58:25,839 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:58:25,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 13:58:25,840 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:58:25,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 13:58:25,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:58:25,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:58:25,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:58:25,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:58:25,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:58:25,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:58:25,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 13:58:25,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:58:25,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:58:25,844 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 13:58:25,844 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 13:58:25,845 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 13:58:25,845 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_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/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_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2 [2022-11-21 13:58:26,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:58:26,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:58:26,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:58:26,198 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:58:26,198 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:58:26,200 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2022-11-21 13:58:29,578 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:58:29,782 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:58:29,783 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2022-11-21 13:58:29,790 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/data/c8f8b0222/72295472898b49989a401c872917d852/FLAG0f69e3502 [2022-11-21 13:58:29,806 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/data/c8f8b0222/72295472898b49989a401c872917d852 [2022-11-21 13:58:29,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:58:29,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:58:29,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:58:29,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:58:29,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:58:29,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:58:29" (1/1) ... [2022-11-21 13:58:29,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3358049e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:29, skipping insertion in model container [2022-11-21 13:58:29,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:58:29" (1/1) ... [2022-11-21 13:58:29,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:58:29,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:58:30,013 WARN L237 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_a302b82c-d690-464d-8b68-49d7cb62c104/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c[489,502] [2022-11-21 13:58:30,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:58:30,064 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:58:30,077 WARN L237 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_a302b82c-d690-464d-8b68-49d7cb62c104/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c[489,502] [2022-11-21 13:58:30,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:58:30,098 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:58:30,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:30 WrapperNode [2022-11-21 13:58:30,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:58:30,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:58:30,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:58:30,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:58:30,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:30" (1/1) ... [2022-11-21 13:58:30,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:30" (1/1) ... [2022-11-21 13:58:30,138 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2022-11-21 13:58:30,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:58:30,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:58:30,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:58:30,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:58:30,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:30" (1/1) ... [2022-11-21 13:58:30,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:30" (1/1) ... [2022-11-21 13:58:30,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:30" (1/1) ... [2022-11-21 13:58:30,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:30" (1/1) ... [2022-11-21 13:58:30,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:30" (1/1) ... [2022-11-21 13:58:30,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:30" (1/1) ... [2022-11-21 13:58:30,168 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:30" (1/1) ... [2022-11-21 13:58:30,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:30" (1/1) ... [2022-11-21 13:58:30,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:58:30,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:58:30,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:58:30,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:58:30,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:30" (1/1) ... [2022-11-21 13:58:30,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:58:30,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:30,213 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:58:30,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:58:30,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:58:30,274 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-21 13:58:30,274 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-21 13:58:30,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:58:30,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:58:30,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:58:30,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-21 13:58:30,275 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-21 13:58:30,356 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:58:30,359 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:58:30,568 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:58:30,575 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:58:30,575 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 13:58:30,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:58:30 BoogieIcfgContainer [2022-11-21 13:58:30,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:58:30,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:58:30,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:58:30,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:58:30,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:58:29" (1/3) ... [2022-11-21 13:58:30,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9f7d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:58:30, skipping insertion in model container [2022-11-21 13:58:30,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:30" (2/3) ... [2022-11-21 13:58:30,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9f7d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:58:30, skipping insertion in model container [2022-11-21 13:58:30,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:58:30" (3/3) ... [2022-11-21 13:58:30,588 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound50.c [2022-11-21 13:58:30,612 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:58:30,612 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 13:58:30,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:58:30,682 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@58fc596b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:58:30,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 13:58:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-21 13:58:30,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 13:58:30,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:30,695 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:30,696 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:58:30,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:30,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1165920622, now seen corresponding path program 1 times [2022-11-21 13:58:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:30,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143185485] [2022-11-21 13:58:30,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:30,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:30,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:58:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:30,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 13:58:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 13:58:30,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:30,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143185485] [2022-11-21 13:58:30,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143185485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:30,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:30,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:58:30,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393619702] [2022-11-21 13:58:30,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:30,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 13:58:30,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:30,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 13:58:30,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:58:30,971 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:58:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:31,001 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2022-11-21 13:58:31,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 13:58:31,004 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-11-21 13:58:31,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:31,014 INFO L225 Difference]: With dead ends: 57 [2022-11-21 13:58:31,014 INFO L226 Difference]: Without dead ends: 26 [2022-11-21 13:58:31,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:58:31,023 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:31,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:58:31,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-21 13:58:31,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-21 13:58:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 13:58:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-11-21 13:58:31,079 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2022-11-21 13:58:31,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:31,080 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-11-21 13:58:31,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:58:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-11-21 13:58:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:58:31,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:31,085 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:31,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:58:31,086 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:58:31,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:31,089 INFO L85 PathProgramCache]: Analyzing trace with hash -542319922, now seen corresponding path program 1 times [2022-11-21 13:58:31,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:31,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258170240] [2022-11-21 13:58:31,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:31,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:58:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:31,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 13:58:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 13:58:31,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:31,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258170240] [2022-11-21 13:58:31,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258170240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:31,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:31,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:58:31,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808484796] [2022-11-21 13:58:31,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:31,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:58:31,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:31,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:58:31,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:58:31,389 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:58:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:31,423 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-11-21 13:58:31,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:58:31,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-11-21 13:58:31,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:31,425 INFO L225 Difference]: With dead ends: 38 [2022-11-21 13:58:31,426 INFO L226 Difference]: Without dead ends: 28 [2022-11-21 13:58:31,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:58:31,428 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:31,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:58:31,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-21 13:58:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-21 13:58:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-21 13:58:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-11-21 13:58:31,439 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2022-11-21 13:58:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:31,441 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-11-21 13:58:31,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:58:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-11-21 13:58:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:58:31,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:31,442 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:31,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:58:31,443 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:58:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:31,444 INFO L85 PathProgramCache]: Analyzing trace with hash -540651626, now seen corresponding path program 1 times [2022-11-21 13:58:31,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:31,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362267606] [2022-11-21 13:58:31,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:31,485 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:58:31,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [859712807] [2022-11-21 13:58:31,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:31,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:31,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:31,490 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:31,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 13:58:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:31,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-21 13:58:31,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:58:31,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:58:31,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:31,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362267606] [2022-11-21 13:58:31,926 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:58:31,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859712807] [2022-11-21 13:58:31,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859712807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:31,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:31,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:58:31,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323876348] [2022-11-21 13:58:31,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:31,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:58:31,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:31,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:58:31,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:58:31,929 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:58:32,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:32,137 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-11-21 13:58:32,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:58:32,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-11-21 13:58:32,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:32,139 INFO L225 Difference]: With dead ends: 45 [2022-11-21 13:58:32,139 INFO L226 Difference]: Without dead ends: 43 [2022-11-21 13:58:32,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:58:32,142 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:32,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 156 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:58:32,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-21 13:58:32,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-11-21 13:58:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-21 13:58:32,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2022-11-21 13:58:32,157 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2022-11-21 13:58:32,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:32,158 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2022-11-21 13:58:32,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:58:32,158 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2022-11-21 13:58:32,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 13:58:32,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:32,160 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:32,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-21 13:58:32,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:32,366 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:58:32,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:32,367 INFO L85 PathProgramCache]: Analyzing trace with hash -276555716, now seen corresponding path program 1 times [2022-11-21 13:58:32,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:32,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103696224] [2022-11-21 13:58:32,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:32,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:32,390 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:58:32,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1676580755] [2022-11-21 13:58:32,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:32,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:32,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:32,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:32,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 13:58:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:32,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-21 13:58:32,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:58:32,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:58:32,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:32,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103696224] [2022-11-21 13:58:32,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:58:32,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676580755] [2022-11-21 13:58:32,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676580755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:32,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:32,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 13:58:32,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714785463] [2022-11-21 13:58:32,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:32,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 13:58:32,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:32,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 13:58:32,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:58:32,754 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:58:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:32,981 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-11-21 13:58:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:58:32,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-11-21 13:58:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:32,992 INFO L225 Difference]: With dead ends: 49 [2022-11-21 13:58:32,993 INFO L226 Difference]: Without dead ends: 47 [2022-11-21 13:58:32,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:58:32,999 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 36 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:33,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 140 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:58:33,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-21 13:58:33,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-11-21 13:58:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-21 13:58:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2022-11-21 13:58:33,027 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2022-11-21 13:58:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:33,028 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2022-11-21 13:58:33,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:58:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-11-21 13:58:33,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 13:58:33,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:33,030 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:33,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 13:58:33,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:33,237 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:58:33,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:33,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1836785898, now seen corresponding path program 1 times [2022-11-21 13:58:33,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:33,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417605678] [2022-11-21 13:58:33,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:33,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:33,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:58:33,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717584496] [2022-11-21 13:58:33,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:33,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:33,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:33,263 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:33,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 13:58:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:33,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 13:58:33,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:58:33,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:58:33,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:33,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417605678] [2022-11-21 13:58:33,776 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:58:33,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717584496] [2022-11-21 13:58:33,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717584496] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:58:33,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:58:33,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-11-21 13:58:33,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056192292] [2022-11-21 13:58:33,778 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:33,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:58:33,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:33,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:58:33,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-21 13:58:33,780 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 13:58:34,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:34,159 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2022-11-21 13:58:34,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:58:34,160 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-11-21 13:58:34,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:34,165 INFO L225 Difference]: With dead ends: 71 [2022-11-21 13:58:34,166 INFO L226 Difference]: Without dead ends: 67 [2022-11-21 13:58:34,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-11-21 13:58:34,167 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:34,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 101 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:58:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-21 13:58:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-21 13:58:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 39 states have internal predecessors, (47), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-21 13:58:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2022-11-21 13:58:34,228 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 29 [2022-11-21 13:58:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:34,229 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2022-11-21 13:58:34,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 13:58:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2022-11-21 13:58:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-21 13:58:34,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:34,232 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:34,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-21 13:58:34,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:34,438 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:58:34,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:34,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1071030291, now seen corresponding path program 1 times [2022-11-21 13:58:34,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:34,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426949513] [2022-11-21 13:58:34,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:34,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:34,457 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:58:34,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543520185] [2022-11-21 13:58:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:34,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:34,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:34,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:34,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 13:58:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:34,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 13:58:34,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 13:58:34,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:58:34,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:34,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426949513] [2022-11-21 13:58:34,546 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:58:34,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543520185] [2022-11-21 13:58:34,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543520185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:34,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:34,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:58:34,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443448850] [2022-11-21 13:58:34,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:34,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:58:34,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:34,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:58:34,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:58:34,549 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-21 13:58:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:34,609 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2022-11-21 13:58:34,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:58:34,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-11-21 13:58:34,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:34,611 INFO L225 Difference]: With dead ends: 83 [2022-11-21 13:58:34,611 INFO L226 Difference]: Without dead ends: 81 [2022-11-21 13:58:34,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:58:34,612 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:34,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 128 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:58:34,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-21 13:58:34,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-11-21 13:58:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 45 states have internal predecessors, (50), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-21 13:58:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2022-11-21 13:58:34,637 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 35 [2022-11-21 13:58:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:34,638 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2022-11-21 13:58:34,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-21 13:58:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2022-11-21 13:58:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-21 13:58:34,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:34,639 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:34,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-21 13:58:34,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:34,847 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:58:34,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:34,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1689492770, now seen corresponding path program 1 times [2022-11-21 13:58:34,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:34,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302386853] [2022-11-21 13:58:34,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:34,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:34,858 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:58:34,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [5915345] [2022-11-21 13:58:34,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:34,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:34,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:34,860 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:34,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 13:58:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:34,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 13:58:34,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 13:58:35,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:58:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 13:58:35,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:35,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302386853] [2022-11-21 13:58:35,075 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:58:35,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5915345] [2022-11-21 13:58:35,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5915345] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:58:35,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:58:35,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-21 13:58:35,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845899867] [2022-11-21 13:58:35,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:35,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:58:35,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:35,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:58:35,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:58:35,077 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-21 13:58:35,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:35,282 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2022-11-21 13:58:35,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:58:35,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 38 [2022-11-21 13:58:35,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:35,285 INFO L225 Difference]: With dead ends: 218 [2022-11-21 13:58:35,285 INFO L226 Difference]: Without dead ends: 196 [2022-11-21 13:58:35,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:58:35,287 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 63 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:35,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 166 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:35,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-21 13:58:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2022-11-21 13:58:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 119 states have internal predecessors, (132), 61 states have call successors, (61), 21 states have call predecessors, (61), 20 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2022-11-21 13:58:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2022-11-21 13:58:35,330 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 38 [2022-11-21 13:58:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:35,330 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2022-11-21 13:58:35,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-21 13:58:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2022-11-21 13:58:35,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-21 13:58:35,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:35,332 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:35,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 13:58:35,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:35,539 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:58:35,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1691161066, now seen corresponding path program 1 times [2022-11-21 13:58:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:35,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027172191] [2022-11-21 13:58:35,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:35,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:35,549 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:58:35,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396287060] [2022-11-21 13:58:35,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:35,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:35,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:35,551 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:35,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 13:58:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:35,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-21 13:58:35,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 13:58:35,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:58:35,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:35,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027172191] [2022-11-21 13:58:35,996 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:58:35,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396287060] [2022-11-21 13:58:35,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396287060] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:58:35,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:58:35,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-11-21 13:58:35,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339173396] [2022-11-21 13:58:35,997 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:35,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:58:35,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:35,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:58:35,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:58:35,999 INFO L87 Difference]: Start difference. First operand 190 states and 247 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 13:58:36,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:36,195 INFO L93 Difference]: Finished difference Result 204 states and 260 transitions. [2022-11-21 13:58:36,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:58:36,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-11-21 13:58:36,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:36,197 INFO L225 Difference]: With dead ends: 204 [2022-11-21 13:58:36,197 INFO L226 Difference]: Without dead ends: 199 [2022-11-21 13:58:36,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:58:36,199 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:36,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 107 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:36,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-21 13:58:36,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-11-21 13:58:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 117 states have (on average 1.205128205128205) internal successors, (141), 128 states have internal predecessors, (141), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-11-21 13:58:36,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2022-11-21 13:58:36,235 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2022-11-21 13:58:36,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:36,236 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2022-11-21 13:58:36,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 13:58:36,236 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2022-11-21 13:58:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-21 13:58:36,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:36,237 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:36,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-21 13:58:36,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:36,444 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:58:36,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:36,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1925895455, now seen corresponding path program 1 times [2022-11-21 13:58:36,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:36,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272619419] [2022-11-21 13:58:36,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:36,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:36,454 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:58:36,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [225400778] [2022-11-21 13:58:36,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:36,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:36,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:36,456 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:36,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 13:58:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:36,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-21 13:58:36,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 13:58:36,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:58:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 13:58:36,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:36,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272619419] [2022-11-21 13:58:36,822 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:58:36,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225400778] [2022-11-21 13:58:36,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225400778] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:58:36,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:58:36,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-11-21 13:58:36,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292214167] [2022-11-21 13:58:36,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:36,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 13:58:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:36,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 13:58:36,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-21 13:58:36,826 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-21 13:58:37,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:37,092 INFO L93 Difference]: Finished difference Result 228 states and 286 transitions. [2022-11-21 13:58:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:58:37,094 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 40 [2022-11-21 13:58:37,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:37,100 INFO L225 Difference]: With dead ends: 228 [2022-11-21 13:58:37,101 INFO L226 Difference]: Without dead ends: 212 [2022-11-21 13:58:37,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-21 13:58:37,104 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:37,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 111 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:58:37,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-21 13:58:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2022-11-21 13:58:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 127 states have (on average 1.1653543307086613) internal successors, (148), 138 states have internal predecessors, (148), 57 states have call successors, (57), 25 states have call predecessors, (57), 25 states have return successors, (53), 46 states have call predecessors, (53), 53 states have call successors, (53) [2022-11-21 13:58:37,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 258 transitions. [2022-11-21 13:58:37,153 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 258 transitions. Word has length 40 [2022-11-21 13:58:37,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:37,153 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 258 transitions. [2022-11-21 13:58:37,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-21 13:58:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 258 transitions. [2022-11-21 13:58:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-21 13:58:37,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:37,156 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:37,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 13:58:37,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-21 13:58:37,363 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:58:37,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:37,363 INFO L85 PathProgramCache]: Analyzing trace with hash 968731240, now seen corresponding path program 2 times [2022-11-21 13:58:37,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:37,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912061611] [2022-11-21 13:58:37,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:37,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:37,373 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:58:37,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1541382873] [2022-11-21 13:58:37,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:58:37,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:37,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:37,375 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:37,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 13:58:37,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:58:37,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:58:37,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-21 13:58:37,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 13:58:37,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:58:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 13:58:37,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:37,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912061611] [2022-11-21 13:58:37,969 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:58:37,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541382873] [2022-11-21 13:58:37,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541382873] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:58:37,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:58:37,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-11-21 13:58:37,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307113001] [2022-11-21 13:58:37,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:37,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 13:58:37,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:37,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 13:58:37,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-21 13:58:37,972 INFO L87 Difference]: Start difference. First operand 210 states and 258 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-21 13:58:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:39,157 INFO L93 Difference]: Finished difference Result 249 states and 310 transitions. [2022-11-21 13:58:39,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:58:39,158 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 43 [2022-11-21 13:58:39,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:39,160 INFO L225 Difference]: With dead ends: 249 [2022-11-21 13:58:39,160 INFO L226 Difference]: Without dead ends: 225 [2022-11-21 13:58:39,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-11-21 13:58:39,161 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 36 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:39,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 147 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-21 13:58:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-21 13:58:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2022-11-21 13:58:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 133 states have (on average 1.1278195488721805) internal successors, (150), 141 states have internal predecessors, (150), 45 states have call successors, (45), 27 states have call predecessors, (45), 27 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2022-11-21 13:58:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2022-11-21 13:58:39,226 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 43 [2022-11-21 13:58:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:39,226 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2022-11-21 13:58:39,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-21 13:58:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2022-11-21 13:58:39,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-21 13:58:39,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:39,230 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:39,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 13:58:39,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-21 13:58:39,436 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:58:39,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:39,437 INFO L85 PathProgramCache]: Analyzing trace with hash -715006568, now seen corresponding path program 1 times [2022-11-21 13:58:39,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:39,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963665890] [2022-11-21 13:58:39,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:39,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:39,457 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:58:39,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [5757837] [2022-11-21 13:58:39,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:39,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:39,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:39,462 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:39,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 13:58:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:39,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-21 13:58:39,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:39,856 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-21 13:58:39,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:58:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-21 13:58:40,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:40,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963665890] [2022-11-21 13:58:40,230 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:58:40,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5757837] [2022-11-21 13:58:40,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5757837] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:58:40,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:58:40,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2022-11-21 13:58:40,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901020922] [2022-11-21 13:58:40,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:40,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-21 13:58:40,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:40,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 13:58:40,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-11-21 13:58:40,234 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-21 13:58:41,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:41,016 INFO L93 Difference]: Finished difference Result 218 states and 252 transitions. [2022-11-21 13:58:41,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 13:58:41,017 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 57 [2022-11-21 13:58:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:41,023 INFO L225 Difference]: With dead ends: 218 [2022-11-21 13:58:41,023 INFO L226 Difference]: Without dead ends: 191 [2022-11-21 13:58:41,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-11-21 13:58:41,025 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 37 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:41,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 254 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 13:58:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-21 13:58:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2022-11-21 13:58:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 124 states have (on average 1.1129032258064515) internal successors, (138), 128 states have internal predecessors, (138), 36 states have call successors, (36), 24 states have call predecessors, (36), 24 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2022-11-21 13:58:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2022-11-21 13:58:41,082 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 57 [2022-11-21 13:58:41,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:41,083 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2022-11-21 13:58:41,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-21 13:58:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2022-11-21 13:58:41,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-21 13:58:41,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:41,088 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:41,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 13:58:41,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-21 13:58:41,295 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:58:41,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash 985491918, now seen corresponding path program 2 times [2022-11-21 13:58:41,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:41,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470683320] [2022-11-21 13:58:41,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:41,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:41,324 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:58:41,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1891609030] [2022-11-21 13:58:41,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:58:41,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:41,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:41,327 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:41,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 13:58:41,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:58:41,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:58:41,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 13:58:41,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-11-21 13:58:41,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:58:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-11-21 13:58:41,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:41,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470683320] [2022-11-21 13:58:41,793 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:58:41,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891609030] [2022-11-21 13:58:41,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891609030] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:58:41,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:58:41,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-21 13:58:41,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74766344] [2022-11-21 13:58:41,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:41,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 13:58:41,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:41,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 13:58:41,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-11-21 13:58:41,796 INFO L87 Difference]: Start difference. First operand 185 states and 208 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2022-11-21 13:58:42,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:42,218 INFO L93 Difference]: Finished difference Result 512 states and 601 transitions. [2022-11-21 13:58:42,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 13:58:42,218 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 95 [2022-11-21 13:58:42,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:42,221 INFO L225 Difference]: With dead ends: 512 [2022-11-21 13:58:42,221 INFO L226 Difference]: Without dead ends: 503 [2022-11-21 13:58:42,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-11-21 13:58:42,223 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 111 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:42,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 251 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:58:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-11-21 13:58:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2022-11-21 13:58:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 334 states have (on average 1.095808383233533) internal successors, (366), 344 states have internal predecessors, (366), 102 states have call successors, (102), 66 states have call predecessors, (102), 66 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2022-11-21 13:58:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 568 transitions. [2022-11-21 13:58:42,348 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 568 transitions. Word has length 95 [2022-11-21 13:58:42,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:42,349 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 568 transitions. [2022-11-21 13:58:42,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2022-11-21 13:58:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 568 transitions. [2022-11-21 13:58:42,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-21 13:58:42,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:42,360 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:42,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 13:58:42,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-21 13:58:42,570 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:58:42,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:42,571 INFO L85 PathProgramCache]: Analyzing trace with hash 325062734, now seen corresponding path program 3 times [2022-11-21 13:58:42,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:42,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039400143] [2022-11-21 13:58:42,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:42,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:42,592 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:58:42,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1164369182] [2022-11-21 13:58:42,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:58:42,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:42,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:42,594 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:42,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 13:58:42,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2022-11-21 13:58:42,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:58:42,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 13:58:42,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 1955 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-21 13:58:43,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:58:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2022-11-21 13:58:43,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:43,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039400143] [2022-11-21 13:58:43,916 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:58:43,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164369182] [2022-11-21 13:58:43,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164369182] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:58:43,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:58:43,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-21 13:58:43,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134205915] [2022-11-21 13:58:43,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:43,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-21 13:58:43,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:43,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-21 13:58:43,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-11-21 13:58:43,920 INFO L87 Difference]: Start difference. First operand 503 states and 568 transitions. Second operand has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 22 states have call predecessors, (64), 22 states have call successors, (64) [2022-11-21 13:58:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:45,221 INFO L93 Difference]: Finished difference Result 1148 states and 1345 transitions. [2022-11-21 13:58:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-21 13:58:45,222 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 22 states have call predecessors, (64), 22 states have call successors, (64) Word has length 209 [2022-11-21 13:58:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:45,229 INFO L225 Difference]: With dead ends: 1148 [2022-11-21 13:58:45,229 INFO L226 Difference]: Without dead ends: 1139 [2022-11-21 13:58:45,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-11-21 13:58:45,232 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 322 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:45,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 360 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 13:58:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2022-11-21 13:58:45,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2022-11-21 13:58:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 754 states have (on average 1.090185676392573) internal successors, (822), 776 states have internal predecessors, (822), 234 states have call successors, (234), 150 states have call predecessors, (234), 150 states have return successors, (232), 212 states have call predecessors, (232), 232 states have call successors, (232) [2022-11-21 13:58:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1288 transitions. [2022-11-21 13:58:45,523 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1288 transitions. Word has length 209 [2022-11-21 13:58:45,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:45,524 INFO L495 AbstractCegarLoop]: Abstraction has 1139 states and 1288 transitions. [2022-11-21 13:58:45,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 22 states have call predecessors, (64), 22 states have call successors, (64) [2022-11-21 13:58:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1288 transitions. [2022-11-21 13:58:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-11-21 13:58:45,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:45,543 INFO L195 NwaCegarLoop]: trace histogram [67, 66, 66, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:45,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 13:58:45,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-21 13:58:45,750 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:58:45,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:45,751 INFO L85 PathProgramCache]: Analyzing trace with hash -767722162, now seen corresponding path program 4 times [2022-11-21 13:58:45,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:45,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384972029] [2022-11-21 13:58:45,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:45,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:45,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:58:45,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1496835872] [2022-11-21 13:58:45,795 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 13:58:45,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:45,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:45,797 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:45,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 13:58:46,058 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 13:58:46,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:58:46,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-21 13:58:46,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 9977 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-11-21 13:58:47,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:58:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 1661 refuted. 0 times theorem prover too weak. 8584 trivial. 0 not checked. [2022-11-21 13:58:48,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:48,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384972029] [2022-11-21 13:58:48,520 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:58:48,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496835872] [2022-11-21 13:58:48,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496835872] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:58:48,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:58:48,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-21 13:58:48,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876550708] [2022-11-21 13:58:48,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:48,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-21 13:58:48,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:48,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-21 13:58:48,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-11-21 13:58:48,528 INFO L87 Difference]: Start difference. First operand 1139 states and 1288 transitions. Second operand has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (137), 25 states have call predecessors, (137), 24 states have return successors, (136), 46 states have call predecessors, (136), 46 states have call successors, (136) [2022-11-21 13:58:51,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:51,872 INFO L93 Difference]: Finished difference Result 2420 states and 2833 transitions. [2022-11-21 13:58:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-21 13:58:51,873 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (137), 25 states have call predecessors, (137), 24 states have return successors, (136), 46 states have call predecessors, (136), 46 states have call successors, (136) Word has length 437 [2022-11-21 13:58:51,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:51,937 INFO L225 Difference]: With dead ends: 2420 [2022-11-21 13:58:51,937 INFO L226 Difference]: Without dead ends: 2411 [2022-11-21 13:58:51,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 917 GetRequests, 824 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-11-21 13:58:51,943 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 614 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:51,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 809 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-21 13:58:51,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2022-11-21 13:58:52,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2411. [2022-11-21 13:58:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 1594 states have (on average 1.0878293601003763) internal successors, (1734), 1640 states have internal predecessors, (1734), 498 states have call successors, (498), 318 states have call predecessors, (498), 318 states have return successors, (496), 452 states have call predecessors, (496), 496 states have call successors, (496) [2022-11-21 13:58:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2728 transitions. [2022-11-21 13:58:52,418 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2728 transitions. Word has length 437 [2022-11-21 13:58:52,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:52,423 INFO L495 AbstractCegarLoop]: Abstraction has 2411 states and 2728 transitions. [2022-11-21 13:58:52,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (137), 25 states have call predecessors, (137), 24 states have return successors, (136), 46 states have call predecessors, (136), 46 states have call successors, (136) [2022-11-21 13:58:52,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2728 transitions. [2022-11-21 13:58:52,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2022-11-21 13:58:52,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:52,464 INFO L195 NwaCegarLoop]: trace histogram [139, 138, 138, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:52,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-21 13:58:52,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 13:58:52,681 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:58:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:52,682 INFO L85 PathProgramCache]: Analyzing trace with hash -776415410, now seen corresponding path program 5 times [2022-11-21 13:58:52,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:52,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102876019] [2022-11-21 13:58:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:52,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:52,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:58:52,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172524397] [2022-11-21 13:58:52,795 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 13:58:52,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:52,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:52,803 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:52,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 14:05:21,107 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2022-11-21 14:05:21,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:05:21,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-21 14:05:21,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:05:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 44597 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-11-21 14:05:23,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:05:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 7337 refuted. 0 times theorem prover too weak. 37816 trivial. 0 not checked. [2022-11-21 14:05:25,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:05:25,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102876019] [2022-11-21 14:05:25,783 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 14:05:25,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172524397] [2022-11-21 14:05:25,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172524397] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:05:25,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:05:25,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-11-21 14:05:25,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483786237] [2022-11-21 14:05:25,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:05:25,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-21 14:05:25,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:05:25,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-21 14:05:25,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-11-21 14:05:25,788 INFO L87 Difference]: Start difference. First operand 2411 states and 2728 transitions. Second operand has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 50 states have call predecessors, (280), 50 states have call successors, (280) [2022-11-21 14:05:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:05:28,624 INFO L93 Difference]: Finished difference Result 2632 states and 2993 transitions. [2022-11-21 14:05:28,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-21 14:05:28,626 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 50 states have call predecessors, (280), 50 states have call successors, (280) Word has length 893 [2022-11-21 14:05:28,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:05:28,637 INFO L225 Difference]: With dead ends: 2632 [2022-11-21 14:05:28,637 INFO L226 Difference]: Without dead ends: 2623 [2022-11-21 14:05:28,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1833 GetRequests, 1688 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-11-21 14:05:28,642 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 457 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 14:05:28,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 869 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 14:05:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2022-11-21 14:05:28,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2623. [2022-11-21 14:05:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 1734 states have (on average 1.0876585928489042) internal successors, (1886), 1784 states have internal predecessors, (1886), 542 states have call successors, (542), 346 states have call predecessors, (542), 346 states have return successors, (540), 492 states have call predecessors, (540), 540 states have call successors, (540) [2022-11-21 14:05:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 2968 transitions. [2022-11-21 14:05:28,953 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 2968 transitions. Word has length 893 [2022-11-21 14:05:28,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:05:28,955 INFO L495 AbstractCegarLoop]: Abstraction has 2623 states and 2968 transitions. [2022-11-21 14:05:28,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (281), 49 states have call predecessors, (281), 48 states have return successors, (280), 50 states have call predecessors, (280), 50 states have call successors, (280) [2022-11-21 14:05:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 2968 transitions. [2022-11-21 14:05:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2022-11-21 14:05:28,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:05:28,999 INFO L195 NwaCegarLoop]: trace histogram [151, 150, 150, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:05:29,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-21 14:05:29,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:05:29,223 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:05:29,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:05:29,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1208919630, now seen corresponding path program 6 times [2022-11-21 14:05:29,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:05:29,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266906124] [2022-11-21 14:05:29,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:05:29,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:05:29,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 14:05:29,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [295249308] [2022-11-21 14:05:29,283 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 14:05:29,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:05:29,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:05:29,284 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:05:29,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-21 14:06:45,906 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 98 check-sat command(s) [2022-11-21 14:06:45,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 14:06:45,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 14:06:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 14:06:46,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 14:06:46,703 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 14:06:46,704 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 14:06:46,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-21 14:06:46,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 14:06:46,927 INFO L444 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:06:46,932 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 14:06:47,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 02:06:47 BoogieIcfgContainer [2022-11-21 14:06:47,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 14:06:47,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 14:06:47,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 14:06:47,179 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 14:06:47,180 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:58:30" (3/4) ... [2022-11-21 14:06:47,182 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 14:06:47,474 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 14:06:47,475 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 14:06:47,475 INFO L158 Benchmark]: Toolchain (without parser) took 497664.66ms. Allocated memory was 192.9MB in the beginning and 337.6MB in the end (delta: 144.7MB). Free memory was 151.3MB in the beginning and 290.8MB in the end (delta: -139.5MB). Peak memory consumption was 200.9MB. Max. memory is 16.1GB. [2022-11-21 14:06:47,476 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 134.2MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 14:06:47,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.25ms. Allocated memory is still 192.9MB. Free memory was 151.3MB in the beginning and 140.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-21 14:06:47,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.14ms. Allocated memory is still 192.9MB. Free memory was 140.6MB in the beginning and 139.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 14:06:47,477 INFO L158 Benchmark]: Boogie Preprocessor took 31.88ms. Allocated memory is still 192.9MB. Free memory was 139.1MB in the beginning and 138.2MB in the end (delta: 856.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 14:06:47,478 INFO L158 Benchmark]: RCFGBuilder took 406.40ms. Allocated memory is still 192.9MB. Free memory was 138.2MB in the beginning and 126.5MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-21 14:06:47,478 INFO L158 Benchmark]: TraceAbstraction took 496597.99ms. Allocated memory was 192.9MB in the beginning and 337.6MB in the end (delta: 144.7MB). Free memory was 125.9MB in the beginning and 136.5MB in the end (delta: -10.6MB). Peak memory consumption was 135.9MB. Max. memory is 16.1GB. [2022-11-21 14:06:47,479 INFO L158 Benchmark]: Witness Printer took 295.65ms. Allocated memory is still 337.6MB. Free memory was 136.5MB in the beginning and 290.8MB in the end (delta: -154.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-21 14:06:47,485 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.35ms. Allocated memory is still 134.2MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.25ms. Allocated memory is still 192.9MB. Free memory was 151.3MB in the beginning and 140.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.14ms. Allocated memory is still 192.9MB. Free memory was 140.6MB in the beginning and 139.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.88ms. Allocated memory is still 192.9MB. Free memory was 139.1MB in the beginning and 138.2MB in the end (delta: 856.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 406.40ms. Allocated memory is still 192.9MB. Free memory was 138.2MB in the beginning and 126.5MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 496597.99ms. Allocated memory was 192.9MB in the beginning and 337.6MB in the end (delta: 144.7MB). Free memory was 125.9MB in the beginning and 136.5MB in the end (delta: -10.6MB). Peak memory consumption was 135.9MB. Max. memory is 16.1GB. * Witness Printer took 295.65ms. Allocated memory is still 337.6MB. Free memory was 136.5MB in the beginning and 290.8MB in the end (delta: -154.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=103, y=2] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=103, y=2] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=103, b=2, counter=0, p=1, q=0, r=0, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=103, b=2, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=103, b=2, counter=1, p=1, q=0, r=0, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=103, b=2, counter=1, p=1, q=0, r=0, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=103, b=2, counter=1, p=1, q=0, r=0, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=103, b=2, counter=1, p=1, q=0, r=0, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=101, b=2, counter=1, p=1, q=0, r=-1, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=101, b=2, counter=2, counter++=1, p=1, q=0, r=-1, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=101, b=2, counter=2, p=1, q=0, r=-1, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=101, b=2, counter=2, p=1, q=0, r=-1, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=101, b=2, counter=2, p=1, q=0, r=-1, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=101, b=2, counter=2, p=1, q=0, r=-1, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=99, b=2, counter=2, p=1, q=0, r=-2, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=99, b=2, counter=3, counter++=2, p=1, q=0, r=-2, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=99, b=2, counter=3, p=1, q=0, r=-2, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=99, b=2, counter=3, p=1, q=0, r=-2, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=99, b=2, counter=3, p=1, q=0, r=-2, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=99, b=2, counter=3, p=1, q=0, r=-2, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=97, b=2, counter=3, p=1, q=0, r=-3, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=97, b=2, counter=4, counter++=3, p=1, q=0, r=-3, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=97, b=2, counter=4, p=1, q=0, r=-3, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=97, b=2, counter=4, p=1, q=0, r=-3, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=97, b=2, counter=4, p=1, q=0, r=-3, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=97, b=2, counter=4, p=1, q=0, r=-3, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=95, b=2, counter=4, p=1, q=0, r=-4, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=95, b=2, counter=5, counter++=4, p=1, q=0, r=-4, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=95, b=2, counter=5, p=1, q=0, r=-4, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=95, b=2, counter=5, p=1, q=0, r=-4, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=95, b=2, counter=5, p=1, q=0, r=-4, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=95, b=2, counter=5, p=1, q=0, r=-4, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=93, b=2, counter=5, p=1, q=0, r=-5, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=93, b=2, counter=6, counter++=5, p=1, q=0, r=-5, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=93, b=2, counter=6, p=1, q=0, r=-5, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=93, b=2, counter=6, p=1, q=0, r=-5, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=93, b=2, counter=6, p=1, q=0, r=-5, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=93, b=2, counter=6, p=1, q=0, r=-5, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=91, b=2, counter=6, p=1, q=0, r=-6, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=91, b=2, counter=7, counter++=6, p=1, q=0, r=-6, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=91, b=2, counter=7, p=1, q=0, r=-6, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=91, b=2, counter=7, p=1, q=0, r=-6, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=91, b=2, counter=7, p=1, q=0, r=-6, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=91, b=2, counter=7, p=1, q=0, r=-6, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=89, b=2, counter=7, p=1, q=0, r=-7, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=89, b=2, counter=8, counter++=7, p=1, q=0, r=-7, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=89, b=2, counter=8, p=1, q=0, r=-7, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=89, b=2, counter=8, p=1, q=0, r=-7, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=89, b=2, counter=8, p=1, q=0, r=-7, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=89, b=2, counter=8, p=1, q=0, r=-7, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=87, b=2, counter=8, p=1, q=0, r=-8, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=87, b=2, counter=9, counter++=8, p=1, q=0, r=-8, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=87, b=2, counter=9, p=1, q=0, r=-8, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=87, b=2, counter=9, p=1, q=0, r=-8, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=87, b=2, counter=9, p=1, q=0, r=-8, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=87, b=2, counter=9, p=1, q=0, r=-8, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=85, b=2, counter=9, p=1, q=0, r=-9, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=85, b=2, counter=10, counter++=9, p=1, q=0, r=-9, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=85, b=2, counter=10, p=1, q=0, r=-9, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=85, b=2, counter=10, p=1, q=0, r=-9, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=85, b=2, counter=10, p=1, q=0, r=-9, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=85, b=2, counter=10, p=1, q=0, r=-9, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=83, b=2, counter=10, p=1, q=0, r=-10, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=83, b=2, counter=11, counter++=10, p=1, q=0, r=-10, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=83, b=2, counter=11, p=1, q=0, r=-10, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=83, b=2, counter=11, p=1, q=0, r=-10, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=83, b=2, counter=11, p=1, q=0, r=-10, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=83, b=2, counter=11, p=1, q=0, r=-10, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=81, b=2, counter=11, p=1, q=0, r=-11, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=81, b=2, counter=12, counter++=11, p=1, q=0, r=-11, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=81, b=2, counter=12, p=1, q=0, r=-11, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=81, b=2, counter=12, p=1, q=0, r=-11, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=81, b=2, counter=12, p=1, q=0, r=-11, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=81, b=2, counter=12, p=1, q=0, r=-11, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=79, b=2, counter=12, p=1, q=0, r=-12, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=79, b=2, counter=13, counter++=12, p=1, q=0, r=-12, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=79, b=2, counter=13, p=1, q=0, r=-12, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=79, b=2, counter=13, p=1, q=0, r=-12, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=79, b=2, counter=13, p=1, q=0, r=-12, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=79, b=2, counter=13, p=1, q=0, r=-12, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=77, b=2, counter=13, p=1, q=0, r=-13, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=77, b=2, counter=14, counter++=13, p=1, q=0, r=-13, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=77, b=2, counter=14, p=1, q=0, r=-13, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=77, b=2, counter=14, p=1, q=0, r=-13, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=77, b=2, counter=14, p=1, q=0, r=-13, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=77, b=2, counter=14, p=1, q=0, r=-13, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=75, b=2, counter=14, p=1, q=0, r=-14, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=75, b=2, counter=15, counter++=14, p=1, q=0, r=-14, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=75, b=2, counter=15, p=1, q=0, r=-14, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=75, b=2, counter=15, p=1, q=0, r=-14, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=75, b=2, counter=15, p=1, q=0, r=-14, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=75, b=2, counter=15, p=1, q=0, r=-14, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=73, b=2, counter=15, p=1, q=0, r=-15, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=73, b=2, counter=16, counter++=15, p=1, q=0, r=-15, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=73, b=2, counter=16, p=1, q=0, r=-15, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=73, b=2, counter=16, p=1, q=0, r=-15, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=73, b=2, counter=16, p=1, q=0, r=-15, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=73, b=2, counter=16, p=1, q=0, r=-15, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=71, b=2, counter=16, p=1, q=0, r=-16, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=71, b=2, counter=17, counter++=16, p=1, q=0, r=-16, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=71, b=2, counter=17, p=1, q=0, r=-16, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=71, b=2, counter=17, p=1, q=0, r=-16, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=71, b=2, counter=17, p=1, q=0, r=-16, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=71, b=2, counter=17, p=1, q=0, r=-16, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=69, b=2, counter=17, p=1, q=0, r=-17, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=69, b=2, counter=18, counter++=17, p=1, q=0, r=-17, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=69, b=2, counter=18, p=1, q=0, r=-17, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=69, b=2, counter=18, p=1, q=0, r=-17, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=69, b=2, counter=18, p=1, q=0, r=-17, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=69, b=2, counter=18, p=1, q=0, r=-17, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=67, b=2, counter=18, p=1, q=0, r=-18, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=67, b=2, counter=19, counter++=18, p=1, q=0, r=-18, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=67, b=2, counter=19, p=1, q=0, r=-18, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=67, b=2, counter=19, p=1, q=0, r=-18, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=67, b=2, counter=19, p=1, q=0, r=-18, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=67, b=2, counter=19, p=1, q=0, r=-18, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=65, b=2, counter=19, p=1, q=0, r=-19, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=65, b=2, counter=20, counter++=19, p=1, q=0, r=-19, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=65, b=2, counter=20, p=1, q=0, r=-19, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=65, b=2, counter=20, p=1, q=0, r=-19, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=65, b=2, counter=20, p=1, q=0, r=-19, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=65, b=2, counter=20, p=1, q=0, r=-19, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=63, b=2, counter=20, p=1, q=0, r=-20, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=63, b=2, counter=21, counter++=20, p=1, q=0, r=-20, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=63, b=2, counter=21, p=1, q=0, r=-20, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=63, b=2, counter=21, p=1, q=0, r=-20, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=63, b=2, counter=21, p=1, q=0, r=-20, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=63, b=2, counter=21, p=1, q=0, r=-20, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=61, b=2, counter=21, p=1, q=0, r=-21, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=61, b=2, counter=22, counter++=21, p=1, q=0, r=-21, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=61, b=2, counter=22, p=1, q=0, r=-21, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=61, b=2, counter=22, p=1, q=0, r=-21, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=61, b=2, counter=22, p=1, q=0, r=-21, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=61, b=2, counter=22, p=1, q=0, r=-21, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=59, b=2, counter=22, p=1, q=0, r=-22, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=59, b=2, counter=23, counter++=22, p=1, q=0, r=-22, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=59, b=2, counter=23, p=1, q=0, r=-22, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=59, b=2, counter=23, p=1, q=0, r=-22, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=59, b=2, counter=23, p=1, q=0, r=-22, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=59, b=2, counter=23, p=1, q=0, r=-22, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=57, b=2, counter=23, p=1, q=0, r=-23, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=57, b=2, counter=24, counter++=23, p=1, q=0, r=-23, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=57, b=2, counter=24, p=1, q=0, r=-23, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=57, b=2, counter=24, p=1, q=0, r=-23, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=57, b=2, counter=24, p=1, q=0, r=-23, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=57, b=2, counter=24, p=1, q=0, r=-23, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=55, b=2, counter=24, p=1, q=0, r=-24, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=55, b=2, counter=25, counter++=24, p=1, q=0, r=-24, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=55, b=2, counter=25, p=1, q=0, r=-24, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=55, b=2, counter=25, p=1, q=0, r=-24, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=55, b=2, counter=25, p=1, q=0, r=-24, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=55, b=2, counter=25, p=1, q=0, r=-24, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=53, b=2, counter=25, p=1, q=0, r=-25, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=53, b=2, counter=26, counter++=25, p=1, q=0, r=-25, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=53, b=2, counter=26, p=1, q=0, r=-25, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=53, b=2, counter=26, p=1, q=0, r=-25, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=53, b=2, counter=26, p=1, q=0, r=-25, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=53, b=2, counter=26, p=1, q=0, r=-25, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=51, b=2, counter=26, p=1, q=0, r=-26, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=51, b=2, counter=27, counter++=26, p=1, q=0, r=-26, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=51, b=2, counter=27, p=1, q=0, r=-26, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=51, b=2, counter=27, p=1, q=0, r=-26, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=51, b=2, counter=27, p=1, q=0, r=-26, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=51, b=2, counter=27, p=1, q=0, r=-26, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=49, b=2, counter=27, p=1, q=0, r=-27, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=49, b=2, counter=28, counter++=27, p=1, q=0, r=-27, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=49, b=2, counter=28, p=1, q=0, r=-27, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=49, b=2, counter=28, p=1, q=0, r=-27, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=49, b=2, counter=28, p=1, q=0, r=-27, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=49, b=2, counter=28, p=1, q=0, r=-27, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=47, b=2, counter=28, p=1, q=0, r=-28, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=47, b=2, counter=29, counter++=28, p=1, q=0, r=-28, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=47, b=2, counter=29, p=1, q=0, r=-28, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=47, b=2, counter=29, p=1, q=0, r=-28, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=47, b=2, counter=29, p=1, q=0, r=-28, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=47, b=2, counter=29, p=1, q=0, r=-28, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=45, b=2, counter=29, p=1, q=0, r=-29, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=45, b=2, counter=30, counter++=29, p=1, q=0, r=-29, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=45, b=2, counter=30, p=1, q=0, r=-29, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=45, b=2, counter=30, p=1, q=0, r=-29, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=45, b=2, counter=30, p=1, q=0, r=-29, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=45, b=2, counter=30, p=1, q=0, r=-29, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=43, b=2, counter=30, p=1, q=0, r=-30, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=43, b=2, counter=31, counter++=30, p=1, q=0, r=-30, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=43, b=2, counter=31, p=1, q=0, r=-30, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=43, b=2, counter=31, p=1, q=0, r=-30, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=43, b=2, counter=31, p=1, q=0, r=-30, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=43, b=2, counter=31, p=1, q=0, r=-30, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=41, b=2, counter=31, p=1, q=0, r=-31, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=41, b=2, counter=32, counter++=31, p=1, q=0, r=-31, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=41, b=2, counter=32, p=1, q=0, r=-31, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=41, b=2, counter=32, p=1, q=0, r=-31, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=41, b=2, counter=32, p=1, q=0, r=-31, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=41, b=2, counter=32, p=1, q=0, r=-31, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=39, b=2, counter=32, p=1, q=0, r=-32, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=39, b=2, counter=33, counter++=32, p=1, q=0, r=-32, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=39, b=2, counter=33, p=1, q=0, r=-32, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=39, b=2, counter=33, p=1, q=0, r=-32, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=39, b=2, counter=33, p=1, q=0, r=-32, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=39, b=2, counter=33, p=1, q=0, r=-32, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=37, b=2, counter=33, p=1, q=0, r=-33, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=37, b=2, counter=34, counter++=33, p=1, q=0, r=-33, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=37, b=2, counter=34, p=1, q=0, r=-33, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=37, b=2, counter=34, p=1, q=0, r=-33, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=37, b=2, counter=34, p=1, q=0, r=-33, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=37, b=2, counter=34, p=1, q=0, r=-33, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=35, b=2, counter=34, p=1, q=0, r=-34, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=35, b=2, counter=35, counter++=34, p=1, q=0, r=-34, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=35, b=2, counter=35, p=1, q=0, r=-34, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=35, b=2, counter=35, p=1, q=0, r=-34, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=35, b=2, counter=35, p=1, q=0, r=-34, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=35, b=2, counter=35, p=1, q=0, r=-34, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=33, b=2, counter=35, p=1, q=0, r=-35, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=33, b=2, counter=36, counter++=35, p=1, q=0, r=-35, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=33, b=2, counter=36, p=1, q=0, r=-35, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=33, b=2, counter=36, p=1, q=0, r=-35, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=33, b=2, counter=36, p=1, q=0, r=-35, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=33, b=2, counter=36, p=1, q=0, r=-35, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=31, b=2, counter=36, p=1, q=0, r=-36, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=31, b=2, counter=37, counter++=36, p=1, q=0, r=-36, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=31, b=2, counter=37, p=1, q=0, r=-36, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=31, b=2, counter=37, p=1, q=0, r=-36, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=31, b=2, counter=37, p=1, q=0, r=-36, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=31, b=2, counter=37, p=1, q=0, r=-36, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=29, b=2, counter=37, p=1, q=0, r=-37, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=29, b=2, counter=38, counter++=37, p=1, q=0, r=-37, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=29, b=2, counter=38, p=1, q=0, r=-37, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=29, b=2, counter=38, p=1, q=0, r=-37, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=29, b=2, counter=38, p=1, q=0, r=-37, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=29, b=2, counter=38, p=1, q=0, r=-37, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=27, b=2, counter=38, p=1, q=0, r=-38, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=27, b=2, counter=39, counter++=38, p=1, q=0, r=-38, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=27, b=2, counter=39, p=1, q=0, r=-38, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=27, b=2, counter=39, p=1, q=0, r=-38, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=27, b=2, counter=39, p=1, q=0, r=-38, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=27, b=2, counter=39, p=1, q=0, r=-38, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=25, b=2, counter=39, p=1, q=0, r=-39, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=25, b=2, counter=40, counter++=39, p=1, q=0, r=-39, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=25, b=2, counter=40, p=1, q=0, r=-39, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=25, b=2, counter=40, p=1, q=0, r=-39, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=25, b=2, counter=40, p=1, q=0, r=-39, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=25, b=2, counter=40, p=1, q=0, r=-39, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=23, b=2, counter=40, p=1, q=0, r=-40, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=23, b=2, counter=41, counter++=40, p=1, q=0, r=-40, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=23, b=2, counter=41, p=1, q=0, r=-40, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=23, b=2, counter=41, p=1, q=0, r=-40, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=23, b=2, counter=41, p=1, q=0, r=-40, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=23, b=2, counter=41, p=1, q=0, r=-40, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=21, b=2, counter=41, p=1, q=0, r=-41, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=21, b=2, counter=42, counter++=41, p=1, q=0, r=-41, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=21, b=2, counter=42, p=1, q=0, r=-41, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=21, b=2, counter=42, p=1, q=0, r=-41, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=21, b=2, counter=42, p=1, q=0, r=-41, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=21, b=2, counter=42, p=1, q=0, r=-41, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=19, b=2, counter=42, p=1, q=0, r=-42, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=19, b=2, counter=43, counter++=42, p=1, q=0, r=-42, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=19, b=2, counter=43, p=1, q=0, r=-42, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=19, b=2, counter=43, p=1, q=0, r=-42, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=19, b=2, counter=43, p=1, q=0, r=-42, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=19, b=2, counter=43, p=1, q=0, r=-42, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=17, b=2, counter=43, p=1, q=0, r=-43, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=17, b=2, counter=44, counter++=43, p=1, q=0, r=-43, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=17, b=2, counter=44, p=1, q=0, r=-43, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=17, b=2, counter=44, p=1, q=0, r=-43, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=17, b=2, counter=44, p=1, q=0, r=-43, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=17, b=2, counter=44, p=1, q=0, r=-43, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=15, b=2, counter=44, p=1, q=0, r=-44, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=15, b=2, counter=45, counter++=44, p=1, q=0, r=-44, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=15, b=2, counter=45, p=1, q=0, r=-44, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=15, b=2, counter=45, p=1, q=0, r=-44, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=15, b=2, counter=45, p=1, q=0, r=-44, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=15, b=2, counter=45, p=1, q=0, r=-44, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=13, b=2, counter=45, p=1, q=0, r=-45, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=13, b=2, counter=46, counter++=45, p=1, q=0, r=-45, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=13, b=2, counter=46, p=1, q=0, r=-45, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=13, b=2, counter=46, p=1, q=0, r=-45, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=13, b=2, counter=46, p=1, q=0, r=-45, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=13, b=2, counter=46, p=1, q=0, r=-45, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=11, b=2, counter=46, p=1, q=0, r=-46, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=11, b=2, counter=47, counter++=46, p=1, q=0, r=-46, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=2, counter=47, p=1, q=0, r=-46, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=11, b=2, counter=47, p=1, q=0, r=-46, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=11, b=2, counter=47, p=1, q=0, r=-46, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=2, counter=47, p=1, q=0, r=-46, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=9, b=2, counter=47, p=1, q=0, r=-47, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=9, b=2, counter=48, counter++=47, p=1, q=0, r=-47, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=2, counter=48, p=1, q=0, r=-47, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=9, b=2, counter=48, p=1, q=0, r=-47, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=9, b=2, counter=48, p=1, q=0, r=-47, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=2, counter=48, p=1, q=0, r=-47, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=7, b=2, counter=48, p=1, q=0, r=-48, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=7, b=2, counter=49, counter++=48, p=1, q=0, r=-48, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=2, counter=49, p=1, q=0, r=-48, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=2, counter=49, p=1, q=0, r=-48, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=2, counter=49, p=1, q=0, r=-48, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=2, counter=49, p=1, q=0, r=-48, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=5, b=2, counter=49, p=1, q=0, r=-49, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=5, b=2, counter=50, counter++=49, p=1, q=0, r=-49, s=1, x=103, y=2] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=2, counter=50, p=1, q=0, r=-49, s=1, x=103, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=2, counter=50, p=1, q=0, r=-49, s=1, x=103, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=2, counter=50, p=1, q=0, r=-49, s=1, x=103, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=2, counter=50, p=1, q=0, r=-49, s=1, x=103, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=3, b=2, counter=50, p=1, q=0, r=-50, s=1, x=103, y=2] [L34] EXPR counter++ VAL [a=3, b=2, counter=51, counter++=50, p=1, q=0, r=-50, s=1, x=103, y=2] [L34] COND FALSE !(counter++<50) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=51] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L13] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 496.3s, OverallIterations: 16, TraceHistogramMax: 151, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1796 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1756 mSDsluCounter, 3725 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2863 mSDsCounter, 1084 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3295 IncrementalHoareTripleChecker+Invalid, 4379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1084 mSolverCounterUnsat, 862 mSDtfsCounter, 3295 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3931 GetRequests, 3521 SyntacticMatches, 49 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4098 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2623occurred in iteration=15, InterpolantAutomatonStates: 349, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 42 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 465.4s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 2963 NumberOfCodeBlocks, 2948 NumberOfCodeBlocksAsserted, 224 NumberOfCheckSat, 3783 ConstructedInterpolants, 0 QuantifiedInterpolants, 9656 SizeOfPredicates, 112 NumberOfNonLiveVariables, 4531 ConjunctsInSsa, 344 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 50778/117029 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! [2022-11-21 14:06:47,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a302b82c-d690-464d-8b68-49d7cb62c104/bin/uautomizer-vX5HgA9Q3a/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