./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound50.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 63cd3e528fa28694be9f2ecbe948122395c3f48db5408253e949dc50f2a74038 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:32:31,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:32:31,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:32:31,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:32:31,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:32:31,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:32:31,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:32:31,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:32:31,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:32:31,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:32:31,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:32:31,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:32:31,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:32:31,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:32:31,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:32:31,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:32:31,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:32:31,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:32:31,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:32:31,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:32:31,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:32:31,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:32:31,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:32:31,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:32:31,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:32:31,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:32:31,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:32:31,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:32:31,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:32:31,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:32:31,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:32:31,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:32:31,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:32:31,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:32:31,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:32:31,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:32:31,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:32:31,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:32:31,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:32:31,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:32:31,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:32:31,166 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:32:31,188 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:32:31,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:32:31,188 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:32:31,188 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:32:31,189 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:32:31,189 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:32:31,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:32:31,190 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:32:31,190 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:32:31,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:32:31,190 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:32:31,191 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:32:31,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:32:31,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:32:31,191 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:32:31,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:32:31,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:32:31,191 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:32:31,192 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:32:31,192 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:32:31,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:32:31,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:32:31,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:32:31,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:32:31,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:32:31,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:32:31,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:32:31,194 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:32:31,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:32:31,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:32:31,194 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:32:31,194 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:32:31,195 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:32:31,195 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 63cd3e528fa28694be9f2ecbe948122395c3f48db5408253e949dc50f2a74038 [2022-02-20 17:32:31,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:32:31,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:32:31,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:32:31,393 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:32:31,394 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:32:31,395 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound50.c [2022-02-20 17:32:31,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6384f841/0ab5cc1f1602436fa8921ca778d8767e/FLAGad86fe93a [2022-02-20 17:32:31,805 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:32:31,805 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound50.c [2022-02-20 17:32:31,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6384f841/0ab5cc1f1602436fa8921ca778d8767e/FLAGad86fe93a [2022-02-20 17:32:32,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6384f841/0ab5cc1f1602436fa8921ca778d8767e [2022-02-20 17:32:32,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:32:32,266 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:32:32,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:32:32,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:32:32,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:32:32,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:32:32" (1/1) ... [2022-02-20 17:32:32,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@624e044f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:32, skipping insertion in model container [2022-02-20 17:32:32,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:32:32" (1/1) ... [2022-02-20 17:32:32,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:32:32,290 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:32:32,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound50.c[526,539] [2022-02-20 17:32:32,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:32:32,424 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:32:32,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound50.c[526,539] [2022-02-20 17:32:32,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:32:32,460 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:32:32,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:32 WrapperNode [2022-02-20 17:32:32,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:32:32,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:32:32,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:32:32,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:32:32,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:32" (1/1) ... [2022-02-20 17:32:32,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:32" (1/1) ... [2022-02-20 17:32:32,500 INFO L137 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2022-02-20 17:32:32,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:32:32,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:32:32,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:32:32,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:32:32,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:32" (1/1) ... [2022-02-20 17:32:32,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:32" (1/1) ... [2022-02-20 17:32:32,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:32" (1/1) ... [2022-02-20 17:32:32,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:32" (1/1) ... [2022-02-20 17:32:32,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:32" (1/1) ... [2022-02-20 17:32:32,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:32" (1/1) ... [2022-02-20 17:32:32,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:32" (1/1) ... [2022-02-20 17:32:32,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:32:32,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:32:32,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:32:32,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:32:32,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:32" (1/1) ... [2022-02-20 17:32:32,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:32:32,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:32,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:32:32,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:32:32,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:32:32,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:32:32,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:32:32,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:32:32,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:32:32,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:32:32,634 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:32:32,635 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:32:32,731 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:32:32,735 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:32:32,735 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:32:32,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:32:32 BoogieIcfgContainer [2022-02-20 17:32:32,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:32:32,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:32:32,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:32:32,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:32:32,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:32:32" (1/3) ... [2022-02-20 17:32:32,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402865ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:32:32, skipping insertion in model container [2022-02-20 17:32:32,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:32" (2/3) ... [2022-02-20 17:32:32,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402865ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:32:32, skipping insertion in model container [2022-02-20 17:32:32,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:32:32" (3/3) ... [2022-02-20 17:32:32,742 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_valuebound50.c [2022-02-20 17:32:32,745 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:32:32,745 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:32:32,772 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:32:32,777 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:32:32,777 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:32:32,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:32:32,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:32:32,792 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:32,793 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:32,793 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:32,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash -586848446, now seen corresponding path program 1 times [2022-02-20 17:32:32,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:32,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437786722] [2022-02-20 17:32:32,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:32,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:32,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {29#true} is VALID [2022-02-20 17:32:32,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {29#true} is VALID [2022-02-20 17:32:32,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {30#false} is VALID [2022-02-20 17:32:32,935 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#false} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {30#false} is VALID [2022-02-20 17:32:32,935 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:32:32,935 INFO L272 TraceCheckUtils]: 5: Hoare triple {30#false} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {30#false} is VALID [2022-02-20 17:32:32,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-02-20 17:32:32,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-02-20 17:32:32,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:32:32,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:32:32,937 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:32,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437786722] [2022-02-20 17:32:32,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437786722] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:32,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:32,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:32:32,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789846383] [2022-02-20 17:32:32,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:32,958 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:32:32,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:32,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:32,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:32,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:32:32,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:33,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:32:33,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:32:33,007 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:33,076 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. [2022-02-20 17:32:33,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:32:33,076 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:32:33,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2022-02-20 17:32:33,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2022-02-20 17:32:33,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 83 transitions. [2022-02-20 17:32:33,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:33,200 INFO L225 Difference]: With dead ends: 49 [2022-02-20 17:32:33,200 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:32:33,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:32:33,206 INFO L933 BasicCegarLoop]: 34 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, 34 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-02-20 17:32:33,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:32:33,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:32:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:32:33,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:33,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:33,232 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:33,232 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:33,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:33,236 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-02-20 17:32:33,236 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-20 17:32:33,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:33,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:33,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-02-20 17:32:33,238 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-02-20 17:32:33,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:33,242 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-02-20 17:32:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-20 17:32:33,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:33,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:33,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:33,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:33,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-02-20 17:32:33,249 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 9 [2022-02-20 17:32:33,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:33,249 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-02-20 17:32:33,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-20 17:32:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:32:33,250 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:33,250 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:33,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:32:33,251 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:33,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:33,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1188158916, now seen corresponding path program 1 times [2022-02-20 17:32:33,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:33,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530816344] [2022-02-20 17:32:33,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:33,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:33,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {177#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {177#true} is VALID [2022-02-20 17:32:33,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {177#true} is VALID [2022-02-20 17:32:33,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#true} assume !(0 == assume_abort_if_not_~cond#1); {177#true} is VALID [2022-02-20 17:32:33,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {177#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {179#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:32:33,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {179#(= |ULTIMATE.start_main_~q~0#1| 0)} assume !false; {179#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:32:33,303 INFO L272 TraceCheckUtils]: 5: Hoare triple {179#(= |ULTIMATE.start_main_~q~0#1| 0)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:32:33,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {181#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:32:33,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {181#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {178#false} is VALID [2022-02-20 17:32:33,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#false} assume !false; {178#false} is VALID [2022-02-20 17:32:33,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:32:33,305 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:33,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530816344] [2022-02-20 17:32:33,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530816344] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:33,305 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:33,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:32:33,306 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320414301] [2022-02-20 17:32:33,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:33,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:32:33,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:33,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:33,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:33,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:33,314 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:33,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:33,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:32:33,315 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:33,437 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-02-20 17:32:33,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:32:33,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:32:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:33,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 17:32:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 17:32:33,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-02-20 17:32:33,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:33,477 INFO L225 Difference]: With dead ends: 35 [2022-02-20 17:32:33,477 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 17:32:33,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-20 17:32:33,479 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:32:33,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 98 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:32:33,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 17:32:33,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2022-02-20 17:32:33,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:33,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:33,483 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:33,483 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:33,485 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-02-20 17:32:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-02-20 17:32:33,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:33,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:33,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-02-20 17:32:33,486 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-02-20 17:32:33,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:33,488 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-02-20 17:32:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-02-20 17:32:33,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:33,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:33,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:33,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-02-20 17:32:33,491 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2022-02-20 17:32:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:33,491 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-02-20 17:32:33,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:32:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-02-20 17:32:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 17:32:33,492 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:33,492 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:33,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:32:33,492 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:33,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:33,493 INFO L85 PathProgramCache]: Analyzing trace with hash -697944935, now seen corresponding path program 1 times [2022-02-20 17:32:33,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:33,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991858597] [2022-02-20 17:32:33,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:33,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:33,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-20 17:32:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:33,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} ~cond := #in~cond; {337#true} is VALID [2022-02-20 17:32:33,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume !(0 == ~cond); {337#true} is VALID [2022-02-20 17:32:33,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 17:32:33,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {337#true} {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} #72#return; {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:32:33,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {337#true} is VALID [2022-02-20 17:32:33,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {337#true} is VALID [2022-02-20 17:32:33,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} assume !(0 == assume_abort_if_not_~cond#1); {337#true} is VALID [2022-02-20 17:32:33,548 INFO L290 TraceCheckUtils]: 3: Hoare triple {337#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:32:33,548 INFO L290 TraceCheckUtils]: 4: Hoare triple {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} assume !false; {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:32:33,548 INFO L272 TraceCheckUtils]: 5: Hoare triple {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {337#true} is VALID [2022-02-20 17:32:33,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {337#true} ~cond := #in~cond; {337#true} is VALID [2022-02-20 17:32:33,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#true} assume !(0 == ~cond); {337#true} is VALID [2022-02-20 17:32:33,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 17:32:33,550 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {337#true} {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} #72#return; {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:32:33,550 INFO L272 TraceCheckUtils]: 10: Hoare triple {339#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:32:33,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {344#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {345#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:32:33,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {345#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {338#false} is VALID [2022-02-20 17:32:33,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {338#false} assume !false; {338#false} is VALID [2022-02-20 17:32:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:32:33,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:33,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991858597] [2022-02-20 17:32:33,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991858597] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:33,552 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:33,552 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:32:33,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337103751] [2022-02-20 17:32:33,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:33,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 17:32:33,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:33,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:32:33,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:33,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:33,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:33,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:33,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:32:33,564 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:32:33,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:33,671 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-02-20 17:32:33,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:32:33,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 17:32:33,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:32:33,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 17:32:33,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:32:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 17:32:33,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-02-20 17:32:33,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:33,710 INFO L225 Difference]: With dead ends: 39 [2022-02-20 17:32:33,710 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 17:32:33,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-02-20 17:32:33,711 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:32:33,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:32:33,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 17:32:33,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-02-20 17:32:33,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:33,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:33,715 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:33,716 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:33,717 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-02-20 17:32:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-02-20 17:32:33,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:33,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:33,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-02-20 17:32:33,719 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-02-20 17:32:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:33,720 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-02-20 17:32:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-02-20 17:32:33,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:33,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:33,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:33,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:32:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 17:32:33,722 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2022-02-20 17:32:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:33,723 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 17:32:33,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:32:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 17:32:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:32:33,723 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:33,724 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:33,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:32:33,724 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:33,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:33,724 INFO L85 PathProgramCache]: Analyzing trace with hash 262992548, now seen corresponding path program 1 times [2022-02-20 17:32:33,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:33,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461103052] [2022-02-20 17:32:33,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:33,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:33,735 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:33,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254058653] [2022-02-20 17:32:33,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:33,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:33,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:33,737 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:32:33,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:32:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:33,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:32:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:33,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:32:33,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {519#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {519#true} is VALID [2022-02-20 17:32:33,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {519#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {519#true} is VALID [2022-02-20 17:32:33,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {519#true} assume !(0 == assume_abort_if_not_~cond#1); {519#true} is VALID [2022-02-20 17:32:33,895 INFO L290 TraceCheckUtils]: 3: Hoare triple {519#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,895 INFO L290 TraceCheckUtils]: 4: Hoare triple {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,895 INFO L272 TraceCheckUtils]: 5: Hoare triple {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {519#true} is VALID [2022-02-20 17:32:33,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {519#true} ~cond := #in~cond; {519#true} is VALID [2022-02-20 17:32:33,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {519#true} assume !(0 == ~cond); {519#true} is VALID [2022-02-20 17:32:33,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 17:32:33,897 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {519#true} {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,897 INFO L272 TraceCheckUtils]: 10: Hoare triple {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {519#true} is VALID [2022-02-20 17:32:33,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {519#true} ~cond := #in~cond; {519#true} is VALID [2022-02-20 17:32:33,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {519#true} assume !(0 == ~cond); {519#true} is VALID [2022-02-20 17:32:33,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 17:32:33,900 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {519#true} {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:33,901 INFO L272 TraceCheckUtils]: 15: Hoare triple {533#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:32:33,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:32:33,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {520#false} is VALID [2022-02-20 17:32:33,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {520#false} assume !false; {520#false} is VALID [2022-02-20 17:32:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:32:33,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:32:33,903 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:33,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461103052] [2022-02-20 17:32:33,903 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:32:33,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254058653] [2022-02-20 17:32:33,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254058653] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:33,904 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:33,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:32:33,904 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120253877] [2022-02-20 17:32:33,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:33,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 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-02-20 17:32:33,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:33,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 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-02-20 17:32:33,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:33,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:33,918 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:33,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:33,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:32:33,919 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 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-02-20 17:32:34,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:34,039 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-02-20 17:32:34,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:32:34,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 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-02-20 17:32:34,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 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-02-20 17:32:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 17:32:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 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-02-20 17:32:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 17:32:34,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-02-20 17:32:34,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:34,092 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:32:34,092 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:32:34,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:32:34,094 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:32:34,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 106 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:32:34,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:32:34,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 17:32:34,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:34,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:32:34,099 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:32:34,100 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:32:34,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:34,101 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-02-20 17:32:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-02-20 17:32:34,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:34,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:34,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 44 states. [2022-02-20 17:32:34,103 INFO L87 Difference]: Start difference. First operand has 44 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 44 states. [2022-02-20 17:32:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:34,104 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-02-20 17:32:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-02-20 17:32:34,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:34,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:34,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:34,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:32:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2022-02-20 17:32:34,107 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 19 [2022-02-20 17:32:34,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:34,107 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2022-02-20 17:32:34,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 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-02-20 17:32:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-02-20 17:32:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:32:34,108 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:34,108 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:34,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:32:34,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:34,324 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:34,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1807142342, now seen corresponding path program 1 times [2022-02-20 17:32:34,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:34,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622410567] [2022-02-20 17:32:34,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:34,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:34,340 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:34,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [969086956] [2022-02-20 17:32:34,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:34,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:34,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:34,344 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:32:34,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:32:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:34,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:32:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:34,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:32:34,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {816#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {816#true} is VALID [2022-02-20 17:32:34,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {816#true} is VALID [2022-02-20 17:32:34,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#true} assume !(0 == assume_abort_if_not_~cond#1); {816#true} is VALID [2022-02-20 17:32:34,500 INFO L290 TraceCheckUtils]: 3: Hoare triple {816#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:34,501 INFO L290 TraceCheckUtils]: 4: Hoare triple {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:34,501 INFO L272 TraceCheckUtils]: 5: Hoare triple {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {816#true} is VALID [2022-02-20 17:32:34,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {816#true} ~cond := #in~cond; {816#true} is VALID [2022-02-20 17:32:34,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {816#true} assume !(0 == ~cond); {816#true} is VALID [2022-02-20 17:32:34,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {816#true} assume true; {816#true} is VALID [2022-02-20 17:32:34,502 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {816#true} {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #72#return; {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:34,502 INFO L272 TraceCheckUtils]: 10: Hoare triple {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {816#true} is VALID [2022-02-20 17:32:34,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {816#true} ~cond := #in~cond; {816#true} is VALID [2022-02-20 17:32:34,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {816#true} assume !(0 == ~cond); {816#true} is VALID [2022-02-20 17:32:34,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#true} assume true; {816#true} is VALID [2022-02-20 17:32:34,503 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {816#true} {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #74#return; {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:34,503 INFO L272 TraceCheckUtils]: 15: Hoare triple {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {816#true} is VALID [2022-02-20 17:32:34,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {816#true} ~cond := #in~cond; {816#true} is VALID [2022-02-20 17:32:34,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {816#true} assume !(0 == ~cond); {816#true} is VALID [2022-02-20 17:32:34,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {816#true} assume true; {816#true} is VALID [2022-02-20 17:32:34,505 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {816#true} {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #76#return; {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:34,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_~r~0#1 >= main_~d~0#1); {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:34,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:34,506 INFO L272 TraceCheckUtils]: 22: Hoare triple {830#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {888#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:32:34,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {888#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {892#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:32:34,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {892#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {817#false} is VALID [2022-02-20 17:32:34,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {817#false} assume !false; {817#false} is VALID [2022-02-20 17:32:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:32:34,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:32:34,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:34,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622410567] [2022-02-20 17:32:34,508 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:32:34,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969086956] [2022-02-20 17:32:34,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969086956] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:34,508 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:34,508 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:32:34,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444780159] [2022-02-20 17:32:34,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:34,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:32:34,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:34,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:34,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:34,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:34,524 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:34,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:34,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:32:34,524 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:34,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:34,667 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-02-20 17:32:34,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:32:34,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:32:34,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 17:32:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 17:32:34,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-02-20 17:32:34,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:34,702 INFO L225 Difference]: With dead ends: 57 [2022-02-20 17:32:34,702 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 17:32:34,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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-02-20 17:32:34,703 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:32:34,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:32:34,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 17:32:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-02-20 17:32:34,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:34,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:32:34,712 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:32:34,712 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:32:34,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:34,714 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-02-20 17:32:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-20 17:32:34,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:34,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:34,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-02-20 17:32:34,715 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-02-20 17:32:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:34,717 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-02-20 17:32:34,717 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-20 17:32:34,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:34,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:34,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:34,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:32:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-02-20 17:32:34,719 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 26 [2022-02-20 17:32:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:34,719 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-02-20 17:32:34,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:34,720 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-02-20 17:32:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:32:34,720 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:34,720 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:34,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:32:34,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:34,926 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:34,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:34,926 INFO L85 PathProgramCache]: Analyzing trace with hash -979933353, now seen corresponding path program 1 times [2022-02-20 17:32:34,926 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:34,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720305926] [2022-02-20 17:32:34,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:34,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:34,948 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:34,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1353222316] [2022-02-20 17:32:34,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:34,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:34,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:34,966 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:32:34,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:32:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:34,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 17:32:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:35,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:32:35,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {1150#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1150#true} is VALID [2022-02-20 17:32:35,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {1150#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1150#true} is VALID [2022-02-20 17:32:35,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {1150#true} assume !(0 == assume_abort_if_not_~cond#1); {1150#true} is VALID [2022-02-20 17:32:35,192 INFO L290 TraceCheckUtils]: 3: Hoare triple {1150#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:35,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:35,192 INFO L272 TraceCheckUtils]: 5: Hoare triple {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:35,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:35,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:35,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:35,193 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1150#true} {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:35,193 INFO L272 TraceCheckUtils]: 10: Hoare triple {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:35,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:35,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:35,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:35,195 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1150#true} {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:35,195 INFO L272 TraceCheckUtils]: 15: Hoare triple {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:35,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:35,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:35,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:35,196 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1150#true} {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:35,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {1164#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:35,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:35,197 INFO L272 TraceCheckUtils]: 22: Hoare triple {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:35,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:35,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:35,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:35,199 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1150#true} {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:35,199 INFO L272 TraceCheckUtils]: 27: Hoare triple {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:35,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:35,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:35,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:35,200 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1150#true} {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:35,201 INFO L272 TraceCheckUtils]: 32: Hoare triple {1216#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1253#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:32:35,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {1253#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1257#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:32:35,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {1257#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1151#false} is VALID [2022-02-20 17:32:35,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {1151#false} assume !false; {1151#false} is VALID [2022-02-20 17:32:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:32:35,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:32:35,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {1151#false} assume !false; {1151#false} is VALID [2022-02-20 17:32:35,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {1257#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1151#false} is VALID [2022-02-20 17:32:35,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {1253#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1257#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:32:35,382 INFO L272 TraceCheckUtils]: 32: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1253#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:32:35,382 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1150#true} {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} #74#return; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:35,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:35,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:35,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:35,383 INFO L272 TraceCheckUtils]: 27: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:35,391 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1150#true} {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} #72#return; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:35,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:35,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:35,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:35,392 INFO L272 TraceCheckUtils]: 22: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:35,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} assume !false; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:35,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:35,394 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1150#true} {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} #76#return; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:35,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:35,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:35,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:35,394 INFO L272 TraceCheckUtils]: 15: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:35,395 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1150#true} {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} #74#return; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:35,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:35,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:35,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:35,395 INFO L272 TraceCheckUtils]: 10: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:35,396 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1150#true} {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} #72#return; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:35,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:35,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:35,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:35,396 INFO L272 TraceCheckUtils]: 5: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1150#true} is VALID [2022-02-20 17:32:35,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} assume !false; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:35,397 INFO L290 TraceCheckUtils]: 3: Hoare triple {1150#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1273#(= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:32:35,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {1150#true} assume !(0 == assume_abort_if_not_~cond#1); {1150#true} is VALID [2022-02-20 17:32:35,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {1150#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1150#true} is VALID [2022-02-20 17:32:35,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {1150#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1150#true} is VALID [2022-02-20 17:32:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-02-20 17:32:35,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:35,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720305926] [2022-02-20 17:32:35,398 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:32:35,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353222316] [2022-02-20 17:32:35,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353222316] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:32:35,398 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:32:35,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:32:35,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890080245] [2022-02-20 17:32:35,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:35,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-02-20 17:32:35,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:35,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:35,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:35,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:35,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:35,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:35,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:32:35,423 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:38,700 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:32:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:41,230 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-02-20 17:32:41,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:32:41,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-02-20 17:32:41,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 17:32:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 17:32:41,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-02-20 17:32:41,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:41,269 INFO L225 Difference]: With dead ends: 61 [2022-02-20 17:32:41,269 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 17:32:41,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:32:41,270 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:32:41,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 90 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 17:32:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 17:32:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-02-20 17:32:41,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:41,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:32:41,287 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:32:41,287 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:32:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:41,289 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-02-20 17:32:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-02-20 17:32:41,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:41,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:41,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-02-20 17:32:41,290 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-02-20 17:32:41,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:41,291 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-02-20 17:32:41,291 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-02-20 17:32:41,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:41,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:41,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:41,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:32:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2022-02-20 17:32:41,309 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 36 [2022-02-20 17:32:41,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:41,310 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2022-02-20 17:32:41,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:32:41,310 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-02-20 17:32:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 17:32:41,311 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:41,311 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:41,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 17:32:41,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:41,512 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:41,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:41,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1034157389, now seen corresponding path program 1 times [2022-02-20 17:32:41,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:41,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043123159] [2022-02-20 17:32:41,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:41,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:41,524 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:41,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838314773] [2022-02-20 17:32:41,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:41,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:41,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:41,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:32:41,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:32:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:41,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 17:32:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:41,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:32:42,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {1654#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1654#true} is VALID [2022-02-20 17:32:42,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {1654#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1654#true} is VALID [2022-02-20 17:32:42,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {1654#true} assume !(0 == assume_abort_if_not_~cond#1); {1654#true} is VALID [2022-02-20 17:32:42,036 INFO L290 TraceCheckUtils]: 3: Hoare triple {1654#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,037 INFO L290 TraceCheckUtils]: 4: Hoare triple {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,037 INFO L272 TraceCheckUtils]: 5: Hoare triple {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:42,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:42,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:42,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:42,038 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1654#true} {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,038 INFO L272 TraceCheckUtils]: 10: Hoare triple {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:42,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:42,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:42,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:42,039 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1654#true} {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,040 INFO L272 TraceCheckUtils]: 15: Hoare triple {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:42,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:42,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:42,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:42,041 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1654#true} {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,042 INFO L272 TraceCheckUtils]: 22: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:42,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:42,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:42,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:42,043 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1654#true} {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,043 INFO L272 TraceCheckUtils]: 27: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:42,043 INFO L290 TraceCheckUtils]: 28: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:42,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:42,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:42,044 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1654#true} {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,044 INFO L272 TraceCheckUtils]: 32: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:42,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:42,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:42,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:42,045 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1654#true} {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !(main_~r~0#1 >= main_~d~0#1); {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,046 INFO L290 TraceCheckUtils]: 38: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,046 INFO L272 TraceCheckUtils]: 39: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:42,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:42,047 INFO L290 TraceCheckUtils]: 41: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:42,047 INFO L290 TraceCheckUtils]: 42: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:42,047 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1654#true} {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #78#return; {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,048 INFO L272 TraceCheckUtils]: 44: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:42,048 INFO L290 TraceCheckUtils]: 45: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:42,048 INFO L290 TraceCheckUtils]: 46: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:42,048 INFO L290 TraceCheckUtils]: 47: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:42,049 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1654#true} {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #80#return; {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {1720#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,050 INFO L290 TraceCheckUtils]: 50: Hoare triple {1668#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume main_~r~0#1 >= main_~d~0#1;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {1811#(and (= |ULTIMATE.start_main_~q~0#1| 1) (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,051 INFO L290 TraceCheckUtils]: 51: Hoare triple {1811#(and (= |ULTIMATE.start_main_~q~0#1| 1) (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {1811#(and (= |ULTIMATE.start_main_~q~0#1| 1) (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:42,051 INFO L272 TraceCheckUtils]: 52: Hoare triple {1811#(and (= |ULTIMATE.start_main_~q~0#1| 1) (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {1818#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:32:42,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {1818#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1822#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:32:42,052 INFO L290 TraceCheckUtils]: 54: Hoare triple {1822#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1655#false} is VALID [2022-02-20 17:32:42,052 INFO L290 TraceCheckUtils]: 55: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-02-20 17:32:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 17:32:42,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:32:47,119 INFO L290 TraceCheckUtils]: 55: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-02-20 17:32:47,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {1822#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1655#false} is VALID [2022-02-20 17:32:47,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {1818#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1822#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:32:47,121 INFO L272 TraceCheckUtils]: 52: Hoare triple {1838#(= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {1818#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:32:47,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {1838#(= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))} assume !false; {1838#(= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:47,131 INFO L290 TraceCheckUtils]: 50: Hoare triple {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} assume main_~r~0#1 >= main_~d~0#1;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {1838#(= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:32:47,143 INFO L290 TraceCheckUtils]: 49: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:32:47,143 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1654#true} {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} #80#return; {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:47,143 INFO L290 TraceCheckUtils]: 47: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:47,144 INFO L290 TraceCheckUtils]: 46: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:47,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:47,144 INFO L272 TraceCheckUtils]: 44: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:47,144 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1654#true} {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} #78#return; {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:47,145 INFO L290 TraceCheckUtils]: 42: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:47,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:47,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:47,145 INFO L272 TraceCheckUtils]: 39: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:47,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} assume !false; {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:47,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} assume !(main_~r~0#1 >= main_~d~0#1); {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:47,148 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1654#true} {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} #76#return; {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:47,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:47,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:47,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:47,148 INFO L272 TraceCheckUtils]: 32: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:47,149 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1654#true} {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} #74#return; {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:47,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:47,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:47,149 INFO L290 TraceCheckUtils]: 28: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:47,149 INFO L272 TraceCheckUtils]: 27: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:47,152 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1654#true} {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} #72#return; {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:47,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:47,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:47,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:47,152 INFO L272 TraceCheckUtils]: 22: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:47,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} assume !false; {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:47,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {1849#(and (or (and (< |ULTIMATE.start_main_~p~0#1| 0) (not (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0))) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0)) (= (+ (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2))) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)))) (or (= (mod |ULTIMATE.start_main_~p~0#1| 2) 0) (not (< |ULTIMATE.start_main_~p~0#1| 0)) (and (or (not (< |ULTIMATE.start_main_~d~0#1| 0)) (= |ULTIMATE.start_main_~A~0#1| (+ (- 1) (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (or (= (+ (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~q~0#1| (div |ULTIMATE.start_main_~p~0#1| 2) 1)) (* (- 1) (div |ULTIMATE.start_main_~d~0#1| 2)) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (and (not (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0)) (< |ULTIMATE.start_main_~d~0#1| 0))))))} is VALID [2022-02-20 17:32:47,161 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1654#true} {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} #76#return; {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:32:47,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:47,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:47,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:47,161 INFO L272 TraceCheckUtils]: 15: Hoare triple {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:47,163 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1654#true} {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} #74#return; {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:32:47,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:47,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:47,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:47,164 INFO L272 TraceCheckUtils]: 10: Hoare triple {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:47,167 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1654#true} {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} #72#return; {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:32:47,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:47,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:47,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:47,167 INFO L272 TraceCheckUtils]: 5: Hoare triple {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1654#true} is VALID [2022-02-20 17:32:47,168 INFO L290 TraceCheckUtils]: 4: Hoare triple {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} assume !false; {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:32:47,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {1654#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1845#(= (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~B~0#1| (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|)) (* (- 1) |ULTIMATE.start_main_~d~0#1|)) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:32:47,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {1654#true} assume !(0 == assume_abort_if_not_~cond#1); {1654#true} is VALID [2022-02-20 17:32:47,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {1654#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1654#true} is VALID [2022-02-20 17:32:47,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {1654#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1654#true} is VALID [2022-02-20 17:32:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 17:32:47,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:47,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043123159] [2022-02-20 17:32:47,169 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:32:47,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838314773] [2022-02-20 17:32:47,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838314773] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:32:47,169 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:32:47,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-02-20 17:32:47,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941774467] [2022-02-20 17:32:47,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:32:47,170 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 56 [2022-02-20 17:32:47,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:47,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:32:47,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:47,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:32:47,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:47,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:32:47,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:32:47,258 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:32:53,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:32:55,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:32:57,061 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:32:59,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:33:03,619 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:33:05,299 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:33:10,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:10,957 INFO L93 Difference]: Finished difference Result 146 states and 202 transitions. [2022-02-20 17:33:10,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:33:10,958 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 56 [2022-02-20 17:33:10,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:33:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-02-20 17:33:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:33:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-02-20 17:33:10,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 133 transitions. [2022-02-20 17:33:11,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:11,199 INFO L225 Difference]: With dead ends: 146 [2022-02-20 17:33:11,199 INFO L226 Difference]: Without dead ends: 117 [2022-02-20 17:33:11,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:33:11,200 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 36 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 72 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:33:11,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 210 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 220 Invalid, 5 Unknown, 0 Unchecked, 13.3s Time] [2022-02-20 17:33:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-20 17:33:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2022-02-20 17:33:11,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:11,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 105 states, 64 states have (on average 1.234375) internal successors, (79), 68 states have internal predecessors, (79), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 17:33:11,228 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 105 states, 64 states have (on average 1.234375) internal successors, (79), 68 states have internal predecessors, (79), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 17:33:11,228 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 105 states, 64 states have (on average 1.234375) internal successors, (79), 68 states have internal predecessors, (79), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 17:33:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:11,232 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2022-02-20 17:33:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2022-02-20 17:33:11,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:11,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:11,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 64 states have (on average 1.234375) internal successors, (79), 68 states have internal predecessors, (79), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) Second operand 117 states. [2022-02-20 17:33:11,234 INFO L87 Difference]: Start difference. First operand has 105 states, 64 states have (on average 1.234375) internal successors, (79), 68 states have internal predecessors, (79), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) Second operand 117 states. [2022-02-20 17:33:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:11,237 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2022-02-20 17:33:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2022-02-20 17:33:11,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:11,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:11,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:11,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 64 states have (on average 1.234375) internal successors, (79), 68 states have internal predecessors, (79), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 17:33:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2022-02-20 17:33:11,241 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 56 [2022-02-20 17:33:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:11,241 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2022-02-20 17:33:11,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 6 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-02-20 17:33:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2022-02-20 17:33:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 17:33:11,243 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:11,243 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:33:11,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 17:33:11,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:11,443 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:11,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:11,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1199454569, now seen corresponding path program 1 times [2022-02-20 17:33:11,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:33:11,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522495151] [2022-02-20 17:33:11,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:11,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:33:11,453 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:33:11,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1245208243] [2022-02-20 17:33:11,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:11,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:11,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:11,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:33:11,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:33:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:11,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-20 17:33:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:11,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:12,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {2598#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {2598#true} is VALID [2022-02-20 17:33:12,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {2598#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2598#true} is VALID [2022-02-20 17:33:12,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {2598#true} assume !(0 == assume_abort_if_not_~cond#1); {2598#true} is VALID [2022-02-20 17:33:12,138 INFO L290 TraceCheckUtils]: 3: Hoare triple {2598#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,139 INFO L290 TraceCheckUtils]: 4: Hoare triple {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,139 INFO L272 TraceCheckUtils]: 5: Hoare triple {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:12,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:12,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:12,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:12,140 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2598#true} {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,140 INFO L272 TraceCheckUtils]: 10: Hoare triple {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:12,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:12,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:12,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:12,141 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2598#true} {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,141 INFO L272 TraceCheckUtils]: 15: Hoare triple {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:12,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:12,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:12,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:12,142 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2598#true} {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,143 INFO L272 TraceCheckUtils]: 22: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:12,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:12,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:12,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:12,144 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2598#true} {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,144 INFO L272 TraceCheckUtils]: 27: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:12,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:12,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:12,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:12,145 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2598#true} {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,145 INFO L272 TraceCheckUtils]: 32: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:12,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:12,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:12,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:12,146 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2598#true} {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !(main_~r~0#1 >= main_~d~0#1); {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,147 INFO L290 TraceCheckUtils]: 38: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,147 INFO L272 TraceCheckUtils]: 39: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:12,147 INFO L290 TraceCheckUtils]: 40: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:12,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:12,147 INFO L290 TraceCheckUtils]: 42: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:12,148 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2598#true} {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #78#return; {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,148 INFO L272 TraceCheckUtils]: 44: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:12,148 INFO L290 TraceCheckUtils]: 45: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:12,148 INFO L290 TraceCheckUtils]: 46: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:12,148 INFO L290 TraceCheckUtils]: 47: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:12,149 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2598#true} {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #80#return; {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,150 INFO L290 TraceCheckUtils]: 49: Hoare triple {2664#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,150 INFO L290 TraceCheckUtils]: 50: Hoare triple {2612#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= 0 |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume main_~r~0#1 >= main_~d~0#1;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {2755#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,151 INFO L290 TraceCheckUtils]: 51: Hoare triple {2755#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {2755#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,151 INFO L272 TraceCheckUtils]: 52: Hoare triple {2755#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:12,151 INFO L290 TraceCheckUtils]: 53: Hoare triple {2598#true} ~cond := #in~cond; {2765#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:33:12,152 INFO L290 TraceCheckUtils]: 54: Hoare triple {2765#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:33:12,152 INFO L290 TraceCheckUtils]: 55: Hoare triple {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:33:12,153 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} {2755#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1|) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #78#return; {2776#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:12,153 INFO L272 TraceCheckUtils]: 57: Hoare triple {2776#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:12,153 INFO L290 TraceCheckUtils]: 58: Hoare triple {2598#true} ~cond := #in~cond; {2765#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:33:12,154 INFO L290 TraceCheckUtils]: 59: Hoare triple {2765#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:33:12,154 INFO L290 TraceCheckUtils]: 60: Hoare triple {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:33:12,155 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} {2776#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~A~0#1| (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #80#return; {2792#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~p~0#1|)) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} is VALID [2022-02-20 17:33:12,155 INFO L290 TraceCheckUtils]: 62: Hoare triple {2792#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~p~0#1|)) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} assume !(1 != main_~p~0#1); {2796#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} is VALID [2022-02-20 17:33:12,156 INFO L272 TraceCheckUtils]: 63: Hoare triple {2796#(and (= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~d~0#1| 1) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} call __VERIFIER_assert((if main_~A~0#1 == main_~d~0#1 * main_~q~0#1 + main_~r~0#1 then 1 else 0)); {2800#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:33:12,156 INFO L290 TraceCheckUtils]: 64: Hoare triple {2800#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2804#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:33:12,157 INFO L290 TraceCheckUtils]: 65: Hoare triple {2804#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2599#false} is VALID [2022-02-20 17:33:12,157 INFO L290 TraceCheckUtils]: 66: Hoare triple {2599#false} assume !false; {2599#false} is VALID [2022-02-20 17:33:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 66 proven. 11 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-02-20 17:33:12,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:33:22,112 INFO L290 TraceCheckUtils]: 66: Hoare triple {2599#false} assume !false; {2599#false} is VALID [2022-02-20 17:33:22,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {2804#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2599#false} is VALID [2022-02-20 17:33:22,113 INFO L290 TraceCheckUtils]: 64: Hoare triple {2800#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2804#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:33:22,113 INFO L272 TraceCheckUtils]: 63: Hoare triple {2820#(= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)} call __VERIFIER_assert((if main_~A~0#1 == main_~d~0#1 * main_~q~0#1 + main_~r~0#1 then 1 else 0)); {2800#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:33:22,114 INFO L290 TraceCheckUtils]: 62: Hoare triple {2824#(or (not (= |ULTIMATE.start_main_~p~0#1| 1)) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} assume !(1 != main_~p~0#1); {2820#(= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:33:22,115 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} {2828#(or (not (= |ULTIMATE.start_main_~p~0#1| 1)) (not (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} #80#return; {2824#(or (not (= |ULTIMATE.start_main_~p~0#1| 1)) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} is VALID [2022-02-20 17:33:22,115 INFO L290 TraceCheckUtils]: 60: Hoare triple {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:33:22,115 INFO L290 TraceCheckUtils]: 59: Hoare triple {2838#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:33:22,116 INFO L290 TraceCheckUtils]: 58: Hoare triple {2598#true} ~cond := #in~cond; {2838#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:33:22,116 INFO L272 TraceCheckUtils]: 57: Hoare triple {2828#(or (not (= |ULTIMATE.start_main_~p~0#1| 1)) (not (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:22,117 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} {2598#true} #78#return; {2828#(or (not (= |ULTIMATE.start_main_~p~0#1| 1)) (not (= (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~d~0#1|)) (= (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|))} is VALID [2022-02-20 17:33:22,118 INFO L290 TraceCheckUtils]: 55: Hoare triple {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:33:22,118 INFO L290 TraceCheckUtils]: 54: Hoare triple {2838#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:33:22,118 INFO L290 TraceCheckUtils]: 53: Hoare triple {2598#true} ~cond := #in~cond; {2838#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:33:22,118 INFO L272 TraceCheckUtils]: 52: Hoare triple {2598#true} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:22,119 INFO L290 TraceCheckUtils]: 51: Hoare triple {2598#true} assume !false; {2598#true} is VALID [2022-02-20 17:33:22,119 INFO L290 TraceCheckUtils]: 50: Hoare triple {2598#true} assume main_~r~0#1 >= main_~d~0#1;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {2598#true} is VALID [2022-02-20 17:33:22,119 INFO L290 TraceCheckUtils]: 49: Hoare triple {2598#true} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {2598#true} is VALID [2022-02-20 17:33:22,119 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2598#true} {2598#true} #80#return; {2598#true} is VALID [2022-02-20 17:33:22,119 INFO L290 TraceCheckUtils]: 47: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:22,119 INFO L290 TraceCheckUtils]: 46: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:22,119 INFO L290 TraceCheckUtils]: 45: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:22,119 INFO L272 TraceCheckUtils]: 44: Hoare triple {2598#true} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:22,119 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2598#true} {2598#true} #78#return; {2598#true} is VALID [2022-02-20 17:33:22,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:22,119 INFO L290 TraceCheckUtils]: 41: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:22,119 INFO L290 TraceCheckUtils]: 40: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:22,119 INFO L272 TraceCheckUtils]: 39: Hoare triple {2598#true} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:22,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {2598#true} assume !false; {2598#true} is VALID [2022-02-20 17:33:22,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {2598#true} assume !(main_~r~0#1 >= main_~d~0#1); {2598#true} is VALID [2022-02-20 17:33:22,120 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2598#true} {2598#true} #76#return; {2598#true} is VALID [2022-02-20 17:33:22,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:22,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:22,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:22,120 INFO L272 TraceCheckUtils]: 32: Hoare triple {2598#true} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:22,120 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2598#true} {2598#true} #74#return; {2598#true} is VALID [2022-02-20 17:33:22,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:22,120 INFO L290 TraceCheckUtils]: 29: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:22,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:22,120 INFO L272 TraceCheckUtils]: 27: Hoare triple {2598#true} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:22,121 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2598#true} {2598#true} #72#return; {2598#true} is VALID [2022-02-20 17:33:22,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:22,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:22,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:22,121 INFO L272 TraceCheckUtils]: 22: Hoare triple {2598#true} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:22,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {2598#true} assume !false; {2598#true} is VALID [2022-02-20 17:33:22,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {2598#true} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {2598#true} is VALID [2022-02-20 17:33:22,121 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2598#true} {2598#true} #76#return; {2598#true} is VALID [2022-02-20 17:33:22,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:22,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:22,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:22,122 INFO L272 TraceCheckUtils]: 15: Hoare triple {2598#true} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:22,122 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2598#true} {2598#true} #74#return; {2598#true} is VALID [2022-02-20 17:33:22,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:22,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:22,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:22,122 INFO L272 TraceCheckUtils]: 10: Hoare triple {2598#true} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:22,122 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2598#true} {2598#true} #72#return; {2598#true} is VALID [2022-02-20 17:33:22,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:22,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:22,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:22,122 INFO L272 TraceCheckUtils]: 5: Hoare triple {2598#true} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {2598#true} is VALID [2022-02-20 17:33:22,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {2598#true} assume !false; {2598#true} is VALID [2022-02-20 17:33:22,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {2598#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {2598#true} is VALID [2022-02-20 17:33:22,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {2598#true} assume !(0 == assume_abort_if_not_~cond#1); {2598#true} is VALID [2022-02-20 17:33:22,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {2598#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2598#true} is VALID [2022-02-20 17:33:22,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {2598#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {2598#true} is VALID [2022-02-20 17:33:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-02-20 17:33:22,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:33:22,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522495151] [2022-02-20 17:33:22,124 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:33:22,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245208243] [2022-02-20 17:33:22,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245208243] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:33:22,124 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:33:22,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-02-20 17:33:22,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381039539] [2022-02-20 17:33:22,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:33:22,125 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) Word has length 67 [2022-02-20 17:33:22,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:33:22,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2022-02-20 17:33:22,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:22,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 17:33:22,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:33:22,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 17:33:22,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:33:22,176 INFO L87 Difference]: Start difference. First operand 105 states and 138 transitions. Second operand has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2022-02-20 17:33:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:23,158 INFO L93 Difference]: Finished difference Result 161 states and 211 transitions. [2022-02-20 17:33:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:33:23,159 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) Word has length 67 [2022-02-20 17:33:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2022-02-20 17:33:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 106 transitions. [2022-02-20 17:33:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2022-02-20 17:33:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 106 transitions. [2022-02-20 17:33:23,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 106 transitions. [2022-02-20 17:33:23,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:23,275 INFO L225 Difference]: With dead ends: 161 [2022-02-20 17:33:23,275 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 17:33:23,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-02-20 17:33:23,279 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:33:23,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 181 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:33:23,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 17:33:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2022-02-20 17:33:23,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:23,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 93 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 61 states have internal predecessors, (68), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:23,316 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 93 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 61 states have internal predecessors, (68), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:23,316 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 93 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 61 states have internal predecessors, (68), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:23,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:23,323 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2022-02-20 17:33:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2022-02-20 17:33:23,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:23,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:23,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 61 states have internal predecessors, (68), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 107 states. [2022-02-20 17:33:23,327 INFO L87 Difference]: Start difference. First operand has 93 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 61 states have internal predecessors, (68), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 107 states. [2022-02-20 17:33:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:23,331 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2022-02-20 17:33:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2022-02-20 17:33:23,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:23,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:23,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:23,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 61 states have internal predecessors, (68), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2022-02-20 17:33:23,334 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 67 [2022-02-20 17:33:23,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:23,335 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2022-02-20 17:33:23,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2022-02-20 17:33:23,335 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2022-02-20 17:33:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 17:33:23,337 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:23,337 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:33:23,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:33:23,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:23,554 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:23,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:23,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1842513023, now seen corresponding path program 1 times [2022-02-20 17:33:23,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:33:23,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244494694] [2022-02-20 17:33:23,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:23,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:33:23,572 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:33:23,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1603168005] [2022-02-20 17:33:23,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:23,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:23,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:23,588 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:33:23,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 17:33:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:23,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 17:33:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:23,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:24,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {3592#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {3592#true} is VALID [2022-02-20 17:33:24,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {3592#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3592#true} is VALID [2022-02-20 17:33:24,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {3592#true} assume !(0 == assume_abort_if_not_~cond#1); {3592#true} is VALID [2022-02-20 17:33:24,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {3592#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:33:24,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} assume !false; {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:33:24,725 INFO L272 TraceCheckUtils]: 5: Hoare triple {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,726 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3592#true} {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} #72#return; {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:33:24,726 INFO L272 TraceCheckUtils]: 10: Hoare triple {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,726 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3592#true} {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} #74#return; {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:33:24,726 INFO L272 TraceCheckUtils]: 15: Hoare triple {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,727 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3592#true} {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} #76#return; {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:33:24,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} is VALID [2022-02-20 17:33:24,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} assume !false; {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} is VALID [2022-02-20 17:33:24,728 INFO L272 TraceCheckUtils]: 22: Hoare triple {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,729 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3592#true} {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} #72#return; {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} is VALID [2022-02-20 17:33:24,729 INFO L272 TraceCheckUtils]: 27: Hoare triple {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,730 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3592#true} {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} #74#return; {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} is VALID [2022-02-20 17:33:24,730 INFO L272 TraceCheckUtils]: 32: Hoare triple {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,731 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3592#true} {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} #76#return; {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} is VALID [2022-02-20 17:33:24,732 INFO L290 TraceCheckUtils]: 37: Hoare triple {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} assume !false; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,732 INFO L272 TraceCheckUtils]: 39: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,732 INFO L290 TraceCheckUtils]: 40: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,732 INFO L290 TraceCheckUtils]: 41: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,733 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3592#true} {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} #72#return; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,733 INFO L272 TraceCheckUtils]: 44: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,733 INFO L290 TraceCheckUtils]: 46: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,734 INFO L290 TraceCheckUtils]: 47: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,734 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3592#true} {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} #74#return; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,734 INFO L272 TraceCheckUtils]: 49: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,735 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3592#true} {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} #76#return; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,735 INFO L290 TraceCheckUtils]: 54: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} assume !(main_~r~0#1 >= main_~d~0#1); {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,735 INFO L290 TraceCheckUtils]: 55: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} assume !false; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,735 INFO L272 TraceCheckUtils]: 56: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,735 INFO L290 TraceCheckUtils]: 58: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,735 INFO L290 TraceCheckUtils]: 59: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,736 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3592#true} {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} #78#return; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,736 INFO L272 TraceCheckUtils]: 61: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,736 INFO L290 TraceCheckUtils]: 63: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,736 INFO L290 TraceCheckUtils]: 64: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,737 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {3592#true} {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} #80#return; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,737 INFO L290 TraceCheckUtils]: 66: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} assume !(1 != main_~p~0#1); {3593#false} is VALID [2022-02-20 17:33:24,737 INFO L272 TraceCheckUtils]: 67: Hoare triple {3593#false} call __VERIFIER_assert((if main_~A~0#1 == main_~d~0#1 * main_~q~0#1 + main_~r~0#1 then 1 else 0)); {3593#false} is VALID [2022-02-20 17:33:24,737 INFO L290 TraceCheckUtils]: 68: Hoare triple {3593#false} ~cond := #in~cond; {3593#false} is VALID [2022-02-20 17:33:24,737 INFO L290 TraceCheckUtils]: 69: Hoare triple {3593#false} assume !(0 == ~cond); {3593#false} is VALID [2022-02-20 17:33:24,737 INFO L290 TraceCheckUtils]: 70: Hoare triple {3593#false} assume true; {3593#false} is VALID [2022-02-20 17:33:24,737 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3593#false} {3593#false} #82#return; {3593#false} is VALID [2022-02-20 17:33:24,737 INFO L272 TraceCheckUtils]: 72: Hoare triple {3593#false} call __VERIFIER_assert((if main_~B~0#1 == main_~d~0#1 then 1 else 0)); {3593#false} is VALID [2022-02-20 17:33:24,737 INFO L290 TraceCheckUtils]: 73: Hoare triple {3593#false} ~cond := #in~cond; {3593#false} is VALID [2022-02-20 17:33:24,737 INFO L290 TraceCheckUtils]: 74: Hoare triple {3593#false} assume 0 == ~cond; {3593#false} is VALID [2022-02-20 17:33:24,738 INFO L290 TraceCheckUtils]: 75: Hoare triple {3593#false} assume !false; {3593#false} is VALID [2022-02-20 17:33:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-02-20 17:33:24,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:33:24,739 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:33:24,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244494694] [2022-02-20 17:33:24,739 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:33:24,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603168005] [2022-02-20 17:33:24,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603168005] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:33:24,739 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:33:24,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:33:24,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576224595] [2022-02-20 17:33:24,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:33:24,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 76 [2022-02-20 17:33:24,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:33:24,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:33:24,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:24,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:33:24,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:33:24,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:33:24,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:33:24,770 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:33:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:24,892 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2022-02-20 17:33:24,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:33:24,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 76 [2022-02-20 17:33:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:33:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 17:33:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:33:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 17:33:24,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-02-20 17:33:24,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:24,964 INFO L225 Difference]: With dead ends: 107 [2022-02-20 17:33:24,964 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 17:33:24,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:33:24,966 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:33:24,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 71 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:33:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 17:33:24,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-02-20 17:33:24,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:24,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:24,998 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:24,998 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:25,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:25,004 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-02-20 17:33:25,004 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-02-20 17:33:25,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:25,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:25,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 95 states. [2022-02-20 17:33:25,005 INFO L87 Difference]: Start difference. First operand has 95 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 95 states. [2022-02-20 17:33:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:25,008 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-02-20 17:33:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-02-20 17:33:25,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:25,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:25,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:25,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2022-02-20 17:33:25,012 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 76 [2022-02-20 17:33:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:25,012 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2022-02-20 17:33:25,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:33:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-02-20 17:33:25,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-20 17:33:25,013 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:25,013 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:33:25,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 17:33:25,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:25,226 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:25,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:25,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1412721000, now seen corresponding path program 1 times [2022-02-20 17:33:25,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:33:25,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493118862] [2022-02-20 17:33:25,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:25,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:33:25,243 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:33:25,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1231809226] [2022-02-20 17:33:25,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:25,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:25,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:25,246 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:33:25,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 17:33:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:25,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 17:33:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:25,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:26,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {4294#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {4294#true} is VALID [2022-02-20 17:33:26,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {4294#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4294#true} is VALID [2022-02-20 17:33:26,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {4294#true} assume !(0 == assume_abort_if_not_~cond#1); {4294#true} is VALID [2022-02-20 17:33:26,972 INFO L290 TraceCheckUtils]: 3: Hoare triple {4294#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:33:26,972 INFO L290 TraceCheckUtils]: 4: Hoare triple {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} assume !false; {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:33:26,972 INFO L272 TraceCheckUtils]: 5: Hoare triple {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:26,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:26,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:26,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:26,972 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4294#true} {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} #72#return; {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:33:26,973 INFO L272 TraceCheckUtils]: 10: Hoare triple {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:26,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:26,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:26,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:26,973 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4294#true} {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} #74#return; {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:33:26,973 INFO L272 TraceCheckUtils]: 15: Hoare triple {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:26,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:26,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:26,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:26,974 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4294#true} {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} #76#return; {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-20 17:33:26,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {4308#(<= 1 |ULTIMATE.start_main_~d~0#1|)} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} is VALID [2022-02-20 17:33:26,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} assume !false; {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} is VALID [2022-02-20 17:33:26,975 INFO L272 TraceCheckUtils]: 22: Hoare triple {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:26,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:26,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:26,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:26,975 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4294#true} {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} #72#return; {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} is VALID [2022-02-20 17:33:26,975 INFO L272 TraceCheckUtils]: 27: Hoare triple {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:26,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:26,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:26,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:26,981 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4294#true} {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} #74#return; {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} is VALID [2022-02-20 17:33:26,981 INFO L272 TraceCheckUtils]: 32: Hoare triple {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:26,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:26,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:26,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:26,982 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4294#true} {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} #76#return; {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} is VALID [2022-02-20 17:33:26,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {4360#(<= 1 (div |ULTIMATE.start_main_~d~0#1| 2))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:26,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} assume !false; {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:26,983 INFO L272 TraceCheckUtils]: 39: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:26,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:26,983 INFO L290 TraceCheckUtils]: 41: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:26,983 INFO L290 TraceCheckUtils]: 42: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:26,984 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4294#true} {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} #72#return; {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:26,984 INFO L272 TraceCheckUtils]: 44: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:26,984 INFO L290 TraceCheckUtils]: 45: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:26,984 INFO L290 TraceCheckUtils]: 46: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:26,984 INFO L290 TraceCheckUtils]: 47: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:26,984 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4294#true} {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} #74#return; {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:26,984 INFO L272 TraceCheckUtils]: 49: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:26,984 INFO L290 TraceCheckUtils]: 50: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:26,984 INFO L290 TraceCheckUtils]: 51: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:26,984 INFO L290 TraceCheckUtils]: 52: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:26,985 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4294#true} {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} #76#return; {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:26,985 INFO L290 TraceCheckUtils]: 54: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} assume !(main_~r~0#1 >= main_~d~0#1); {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:26,985 INFO L290 TraceCheckUtils]: 55: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} assume !false; {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:26,986 INFO L272 TraceCheckUtils]: 56: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:26,986 INFO L290 TraceCheckUtils]: 57: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:26,986 INFO L290 TraceCheckUtils]: 58: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:26,986 INFO L290 TraceCheckUtils]: 59: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:26,986 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4294#true} {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} #78#return; {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:26,986 INFO L272 TraceCheckUtils]: 61: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {4294#true} is VALID [2022-02-20 17:33:26,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:26,986 INFO L290 TraceCheckUtils]: 63: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:26,986 INFO L290 TraceCheckUtils]: 64: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:26,987 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {4294#true} {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} #80#return; {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:26,987 INFO L290 TraceCheckUtils]: 66: Hoare triple {4412#(and (<= 1 (div (div |ULTIMATE.start_main_~d~0#1| 2) 2)) (= (mod |ULTIMATE.start_main_~d~0#1| 2) 0) (<= (div |ULTIMATE.start_main_~d~0#1| 2) |ULTIMATE.start_main_~r~0#1|))} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {4500#(and (<= 1 (div |ULTIMATE.start_main_~r~0#1| 2)) (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:33:26,988 INFO L290 TraceCheckUtils]: 67: Hoare triple {4500#(and (<= 1 (div |ULTIMATE.start_main_~r~0#1| 2)) (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_~r~0#1 >= main_~d~0#1); {4295#false} is VALID [2022-02-20 17:33:26,988 INFO L290 TraceCheckUtils]: 68: Hoare triple {4295#false} assume !false; {4295#false} is VALID [2022-02-20 17:33:26,988 INFO L272 TraceCheckUtils]: 69: Hoare triple {4295#false} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {4295#false} is VALID [2022-02-20 17:33:26,988 INFO L290 TraceCheckUtils]: 70: Hoare triple {4295#false} ~cond := #in~cond; {4295#false} is VALID [2022-02-20 17:33:26,988 INFO L290 TraceCheckUtils]: 71: Hoare triple {4295#false} assume !(0 == ~cond); {4295#false} is VALID [2022-02-20 17:33:26,988 INFO L290 TraceCheckUtils]: 72: Hoare triple {4295#false} assume true; {4295#false} is VALID [2022-02-20 17:33:26,988 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4295#false} {4295#false} #78#return; {4295#false} is VALID [2022-02-20 17:33:26,988 INFO L272 TraceCheckUtils]: 74: Hoare triple {4295#false} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {4295#false} is VALID [2022-02-20 17:33:26,988 INFO L290 TraceCheckUtils]: 75: Hoare triple {4295#false} ~cond := #in~cond; {4295#false} is VALID [2022-02-20 17:33:26,988 INFO L290 TraceCheckUtils]: 76: Hoare triple {4295#false} assume !(0 == ~cond); {4295#false} is VALID [2022-02-20 17:33:26,988 INFO L290 TraceCheckUtils]: 77: Hoare triple {4295#false} assume true; {4295#false} is VALID [2022-02-20 17:33:26,988 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4295#false} {4295#false} #80#return; {4295#false} is VALID [2022-02-20 17:33:26,988 INFO L290 TraceCheckUtils]: 79: Hoare triple {4295#false} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {4295#false} is VALID [2022-02-20 17:33:26,989 INFO L290 TraceCheckUtils]: 80: Hoare triple {4295#false} assume main_~r~0#1 >= main_~d~0#1;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {4295#false} is VALID [2022-02-20 17:33:26,989 INFO L290 TraceCheckUtils]: 81: Hoare triple {4295#false} assume !false; {4295#false} is VALID [2022-02-20 17:33:26,989 INFO L272 TraceCheckUtils]: 82: Hoare triple {4295#false} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {4295#false} is VALID [2022-02-20 17:33:26,989 INFO L290 TraceCheckUtils]: 83: Hoare triple {4295#false} ~cond := #in~cond; {4295#false} is VALID [2022-02-20 17:33:26,989 INFO L290 TraceCheckUtils]: 84: Hoare triple {4295#false} assume 0 == ~cond; {4295#false} is VALID [2022-02-20 17:33:26,989 INFO L290 TraceCheckUtils]: 85: Hoare triple {4295#false} assume !false; {4295#false} is VALID [2022-02-20 17:33:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-02-20 17:33:26,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:33:26,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:33:26,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493118862] [2022-02-20 17:33:26,989 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:33:26,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231809226] [2022-02-20 17:33:26,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231809226] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:33:26,990 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:33:26,990 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:33:26,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585732228] [2022-02-20 17:33:26,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:33:26,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2022-02-20 17:33:26,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:33:26,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 17:33:27,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:27,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:33:27,020 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:33:27,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:33:27,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:33:27,020 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 17:33:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:27,415 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2022-02-20 17:33:27,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:33:27,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2022-02-20 17:33:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 17:33:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-02-20 17:33:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 17:33:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-02-20 17:33:27,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2022-02-20 17:33:27,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:27,498 INFO L225 Difference]: With dead ends: 131 [2022-02-20 17:33:27,498 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 17:33:27,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:33:27,499 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:33:27,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 127 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:33:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 17:33:27,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2022-02-20 17:33:27,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:27,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:33:27,539 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:33:27,539 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:33:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:27,541 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-02-20 17:33:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2022-02-20 17:33:27,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:27,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:27,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 97 states. [2022-02-20 17:33:27,542 INFO L87 Difference]: Start difference. First operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 97 states. [2022-02-20 17:33:27,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:27,544 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-02-20 17:33:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2022-02-20 17:33:27,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:27,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:27,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:27,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:33:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2022-02-20 17:33:27,546 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 86 [2022-02-20 17:33:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:27,546 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2022-02-20 17:33:27,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 17:33:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2022-02-20 17:33:27,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-20 17:33:27,547 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:27,547 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:33:27,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-20 17:33:27,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:27,763 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:27,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:27,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1193302554, now seen corresponding path program 2 times [2022-02-20 17:33:27,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:33:27,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146226035] [2022-02-20 17:33:27,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:27,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:33:27,774 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:33:27,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151745996] [2022-02-20 17:33:27,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:33:27,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:27,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:27,775 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:33:27,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 17:33:27,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:33:27,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:33:27,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 39 conjunts are in the unsatisfiable core [2022-02-20 17:33:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:27,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:28,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {5054#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {5054#true} is VALID [2022-02-20 17:33:28,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {5054#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 >= 0 && main_~A~0#1 <= 50 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5054#true} is VALID [2022-02-20 17:33:28,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {5054#true} assume !(0 == assume_abort_if_not_~cond#1); {5054#true} is VALID [2022-02-20 17:33:28,550 INFO L290 TraceCheckUtils]: 3: Hoare triple {5054#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,550 INFO L290 TraceCheckUtils]: 4: Hoare triple {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,550 INFO L272 TraceCheckUtils]: 5: Hoare triple {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,551 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {5054#true} {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,551 INFO L272 TraceCheckUtils]: 10: Hoare triple {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,552 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5054#true} {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,552 INFO L272 TraceCheckUtils]: 15: Hoare triple {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,553 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5054#true} {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,554 INFO L272 TraceCheckUtils]: 22: Hoare triple {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,554 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5054#true} {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,554 INFO L272 TraceCheckUtils]: 27: Hoare triple {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,555 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5054#true} {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,555 INFO L272 TraceCheckUtils]: 32: Hoare triple {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,556 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5054#true} {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,557 INFO L272 TraceCheckUtils]: 39: Hoare triple {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,558 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5054#true} {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,558 INFO L272 TraceCheckUtils]: 44: Hoare triple {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,558 INFO L290 TraceCheckUtils]: 45: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,558 INFO L290 TraceCheckUtils]: 46: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,558 INFO L290 TraceCheckUtils]: 47: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,559 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5054#true} {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,559 INFO L272 TraceCheckUtils]: 49: Hoare triple {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,559 INFO L290 TraceCheckUtils]: 51: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,559 INFO L290 TraceCheckUtils]: 52: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,560 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5054#true} {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,560 INFO L290 TraceCheckUtils]: 54: Hoare triple {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !(main_~r~0#1 >= main_~d~0#1); {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,560 INFO L290 TraceCheckUtils]: 55: Hoare triple {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,561 INFO L272 TraceCheckUtils]: 56: Hoare triple {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,561 INFO L290 TraceCheckUtils]: 57: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,561 INFO L290 TraceCheckUtils]: 58: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,561 INFO L290 TraceCheckUtils]: 59: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,561 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5054#true} {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #78#return; {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,561 INFO L272 TraceCheckUtils]: 61: Hoare triple {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,562 INFO L290 TraceCheckUtils]: 62: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,562 INFO L290 TraceCheckUtils]: 63: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,562 INFO L290 TraceCheckUtils]: 64: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,562 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {5054#true} {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #80#return; {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,563 INFO L290 TraceCheckUtils]: 66: Hoare triple {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {5261#(and (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} is VALID [2022-02-20 17:33:28,564 INFO L290 TraceCheckUtils]: 67: Hoare triple {5261#(and (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} assume main_~r~0#1 >= main_~d~0#1;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} is VALID [2022-02-20 17:33:28,564 INFO L290 TraceCheckUtils]: 68: Hoare triple {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} assume !false; {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} is VALID [2022-02-20 17:33:28,564 INFO L272 TraceCheckUtils]: 69: Hoare triple {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,564 INFO L290 TraceCheckUtils]: 70: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,565 INFO L290 TraceCheckUtils]: 71: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,565 INFO L290 TraceCheckUtils]: 72: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,565 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5054#true} {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} #78#return; {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} is VALID [2022-02-20 17:33:28,565 INFO L272 TraceCheckUtils]: 74: Hoare triple {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,565 INFO L290 TraceCheckUtils]: 75: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,566 INFO L290 TraceCheckUtils]: 76: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,566 INFO L290 TraceCheckUtils]: 77: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,566 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {5054#true} {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} #80#return; {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} is VALID [2022-02-20 17:33:28,568 INFO L290 TraceCheckUtils]: 79: Hoare triple {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {5302#(and (= (div (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 2) |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)) (= (+ (- 2) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,568 INFO L290 TraceCheckUtils]: 80: Hoare triple {5302#(and (= (div (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 2) |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)) (= (+ (- 2) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1))} assume main_~r~0#1 >= main_~d~0#1;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {5306#(and (<= 0 |ULTIMATE.start_main_~r~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~B~0#1| 1) (= (div (* 2 |ULTIMATE.start_main_~B~0#1|) 2) (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:33:28,569 INFO L290 TraceCheckUtils]: 81: Hoare triple {5306#(and (<= 0 |ULTIMATE.start_main_~r~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~B~0#1| 1) (= (div (* 2 |ULTIMATE.start_main_~B~0#1|) 2) (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~q~0#1|) 0))} assume !false; {5306#(and (<= 0 |ULTIMATE.start_main_~r~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~B~0#1| 1) (= (div (* 2 |ULTIMATE.start_main_~B~0#1|) 2) (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:33:28,570 INFO L272 TraceCheckUtils]: 82: Hoare triple {5306#(and (<= 0 |ULTIMATE.start_main_~r~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~B~0#1| 1) (= (div (* 2 |ULTIMATE.start_main_~B~0#1|) 2) (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~q~0#1|) 0))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {5313#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:33:28,570 INFO L290 TraceCheckUtils]: 83: Hoare triple {5313#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5317#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:33:28,570 INFO L290 TraceCheckUtils]: 84: Hoare triple {5317#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5055#false} is VALID [2022-02-20 17:33:28,570 INFO L290 TraceCheckUtils]: 85: Hoare triple {5055#false} assume !false; {5055#false} is VALID [2022-02-20 17:33:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 26 proven. 24 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-02-20 17:33:28,571 INFO L328 TraceCheckSpWp]: Computing backward predicates...