./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 e04fb08f 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_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/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_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8 --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-e04fb08 [2022-11-16 12:46:14,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:46:14,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:46:14,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:46:14,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:46:14,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:46:14,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:46:14,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:46:14,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:46:14,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:46:14,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:46:14,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:46:14,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:46:14,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:46:14,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:46:14,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:46:14,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:46:14,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:46:14,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:46:14,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:46:14,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:46:14,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:46:14,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:46:14,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:46:14,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:46:14,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:46:14,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:46:14,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:46:14,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:46:14,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:46:14,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:46:14,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:46:14,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:46:14,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:46:14,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:46:14,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:46:14,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:46:14,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:46:14,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:46:14,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:46:14,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:46:14,357 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:46:14,406 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:46:14,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:46:14,407 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:46:14,407 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:46:14,408 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:46:14,408 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:46:14,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:46:14,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:46:14,409 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:46:14,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:46:14,411 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:46:14,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:46:14,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:46:14,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:46:14,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:46:14,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:46:14,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:46:14,412 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:46:14,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:46:14,413 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:46:14,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:46:14,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:46:14,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:46:14,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:46:14,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:46:14,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:46:14,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:46:14,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:46:14,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:46:14,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:46:14,415 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:46:14,415 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:46:14,416 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:46:14,416 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_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/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_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8 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-16 12:46:14,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:46:14,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:46:14,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:46:14,780 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:46:14,781 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:46:14,783 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2022-11-16 12:46:14,874 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/data/321a39b61/657d1b5c7a3249ed95ba27a0d8d67521/FLAG702586204 [2022-11-16 12:46:15,472 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:46:15,475 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2022-11-16 12:46:15,484 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/data/321a39b61/657d1b5c7a3249ed95ba27a0d8d67521/FLAG702586204 [2022-11-16 12:46:15,814 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/data/321a39b61/657d1b5c7a3249ed95ba27a0d8d67521 [2022-11-16 12:46:15,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:46:15,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:46:15,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:46:15,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:46:15,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:46:15,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:46:15" (1/1) ... [2022-11-16 12:46:15,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7121033d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:15, skipping insertion in model container [2022-11-16 12:46:15,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:46:15" (1/1) ... [2022-11-16 12:46:15,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:46:15,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:46:16,116 WARN L229 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_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c[489,502] [2022-11-16 12:46:16,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:46:16,152 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:46:16,165 WARN L229 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_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c[489,502] [2022-11-16 12:46:16,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:46:16,186 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:46:16,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:16 WrapperNode [2022-11-16 12:46:16,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:46:16,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:46:16,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:46:16,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:46:16,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:16" (1/1) ... [2022-11-16 12:46:16,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:16" (1/1) ... [2022-11-16 12:46:16,224 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2022-11-16 12:46:16,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:46:16,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:46:16,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:46:16,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:46:16,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:16" (1/1) ... [2022-11-16 12:46:16,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:16" (1/1) ... [2022-11-16 12:46:16,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:16" (1/1) ... [2022-11-16 12:46:16,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:16" (1/1) ... [2022-11-16 12:46:16,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:16" (1/1) ... [2022-11-16 12:46:16,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:16" (1/1) ... [2022-11-16 12:46:16,260 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:16" (1/1) ... [2022-11-16 12:46:16,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:16" (1/1) ... [2022-11-16 12:46:16,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:46:16,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:46:16,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:46:16,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:46:16,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:16" (1/1) ... [2022-11-16 12:46:16,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:46:16,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:16,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:46:16,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:46:16,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:46:16,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 12:46:16,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 12:46:16,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:46:16,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:46:16,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:46:16,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 12:46:16,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 12:46:16,418 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:46:16,422 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:46:16,678 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:46:16,700 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:46:16,714 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 12:46:16,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:46:16 BoogieIcfgContainer [2022-11-16 12:46:16,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:46:16,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:46:16,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:46:16,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:46:16,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:46:15" (1/3) ... [2022-11-16 12:46:16,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afd2222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:46:16, skipping insertion in model container [2022-11-16 12:46:16,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:16" (2/3) ... [2022-11-16 12:46:16,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afd2222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:46:16, skipping insertion in model container [2022-11-16 12:46:16,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:46:16" (3/3) ... [2022-11-16 12:46:16,725 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound50.c [2022-11-16 12:46:16,756 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:46:16,756 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:46:16,846 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:46:16,858 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;@2b839c00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:46:16,859 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:46:16,863 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-16 12:46:16,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:46:16,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:16,872 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:16,873 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:16,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:16,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1165920622, now seen corresponding path program 1 times [2022-11-16 12:46:16,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:16,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716812322] [2022-11-16 12:46:16,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:16,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:17,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:17,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:46:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:17,141 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-16 12:46:17,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:17,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716812322] [2022-11-16 12:46:17,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716812322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:17,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:17,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:46:17,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140711482] [2022-11-16 12:46:17,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:17,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:46:17,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:17,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:46:17,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:46:17,194 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-16 12:46:17,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:17,256 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2022-11-16 12:46:17,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:46:17,259 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-16 12:46:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:17,278 INFO L225 Difference]: With dead ends: 57 [2022-11-16 12:46:17,279 INFO L226 Difference]: Without dead ends: 26 [2022-11-16 12:46:17,286 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-16 12:46:17,290 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-16 12:46:17,291 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-16 12:46:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-16 12:46:17,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-16 12:46:17,353 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-16 12:46:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-11-16 12:46:17,357 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2022-11-16 12:46:17,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:17,357 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-11-16 12:46:17,358 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-16 12:46:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-11-16 12:46:17,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 12:46:17,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:17,361 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:17,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:46:17,362 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:17,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:17,364 INFO L85 PathProgramCache]: Analyzing trace with hash -542319922, now seen corresponding path program 1 times [2022-11-16 12:46:17,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:17,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111170278] [2022-11-16 12:46:17,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:17,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:17,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:46:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:17,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:46:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:17,573 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-16 12:46:17,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:17,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111170278] [2022-11-16 12:46:17,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111170278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:17,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:17,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:46:17,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150461982] [2022-11-16 12:46:17,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:17,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:46:17,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:17,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:46:17,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:46:17,578 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-16 12:46:17,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:17,606 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-11-16 12:46:17,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:46:17,607 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-16 12:46:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:17,608 INFO L225 Difference]: With dead ends: 38 [2022-11-16 12:46:17,608 INFO L226 Difference]: Without dead ends: 28 [2022-11-16 12:46:17,608 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-16 12:46:17,610 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-16 12:46:17,611 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-16 12:46:17,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-16 12:46:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-16 12:46:17,617 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-16 12:46:17,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-11-16 12:46:17,619 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2022-11-16 12:46:17,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:17,621 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-11-16 12:46:17,621 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-16 12:46:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-11-16 12:46:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 12:46:17,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:17,623 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:17,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:46:17,623 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:17,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:17,624 INFO L85 PathProgramCache]: Analyzing trace with hash -540651626, now seen corresponding path program 1 times [2022-11-16 12:46:17,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:17,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830076096] [2022-11-16 12:46:17,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:17,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:17,644 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:46:17,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698976401] [2022-11-16 12:46:17,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:17,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:17,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:17,658 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:17,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:46:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:17,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 12:46:17,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:17,934 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-16 12:46:17,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:46:17,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:17,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830076096] [2022-11-16 12:46:17,936 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:46:17,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698976401] [2022-11-16 12:46:17,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698976401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:17,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:17,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:46:17,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606192311] [2022-11-16 12:46:17,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:17,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:46:17,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:17,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:46:17,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:46:17,949 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-16 12:46:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:18,113 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-11-16 12:46:18,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:46:18,114 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-16 12:46:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:18,115 INFO L225 Difference]: With dead ends: 45 [2022-11-16 12:46:18,115 INFO L226 Difference]: Without dead ends: 43 [2022-11-16 12:46:18,116 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-16 12:46:18,117 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:18,117 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.1s Time] [2022-11-16 12:46:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-16 12:46:18,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-11-16 12:46:18,127 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-16 12:46:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2022-11-16 12:46:18,129 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2022-11-16 12:46:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:18,130 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2022-11-16 12:46:18,130 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-16 12:46:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2022-11-16 12:46:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 12:46:18,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:18,131 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-16 12:46:18,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:18,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:18,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:18,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:18,337 INFO L85 PathProgramCache]: Analyzing trace with hash -276555716, now seen corresponding path program 1 times [2022-11-16 12:46:18,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:18,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608876085] [2022-11-16 12:46:18,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:18,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:18,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:46:18,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1675117283] [2022-11-16 12:46:18,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:18,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:18,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:18,358 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:18,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:46:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:18,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-16 12:46:18,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:18,616 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-16 12:46:18,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:46:18,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:18,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608876085] [2022-11-16 12:46:18,617 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:46:18,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675117283] [2022-11-16 12:46:18,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675117283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:18,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:18,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:46:18,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558901050] [2022-11-16 12:46:18,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:18,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:46:18,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:18,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:46:18,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:46:18,620 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-16 12:46:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:18,794 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-11-16 12:46:18,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:46:18,796 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-16 12:46:18,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:18,797 INFO L225 Difference]: With dead ends: 49 [2022-11-16 12:46:18,798 INFO L226 Difference]: Without dead ends: 47 [2022-11-16 12:46:18,798 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-16 12:46:18,799 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:18,800 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.1s Time] [2022-11-16 12:46:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-16 12:46:18,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-11-16 12:46:18,810 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-16 12:46:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2022-11-16 12:46:18,811 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2022-11-16 12:46:18,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:18,812 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2022-11-16 12:46:18,812 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-16 12:46:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-11-16 12:46:18,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 12:46:18,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:18,814 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-16 12:46:18,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:19,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:19,020 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:19,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:19,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1836785898, now seen corresponding path program 1 times [2022-11-16 12:46:19,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:19,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435725333] [2022-11-16 12:46:19,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:19,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:19,039 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:46:19,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1529459113] [2022-11-16 12:46:19,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:19,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:19,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:19,048 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:19,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:46:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:19,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 12:46:19,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:19,343 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-16 12:46:19,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:19,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:19,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435725333] [2022-11-16 12:46:19,497 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:46:19,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529459113] [2022-11-16 12:46:19,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529459113] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:19,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:46:19,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-11-16 12:46:19,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882341128] [2022-11-16 12:46:19,498 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:19,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:46:19,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:19,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:46:19,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:46:19,499 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-16 12:46:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:19,836 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2022-11-16 12:46:19,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:46:19,836 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-16 12:46:19,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:19,839 INFO L225 Difference]: With dead ends: 71 [2022-11-16 12:46:19,839 INFO L226 Difference]: Without dead ends: 67 [2022-11-16 12:46:19,840 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-16 12:46:19,841 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-16 12:46:19,841 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-16 12:46:19,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-16 12:46:19,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-16 12:46:19,864 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-16 12:46:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2022-11-16 12:46:19,865 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 29 [2022-11-16 12:46:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:19,865 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2022-11-16 12:46:19,866 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-16 12:46:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2022-11-16 12:46:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 12:46:19,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:19,867 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-16 12:46:19,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:20,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:20,072 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:20,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1071030291, now seen corresponding path program 1 times [2022-11-16 12:46:20,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:20,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109806716] [2022-11-16 12:46:20,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:20,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:20,083 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:46:20,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [19301968] [2022-11-16 12:46:20,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:20,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:20,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:20,085 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:20,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:46:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:20,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 12:46:20,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:20,172 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-16 12:46:20,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:46:20,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:20,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109806716] [2022-11-16 12:46:20,173 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:46:20,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19301968] [2022-11-16 12:46:20,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19301968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:20,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:20,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:46:20,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205502665] [2022-11-16 12:46:20,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:20,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:46:20,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:20,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:46:20,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:46:20,176 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-16 12:46:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:20,241 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2022-11-16 12:46:20,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:46:20,242 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-16 12:46:20,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:20,245 INFO L225 Difference]: With dead ends: 83 [2022-11-16 12:46:20,246 INFO L226 Difference]: Without dead ends: 81 [2022-11-16 12:46:20,246 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-16 12:46:20,248 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-16 12:46:20,249 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-16 12:46:20,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-16 12:46:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-11-16 12:46:20,275 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-16 12:46:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2022-11-16 12:46:20,276 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 35 [2022-11-16 12:46:20,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:20,277 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2022-11-16 12:46:20,277 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-16 12:46:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2022-11-16 12:46:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 12:46:20,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:20,278 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-16 12:46:20,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:20,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:20,484 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:20,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:20,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1689492770, now seen corresponding path program 1 times [2022-11-16 12:46:20,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:20,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061507812] [2022-11-16 12:46:20,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:20,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:20,496 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:46:20,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1928639788] [2022-11-16 12:46:20,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:20,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:20,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:20,498 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:20,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:46:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:20,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:46:20,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:20,640 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-16 12:46:20,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:20,719 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-16 12:46:20,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:20,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061507812] [2022-11-16 12:46:20,722 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:46:20,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928639788] [2022-11-16 12:46:20,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928639788] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:20,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:46:20,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-16 12:46:20,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614923678] [2022-11-16 12:46:20,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:20,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:46:20,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:20,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:46:20,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:46:20,727 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-16 12:46:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:20,921 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2022-11-16 12:46:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:46:20,922 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-16 12:46:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:20,924 INFO L225 Difference]: With dead ends: 218 [2022-11-16 12:46:20,924 INFO L226 Difference]: Without dead ends: 196 [2022-11-16 12:46:20,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:46:20,926 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-16 12:46:20,926 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-16 12:46:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-16 12:46:20,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2022-11-16 12:46:20,957 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-16 12:46:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2022-11-16 12:46:20,959 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 38 [2022-11-16 12:46:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:20,960 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2022-11-16 12:46:20,960 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-16 12:46:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2022-11-16 12:46:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 12:46:20,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:20,962 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-16 12:46:20,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:21,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:21,167 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:21,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:21,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1691161066, now seen corresponding path program 1 times [2022-11-16 12:46:21,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:21,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029145295] [2022-11-16 12:46:21,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:21,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:21,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:46:21,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [928705099] [2022-11-16 12:46:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:21,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:21,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:21,194 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:21,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:46:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:21,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 12:46:21,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:21,394 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-16 12:46:21,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:21,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:21,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029145295] [2022-11-16 12:46:21,623 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:46:21,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928705099] [2022-11-16 12:46:21,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928705099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:21,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:46:21,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-11-16 12:46:21,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70096460] [2022-11-16 12:46:21,624 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:21,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:46:21,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:21,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:46:21,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:46:21,625 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-16 12:46:21,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:21,813 INFO L93 Difference]: Finished difference Result 204 states and 260 transitions. [2022-11-16 12:46:21,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:46:21,814 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-16 12:46:21,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:21,816 INFO L225 Difference]: With dead ends: 204 [2022-11-16 12:46:21,816 INFO L226 Difference]: Without dead ends: 199 [2022-11-16 12:46:21,819 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-16 12:46:21,819 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-16 12:46:21,820 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-16 12:46:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-16 12:46:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-11-16 12:46:21,849 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-16 12:46:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2022-11-16 12:46:21,851 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2022-11-16 12:46:21,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:21,851 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2022-11-16 12:46:21,851 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-16 12:46:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2022-11-16 12:46:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 12:46:21,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:21,853 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-16 12:46:21,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:22,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-16 12:46:22,058 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:22,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1925895455, now seen corresponding path program 1 times [2022-11-16 12:46:22,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:22,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140994870] [2022-11-16 12:46:22,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:22,068 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:46:22,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1607728460] [2022-11-16 12:46:22,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:22,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:22,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:22,070 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:22,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:46:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:22,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-16 12:46:22,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:22,245 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-16 12:46:22,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:22,453 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-16 12:46:22,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:22,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140994870] [2022-11-16 12:46:22,453 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:46:22,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607728460] [2022-11-16 12:46:22,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607728460] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:22,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:46:22,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-11-16 12:46:22,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128403113] [2022-11-16 12:46:22,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:22,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:46:22,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:22,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:46:22,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:46:22,456 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-16 12:46:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:22,692 INFO L93 Difference]: Finished difference Result 228 states and 286 transitions. [2022-11-16 12:46:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:46:22,694 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-16 12:46:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:22,699 INFO L225 Difference]: With dead ends: 228 [2022-11-16 12:46:22,699 INFO L226 Difference]: Without dead ends: 212 [2022-11-16 12:46:22,700 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-16 12:46:22,703 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-16 12:46:22,703 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-16 12:46:22,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-16 12:46:22,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2022-11-16 12:46:22,741 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-16 12:46:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 258 transitions. [2022-11-16 12:46:22,745 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 258 transitions. Word has length 40 [2022-11-16 12:46:22,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:22,746 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 258 transitions. [2022-11-16 12:46:22,747 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-16 12:46:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 258 transitions. [2022-11-16 12:46:22,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 12:46:22,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:22,754 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-16 12:46:22,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:22,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:22,960 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:22,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:22,966 INFO L85 PathProgramCache]: Analyzing trace with hash 968731240, now seen corresponding path program 2 times [2022-11-16 12:46:22,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:22,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973737392] [2022-11-16 12:46:22,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:22,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:22,976 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:46:22,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [505826101] [2022-11-16 12:46:22,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:46:22,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:22,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:22,979 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:22,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:46:23,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:46:23,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:46:23,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 12:46:23,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:23,287 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-16 12:46:23,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:23,557 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-16 12:46:23,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:23,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973737392] [2022-11-16 12:46:23,558 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:46:23,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505826101] [2022-11-16 12:46:23,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505826101] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:23,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:46:23,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-11-16 12:46:23,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404795544] [2022-11-16 12:46:23,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:23,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 12:46:23,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:23,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 12:46:23,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:46:23,564 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-16 12:46:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:24,652 INFO L93 Difference]: Finished difference Result 249 states and 310 transitions. [2022-11-16 12:46:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:46:24,653 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-16 12:46:24,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:24,655 INFO L225 Difference]: With dead ends: 249 [2022-11-16 12:46:24,655 INFO L226 Difference]: Without dead ends: 225 [2022-11-16 12:46:24,656 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-16 12:46:24,657 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 36 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:24,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 147 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:46:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-16 12:46:24,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2022-11-16 12:46:24,717 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-16 12:46:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2022-11-16 12:46:24,719 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 43 [2022-11-16 12:46:24,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:24,719 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2022-11-16 12:46:24,720 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-16 12:46:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2022-11-16 12:46:24,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 12:46:24,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:24,723 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-16 12:46:24,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:24,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 12:46:24,929 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:24,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:24,930 INFO L85 PathProgramCache]: Analyzing trace with hash -715006568, now seen corresponding path program 1 times [2022-11-16 12:46:24,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:24,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519127658] [2022-11-16 12:46:24,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:24,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:24,939 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:46:24,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1215356044] [2022-11-16 12:46:24,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:24,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:24,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:24,945 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:24,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:46:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:25,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-16 12:46:25,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:25,294 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-16 12:46:25,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:25,649 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-16 12:46:25,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:25,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519127658] [2022-11-16 12:46:25,650 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:46:25,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215356044] [2022-11-16 12:46:25,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215356044] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:25,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:46:25,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2022-11-16 12:46:25,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416556136] [2022-11-16 12:46:25,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:25,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:46:25,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:25,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:46:25,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:46:25,652 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-16 12:46:26,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:26,372 INFO L93 Difference]: Finished difference Result 218 states and 252 transitions. [2022-11-16 12:46:26,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:46:26,373 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-16 12:46:26,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:26,378 INFO L225 Difference]: With dead ends: 218 [2022-11-16 12:46:26,378 INFO L226 Difference]: Without dead ends: 191 [2022-11-16 12:46:26,379 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-16 12:46:26,379 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.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:26,380 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.5s Time] [2022-11-16 12:46:26,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-16 12:46:26,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2022-11-16 12:46:26,424 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-16 12:46:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2022-11-16 12:46:26,425 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 57 [2022-11-16 12:46:26,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:26,425 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2022-11-16 12:46:26,426 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-16 12:46:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2022-11-16 12:46:26,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-16 12:46:26,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:26,429 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-16 12:46:26,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:26,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-16 12:46:26,640 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:26,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:26,641 INFO L85 PathProgramCache]: Analyzing trace with hash 985491918, now seen corresponding path program 2 times [2022-11-16 12:46:26,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:26,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563442800] [2022-11-16 12:46:26,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:26,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:26,659 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:46:26,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930372590] [2022-11-16 12:46:26,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:46:26,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:26,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:26,661 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:26,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:46:26,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:46:26,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:46:26,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:46:26,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:26,942 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-16 12:46:26,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:27,114 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-16 12:46:27,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:27,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563442800] [2022-11-16 12:46:27,114 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:46:27,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930372590] [2022-11-16 12:46:27,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930372590] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:27,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:46:27,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-16 12:46:27,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92120299] [2022-11-16 12:46:27,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:27,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:46:27,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:27,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:46:27,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:46:27,117 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-16 12:46:27,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:27,548 INFO L93 Difference]: Finished difference Result 512 states and 601 transitions. [2022-11-16 12:46:27,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:46:27,549 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-16 12:46:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:27,553 INFO L225 Difference]: With dead ends: 512 [2022-11-16 12:46:27,553 INFO L226 Difference]: Without dead ends: 503 [2022-11-16 12:46:27,554 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-16 12:46:27,554 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-16 12:46:27,555 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-16 12:46:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-11-16 12:46:27,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2022-11-16 12:46:27,669 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-16 12:46:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 568 transitions. [2022-11-16 12:46:27,674 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 568 transitions. Word has length 95 [2022-11-16 12:46:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:27,676 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 568 transitions. [2022-11-16 12:46:27,676 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-16 12:46:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 568 transitions. [2022-11-16 12:46:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-16 12:46:27,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:27,686 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-16 12:46:27,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:27,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:27,891 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:27,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:27,891 INFO L85 PathProgramCache]: Analyzing trace with hash 325062734, now seen corresponding path program 3 times [2022-11-16 12:46:27,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:27,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014439457] [2022-11-16 12:46:27,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:27,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:27,907 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:46:27,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1390683576] [2022-11-16 12:46:27,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:46:27,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:27,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:27,909 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:27,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 12:46:28,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2022-11-16 12:46:28,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:46:28,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 12:46:28,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:28,572 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-16 12:46:28,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:29,123 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-16 12:46:29,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:29,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014439457] [2022-11-16 12:46:29,123 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:46:29,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390683576] [2022-11-16 12:46:29,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390683576] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:29,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:46:29,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-16 12:46:29,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526376798] [2022-11-16 12:46:29,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:29,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 12:46:29,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:29,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 12:46:29,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-11-16 12:46:29,127 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-16 12:46:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:30,391 INFO L93 Difference]: Finished difference Result 1148 states and 1345 transitions. [2022-11-16 12:46:30,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-16 12:46:30,392 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-16 12:46:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:30,398 INFO L225 Difference]: With dead ends: 1148 [2022-11-16 12:46:30,398 INFO L226 Difference]: Without dead ends: 1139 [2022-11-16 12:46:30,400 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-16 12:46:30,401 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 322 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-16 12:46:30,401 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-16 12:46:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2022-11-16 12:46:30,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2022-11-16 12:46:30,639 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-16 12:46:30,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1288 transitions. [2022-11-16 12:46:30,645 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1288 transitions. Word has length 209 [2022-11-16 12:46:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:30,646 INFO L495 AbstractCegarLoop]: Abstraction has 1139 states and 1288 transitions. [2022-11-16 12:46:30,646 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-16 12:46:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1288 transitions. [2022-11-16 12:46:30,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-11-16 12:46:30,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:30,662 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-16 12:46:30,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:30,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 12:46:30,868 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:30,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash -767722162, now seen corresponding path program 4 times [2022-11-16 12:46:30,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:30,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866719315] [2022-11-16 12:46:30,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:30,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:30,897 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:46:30,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [682788871] [2022-11-16 12:46:30,897 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:46:30,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:30,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:30,899 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:30,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 12:46:31,170 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:46:31,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:46:31,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 12:46:31,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:32,250 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-16 12:46:32,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:33,569 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-16 12:46:33,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:33,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866719315] [2022-11-16 12:46:33,570 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:46:33,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682788871] [2022-11-16 12:46:33,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682788871] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:33,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:46:33,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-16 12:46:33,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218686834] [2022-11-16 12:46:33,571 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:33,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 12:46:33,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:33,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 12:46:33,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-11-16 12:46:33,575 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-16 12:46:36,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:36,432 INFO L93 Difference]: Finished difference Result 2420 states and 2833 transitions. [2022-11-16 12:46:36,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-16 12:46:36,433 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-16 12:46:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:36,444 INFO L225 Difference]: With dead ends: 2420 [2022-11-16 12:46:36,444 INFO L226 Difference]: Without dead ends: 2411 [2022-11-16 12:46:36,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 917 GetRequests, 824 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-11-16 12:46:36,449 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 614 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:36,450 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.0s Time] [2022-11-16 12:46:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2022-11-16 12:46:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2411. [2022-11-16 12:46:36,795 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-16 12:46:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2728 transitions. [2022-11-16 12:46:36,807 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2728 transitions. Word has length 437 [2022-11-16 12:46:36,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:36,808 INFO L495 AbstractCegarLoop]: Abstraction has 2411 states and 2728 transitions. [2022-11-16 12:46:36,808 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-16 12:46:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2728 transitions. [2022-11-16 12:46:36,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2022-11-16 12:46:36,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:36,843 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-16 12:46:36,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:37,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:37,050 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:37,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash -776415410, now seen corresponding path program 5 times [2022-11-16 12:46:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:37,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285136552] [2022-11-16 12:46:37,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:37,086 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:46:37,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754818974] [2022-11-16 12:46:37,087 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:46:37,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:37,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:37,088 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:37,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 12:52:58,298 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2022-11-16 12:52:58,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:52:58,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-16 12:52:58,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:53:01,096 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-16 12:53:01,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:53:03,463 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-16 12:53:03,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:03,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285136552] [2022-11-16 12:53:03,464 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:53:03,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754818974] [2022-11-16 12:53:03,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754818974] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:53:03,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:53:03,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-11-16 12:53:03,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339378635] [2022-11-16 12:53:03,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:53:03,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-16 12:53:03,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:03,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-16 12:53:03,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-11-16 12:53:03,470 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-16 12:53:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:06,878 INFO L93 Difference]: Finished difference Result 2632 states and 2993 transitions. [2022-11-16 12:53:06,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-16 12:53:06,879 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-16 12:53:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:06,893 INFO L225 Difference]: With dead ends: 2632 [2022-11-16 12:53:06,893 INFO L226 Difference]: Without dead ends: 2623 [2022-11-16 12:53:06,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1833 GetRequests, 1688 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-11-16 12:53:06,901 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 457 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:06,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 869 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-16 12:53:06,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2022-11-16 12:53:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2623. [2022-11-16 12:53:07,424 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-16 12:53:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 2968 transitions. [2022-11-16 12:53:07,437 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 2968 transitions. Word has length 893 [2022-11-16 12:53:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:07,440 INFO L495 AbstractCegarLoop]: Abstraction has 2623 states and 2968 transitions. [2022-11-16 12:53:07,441 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-16 12:53:07,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 2968 transitions. [2022-11-16 12:53:07,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2022-11-16 12:53:07,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:07,491 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-16 12:53:07,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 12:53:07,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 12:53:07,714 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:53:07,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:07,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1208919630, now seen corresponding path program 6 times [2022-11-16 12:53:07,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:07,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820064060] [2022-11-16 12:53:07,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:07,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:07,763 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:53:07,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1334475066] [2022-11-16 12:53:07,764 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 12:53:07,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:53:07,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:53:07,765 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:53:07,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 12:54:30,163 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 98 check-sat command(s) [2022-11-16 12:54:30,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 12:54:30,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:54:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:54:31,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:54:31,035 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:54:31,036 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 12:54:31,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 12:54:31,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 12:54:31,271 INFO L444 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:54:31,279 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:54:31,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:54:31 BoogieIcfgContainer [2022-11-16 12:54:31,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:54:31,577 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:54:31,577 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:54:31,578 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:54:31,578 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:46:16" (3/4) ... [2022-11-16 12:54:31,580 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 12:54:31,906 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:54:31,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:54:31,907 INFO L158 Benchmark]: Toolchain (without parser) took 496088.69ms. Allocated memory was 107.0MB in the beginning and 249.6MB in the end (delta: 142.6MB). Free memory was 74.2MB in the beginning and 194.6MB in the end (delta: -120.4MB). Peak memory consumption was 152.0MB. Max. memory is 16.1GB. [2022-11-16 12:54:31,908 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 107.0MB. Free memory was 57.9MB in the beginning and 57.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:54:31,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.92ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 82.1MB in the end (delta: -8.1MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-11-16 12:54:31,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.78ms. Allocated memory is still 107.0MB. Free memory was 82.1MB in the beginning and 80.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:54:31,911 INFO L158 Benchmark]: Boogie Preprocessor took 38.02ms. Allocated memory is still 107.0MB. Free memory was 80.2MB in the beginning and 79.2MB in the end (delta: 969.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:54:31,911 INFO L158 Benchmark]: RCFGBuilder took 452.81ms. Allocated memory is still 107.0MB. Free memory was 79.2MB in the beginning and 68.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:54:31,912 INFO L158 Benchmark]: TraceAbstraction took 494858.53ms. Allocated memory was 107.0MB in the beginning and 249.6MB in the end (delta: 142.6MB). Free memory was 67.6MB in the beginning and 94.7MB in the end (delta: -27.1MB). Peak memory consumption was 116.3MB. Max. memory is 16.1GB. [2022-11-16 12:54:31,912 INFO L158 Benchmark]: Witness Printer took 329.33ms. Allocated memory is still 249.6MB. Free memory was 94.7MB in the beginning and 194.6MB in the end (delta: -100.0MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2022-11-16 12:54:31,922 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.38ms. Allocated memory is still 107.0MB. Free memory was 57.9MB in the beginning and 57.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.92ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 82.1MB in the end (delta: -8.1MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.78ms. Allocated memory is still 107.0MB. Free memory was 82.1MB in the beginning and 80.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.02ms. Allocated memory is still 107.0MB. Free memory was 80.2MB in the beginning and 79.2MB in the end (delta: 969.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 452.81ms. Allocated memory is still 107.0MB. Free memory was 79.2MB in the beginning and 68.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 494858.53ms. Allocated memory was 107.0MB in the beginning and 249.6MB in the end (delta: 142.6MB). Free memory was 67.6MB in the beginning and 94.7MB in the end (delta: -27.1MB). Peak memory consumption was 116.3MB. Max. memory is 16.1GB. * Witness Printer took 329.33ms. Allocated memory is still 249.6MB. Free memory was 94.7MB in the beginning and 194.6MB in the end (delta: -100.0MB). Peak memory consumption was 30.1MB. 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: 494.5s, OverallIterations: 16, TraceHistogramMax: 151, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1796 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1756 mSDsluCounter, 3725 SdHoareTripleChecker+Invalid, 4.5s 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.4s SsaConstructionTime, 463.9s SatisfiabilityAnalysisTime, 12.0s 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-16 12:54:31,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0aa753b-27fa-41c1-aa83-b2d6173a95b0/bin/uautomizer-tPACEb0tL8/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