./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound20.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_valuebound20.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 1619c1c02ba7c9b660af32e6427e3b3d5cd6ca3ff286b9db386918ae0c8b508c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:32:29,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:32:29,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:32:29,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:32:29,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:32:29,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:32:29,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:32:29,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:32:29,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:32:29,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:32:29,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:32:29,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:32:29,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:32:29,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:32:29,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:32:29,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:32:29,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:32:29,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:32:29,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:32:29,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:32:29,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:32:29,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:32:29,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:32:29,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:32:29,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:32:29,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:32:29,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:32:29,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:32:29,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:32:29,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:32:29,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:32:29,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:32:29,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:32:29,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:32:29,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:32:29,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:32:29,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:32:29,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:32:29,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:32:29,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:32:29,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:32:29,436 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:29,460 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:32:29,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:32:29,460 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:32:29,461 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:32:29,461 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:32:29,461 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:32:29,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:32:29,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:32:29,462 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:32:29,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:32:29,463 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:32:29,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:32:29,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:32:29,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:32:29,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:32:29,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:32:29,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:32:29,464 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:32:29,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:32:29,464 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:32:29,464 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:32:29,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:32:29,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:32:29,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:32:29,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:32:29,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:32:29,465 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:32:29,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:32:29,466 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:32:29,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:32:29,466 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:32:29,466 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:32:29,466 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:32:29,467 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 -> 1619c1c02ba7c9b660af32e6427e3b3d5cd6ca3ff286b9db386918ae0c8b508c [2022-02-20 17:32:29,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:32:29,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:32:29,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:32:29,669 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:32:29,670 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:32:29,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound20.c [2022-02-20 17:32:29,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244af6264/c411d55dd6bb466bbb11677a0a724892/FLAG1155a7d4c [2022-02-20 17:32:30,073 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:32:30,074 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound20.c [2022-02-20 17:32:30,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244af6264/c411d55dd6bb466bbb11677a0a724892/FLAG1155a7d4c [2022-02-20 17:32:30,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244af6264/c411d55dd6bb466bbb11677a0a724892 [2022-02-20 17:32:30,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:32:30,089 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:32:30,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:32:30,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:32:30,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:32:30,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:32:30" (1/1) ... [2022-02-20 17:32:30,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e3933f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:30, skipping insertion in model container [2022-02-20 17:32:30,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:32:30" (1/1) ... [2022-02-20 17:32:30,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:32:30,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:32:30,227 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_valuebound20.c[526,539] [2022-02-20 17:32:30,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:32:30,262 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:32:30,278 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_valuebound20.c[526,539] [2022-02-20 17:32:30,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:32:30,292 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:32:30,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:30 WrapperNode [2022-02-20 17:32:30,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:32:30,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:32:30,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:32:30,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:32:30,299 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:30" (1/1) ... [2022-02-20 17:32:30,303 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:30" (1/1) ... [2022-02-20 17:32:30,317 INFO L137 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2022-02-20 17:32:30,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:32:30,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:32:30,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:32:30,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:32:30,324 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:30" (1/1) ... [2022-02-20 17:32:30,324 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:30" (1/1) ... [2022-02-20 17:32:30,325 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:30" (1/1) ... [2022-02-20 17:32:30,325 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:30" (1/1) ... [2022-02-20 17:32:30,328 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:30" (1/1) ... [2022-02-20 17:32:30,337 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:30" (1/1) ... [2022-02-20 17:32:30,338 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:30" (1/1) ... [2022-02-20 17:32:30,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:32:30,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:32:30,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:32:30,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:32:30,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:30" (1/1) ... [2022-02-20 17:32:30,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:32:30,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:30,372 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:30,387 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:30,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:32:30,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:32:30,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:32:30,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:32:30,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:32:30,400 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:32:30,439 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:32:30,440 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:32:30,546 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:32:30,551 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:32:30,551 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:32:30,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:32:30 BoogieIcfgContainer [2022-02-20 17:32:30,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:32:30,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:32:30,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:32:30,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:32:30,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:32:30" (1/3) ... [2022-02-20 17:32:30,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678fcc45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:32:30, skipping insertion in model container [2022-02-20 17:32:30,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:32:30" (2/3) ... [2022-02-20 17:32:30,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678fcc45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:32:30, skipping insertion in model container [2022-02-20 17:32:30,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:32:30" (3/3) ... [2022-02-20 17:32:30,572 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_valuebound20.c [2022-02-20 17:32:30,575 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:32:30,576 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:32:30,607 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:32:30,612 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:30,612 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:32:30,626 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:30,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:32:30,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:30,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:30,630 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:30,634 INFO L85 PathProgramCache]: Analyzing trace with hash -586848446, now seen corresponding path program 1 times [2022-02-20 17:32:30,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:30,641 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006519839] [2022-02-20 17:32:30,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:30,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:30,776 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:30,776 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 <= 20 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:30,777 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:30,777 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:30,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:32:30,778 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:30,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-02-20 17:32:30,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-02-20 17:32:30,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:32:30,779 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:30,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:30,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006519839] [2022-02-20 17:32:30,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006519839] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:30,781 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:30,781 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:32:30,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466573682] [2022-02-20 17:32:30,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:30,787 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:30,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:30,790 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:30,801 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:30,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:32:30,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:30,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:32:30,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:32:30,829 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:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:30,879 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. [2022-02-20 17:32:30,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:32:30,879 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:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:30,880 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:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2022-02-20 17:32:30,889 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:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2022-02-20 17:32:30,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 83 transitions. [2022-02-20 17:32:30,995 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:31,002 INFO L225 Difference]: With dead ends: 49 [2022-02-20 17:32:31,002 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:32:31,005 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:31,007 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:31,008 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:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:32:31,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:32:31,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:31,032 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:31,032 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:31,033 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:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:31,042 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-02-20 17:32:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-20 17:32:31,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:31,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:31,043 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:31,044 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:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:31,052 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-02-20 17:32:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-20 17:32:31,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:31,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:31,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:31,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:31,054 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:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-02-20 17:32:31,058 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 9 [2022-02-20 17:32:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:31,059 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-02-20 17:32:31,059 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:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-20 17:32:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:32:31,060 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:31,060 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:31,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:32:31,060 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:31,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1188158916, now seen corresponding path program 1 times [2022-02-20 17:32:31,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:31,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132123386] [2022-02-20 17:32:31,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:31,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:31,119 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:31,120 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 <= 20 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:31,121 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:31,122 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:31,123 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:31,124 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:31,133 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:31,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {181#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {178#false} is VALID [2022-02-20 17:32:31,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#false} assume !false; {178#false} is VALID [2022-02-20 17:32:31,134 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:31,134 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:31,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132123386] [2022-02-20 17:32:31,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132123386] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:31,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:31,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:32:31,135 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936408401] [2022-02-20 17:32:31,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:31,137 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:31,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:31,137 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:31,146 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:31,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:31,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:31,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:31,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:32:31,151 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:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:31,297 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-02-20 17:32:31,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:32:31,298 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:31,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:31,298 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:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 17:32:31,305 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:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 17:32:31,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-02-20 17:32:31,385 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:31,388 INFO L225 Difference]: With dead ends: 35 [2022-02-20 17:32:31,388 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 17:32:31,392 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:31,395 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:31,395 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:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 17:32:31,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2022-02-20 17:32:31,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:31,402 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:31,403 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:31,404 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:31,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:31,408 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-02-20 17:32:31,408 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-02-20 17:32:31,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:31,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:31,410 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:31,410 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:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:31,415 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-02-20 17:32:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-02-20 17:32:31,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:31,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:31,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:31,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:31,421 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:31,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-02-20 17:32:31,427 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2022-02-20 17:32:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:31,428 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-02-20 17:32:31,428 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:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-02-20 17:32:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 17:32:31,429 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:31,430 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:31,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:32:31,430 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:31,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:31,431 INFO L85 PathProgramCache]: Analyzing trace with hash -697944935, now seen corresponding path program 1 times [2022-02-20 17:32:31,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:31,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156190395] [2022-02-20 17:32:31,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:31,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:31,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-20 17:32:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:31,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} ~cond := #in~cond; {337#true} is VALID [2022-02-20 17:32:31,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume !(0 == ~cond); {337#true} is VALID [2022-02-20 17:32:31,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 17:32:31,536 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:31,536 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:31,537 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 <= 20 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:31,537 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:31,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:31,549 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:31,549 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:31,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {337#true} ~cond := #in~cond; {337#true} is VALID [2022-02-20 17:32:31,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#true} assume !(0 == ~cond); {337#true} is VALID [2022-02-20 17:32:31,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 17:32:31,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:31,553 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:31,554 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:31,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {345#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {338#false} is VALID [2022-02-20 17:32:31,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {338#false} assume !false; {338#false} is VALID [2022-02-20 17:32:31,555 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:31,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:31,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156190395] [2022-02-20 17:32:31,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156190395] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:31,555 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:31,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:32:31,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957987162] [2022-02-20 17:32:31,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:31,556 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:31,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:31,556 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:31,565 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:31,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:31,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:31,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:31,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:32:31,566 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:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:31,681 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-02-20 17:32:31,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:32:31,681 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:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:31,682 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:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 17:32:31,683 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:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 17:32:31,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-02-20 17:32:31,722 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:31,727 INFO L225 Difference]: With dead ends: 39 [2022-02-20 17:32:31,727 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 17:32:31,727 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:31,728 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:31,729 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:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 17:32:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-02-20 17:32:31,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:31,739 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:31,739 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:31,739 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:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:31,742 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-02-20 17:32:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-02-20 17:32:31,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:31,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:31,742 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:31,743 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:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:31,744 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-02-20 17:32:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-02-20 17:32:31,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:31,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:31,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:31,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:31,745 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:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 17:32:31,746 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2022-02-20 17:32:31,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:31,747 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 17:32:31,747 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:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 17:32:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:32:31,747 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:31,747 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:31,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:32:31,748 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:31,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:31,748 INFO L85 PathProgramCache]: Analyzing trace with hash 262992548, now seen corresponding path program 1 times [2022-02-20 17:32:31,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:31,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201432451] [2022-02-20 17:32:31,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:31,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:31,776 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:31,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [178473159] [2022-02-20 17:32:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:31,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:31,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:31,792 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:31,827 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:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:31,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:32:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:31,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:32:32,010 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:32,010 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 <= 20 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:32,010 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:32,014 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:32,015 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:32,015 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:32,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {519#true} ~cond := #in~cond; {519#true} is VALID [2022-02-20 17:32:32,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {519#true} assume !(0 == ~cond); {519#true} is VALID [2022-02-20 17:32:32,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 17:32:32,016 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:32,016 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:32,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {519#true} ~cond := #in~cond; {519#true} is VALID [2022-02-20 17:32:32,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {519#true} assume !(0 == ~cond); {519#true} is VALID [2022-02-20 17:32:32,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 17:32:32,017 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:32,018 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:32,018 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:32,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {520#false} is VALID [2022-02-20 17:32:32,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {520#false} assume !false; {520#false} is VALID [2022-02-20 17:32:32,019 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:32,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:32:32,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:32,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201432451] [2022-02-20 17:32:32,021 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:32:32,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178473159] [2022-02-20 17:32:32,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178473159] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:32,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:32,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:32:32,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333793724] [2022-02-20 17:32:32,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:32,022 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:32,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:32,023 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:32,037 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:32,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:32,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:32,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:32,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:32:32,040 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:32,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,190 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-02-20 17:32:32,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:32:32,191 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:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:32,191 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:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 17:32:32,193 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:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 17:32:32,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-02-20 17:32:32,259 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:32,261 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:32:32,261 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:32:32,261 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:32,262 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:32,263 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:32,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:32:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 17:32:32,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:32,269 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:32,269 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:32,269 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:32,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,272 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-02-20 17:32:32,272 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-02-20 17:32:32,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:32,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:32,273 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:32,273 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:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,275 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-02-20 17:32:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-02-20 17:32:32,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:32,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:32,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:32,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:32,276 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:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2022-02-20 17:32:32,278 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 19 [2022-02-20 17:32:32,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:32,278 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2022-02-20 17:32:32,278 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:32,279 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-02-20 17:32:32,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:32:32,279 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:32,279 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:32,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:32:32,483 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:32,483 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:32,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:32,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1807142342, now seen corresponding path program 1 times [2022-02-20 17:32:32,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:32,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582178064] [2022-02-20 17:32:32,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:32,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:32,503 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:32,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319778929] [2022-02-20 17:32:32,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:32,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:32,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:32,508 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:32,508 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:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:32,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:32:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:32,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:32:32,769 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:32,770 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 <= 20 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:32,770 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:32,771 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|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:32,771 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|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {830#(and (= |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:32,771 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|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {816#true} is VALID [2022-02-20 17:32:32,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {816#true} ~cond := #in~cond; {816#true} is VALID [2022-02-20 17:32:32,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {816#true} assume !(0 == ~cond); {816#true} is VALID [2022-02-20 17:32:32,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {816#true} assume true; {816#true} is VALID [2022-02-20 17:32:32,773 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|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {830#(and (= |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:32,773 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|) (= |ULTIMATE.start_main_~B~0#1| 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:32,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {816#true} ~cond := #in~cond; {816#true} is VALID [2022-02-20 17:32:32,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {816#true} assume !(0 == ~cond); {816#true} is VALID [2022-02-20 17:32:32,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#true} assume true; {816#true} is VALID [2022-02-20 17:32:32,775 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|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {830#(and (= |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:32,775 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|) (= |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)); {816#true} is VALID [2022-02-20 17:32:32,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {816#true} ~cond := #in~cond; {816#true} is VALID [2022-02-20 17:32:32,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {816#true} assume !(0 == ~cond); {816#true} is VALID [2022-02-20 17:32:32,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {816#true} assume true; {816#true} is VALID [2022-02-20 17:32:32,779 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|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {830#(and (= |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:32,780 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|) (= |ULTIMATE.start_main_~B~0#1| 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|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:32:32,781 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|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {830#(and (= |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:32,781 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|) (= |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)); {888#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:32:32,782 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:32,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {892#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {817#false} is VALID [2022-02-20 17:32:32,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {817#false} assume !false; {817#false} is VALID [2022-02-20 17:32:32,783 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:32,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:32:32,783 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:32,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582178064] [2022-02-20 17:32:32,783 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:32:32,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319778929] [2022-02-20 17:32:32,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319778929] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:32,783 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:32,784 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:32:32,784 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029230844] [2022-02-20 17:32:32,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:32,784 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:32,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:32,785 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:32,797 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:32,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:32,798 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:32,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:32,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:32:32,799 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:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,917 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-02-20 17:32:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:32:32,917 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:32,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:32,918 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:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 17:32:32,919 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:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 17:32:32,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-02-20 17:32:32,951 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:32,953 INFO L225 Difference]: With dead ends: 57 [2022-02-20 17:32:32,953 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 17:32:32,953 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:32,954 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:32,954 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:32,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 17:32:32,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-02-20 17:32:32,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:32,960 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:32,961 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:32,961 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:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,963 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-02-20 17:32:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-20 17:32:32,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:32,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:32,964 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:32,964 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:32,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,966 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-02-20 17:32:32,966 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-20 17:32:32,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:32,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:32,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:32,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:32,967 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:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-02-20 17:32:32,969 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 26 [2022-02-20 17:32:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:32,970 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-02-20 17:32:32,970 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:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-02-20 17:32:32,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:32:32,971 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:32,971 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:32,993 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:33,187 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:33,187 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:33,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:33,188 INFO L85 PathProgramCache]: Analyzing trace with hash -979933353, now seen corresponding path program 1 times [2022-02-20 17:32:33,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:33,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191536715] [2022-02-20 17:32:33,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:33,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:33,201 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:33,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [385601467] [2022-02-20 17:32:33,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:33,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:33,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:33,204 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:33,205 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:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:33,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 17:32:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:33,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:32:33,417 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:33,417 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 <= 20 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:33,417 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:33,418 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:33,418 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:33,418 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:33,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:33,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:33,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:33,419 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:33,420 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:33,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:33,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:33,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:33,421 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:33,421 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:33,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:33,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:33,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:33,422 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:33,422 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:33,423 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:33,424 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:33,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:33,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:33,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:33,426 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:33,426 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:33,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:33,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:33,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:33,427 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:33,427 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:33,428 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:33,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {1257#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1151#false} is VALID [2022-02-20 17:32:33,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {1151#false} assume !false; {1151#false} is VALID [2022-02-20 17:32:33,430 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:33,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:32:33,590 INFO L290 TraceCheckUtils]: 35: Hoare triple {1151#false} assume !false; {1151#false} is VALID [2022-02-20 17:32:33,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {1257#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1151#false} is VALID [2022-02-20 17:32:33,593 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:33,596 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:33,606 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:33,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:33,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:33,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:33,607 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:33,608 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:33,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:33,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:33,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:33,608 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:33,609 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:33,610 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:33,611 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:33,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:33,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:33,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:33,611 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:33,611 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:33,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:33,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:33,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:33,612 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:33,612 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:33,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:33,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:33,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:33,613 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:33,613 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:33,613 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:33,613 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:33,613 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 <= 20 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:33,614 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:33,614 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:33,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:33,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191536715] [2022-02-20 17:32:33,614 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:32:33,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385601467] [2022-02-20 17:32:33,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385601467] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:32:33,614 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:32:33,614 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:32:33,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284819522] [2022-02-20 17:32:33,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:33,615 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:33,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:33,616 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:33,628 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:33,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:33,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:33,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:33,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:32:33,629 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:35,938 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:37,941 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:38,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:38,082 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-02-20 17:32:38,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:32:38,082 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:38,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:38,083 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:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 17:32:38,084 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:38,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 17:32:38,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-02-20 17:32:38,121 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:38,122 INFO L225 Difference]: With dead ends: 61 [2022-02-20 17:32:38,122 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 17:32:38,122 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:38,123 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:32:38,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 92 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-02-20 17:32:38,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 17:32:38,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-02-20 17:32:38,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:38,132 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:38,133 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:38,133 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:38,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:38,135 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-02-20 17:32:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-02-20 17:32:38,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:38,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:38,136 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:38,136 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:38,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:38,144 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-02-20 17:32:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-02-20 17:32:38,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:38,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:38,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:38,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:38,145 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:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2022-02-20 17:32:38,147 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 36 [2022-02-20 17:32:38,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:38,147 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2022-02-20 17:32:38,148 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:38,148 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-02-20 17:32:38,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 17:32:38,150 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:38,151 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:38,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:32:38,361 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:38,362 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:38,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:38,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1034157389, now seen corresponding path program 1 times [2022-02-20 17:32:38,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:38,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102987151] [2022-02-20 17:32:38,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:38,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:38,376 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:38,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [520064245] [2022-02-20 17:32:38,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:38,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:38,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:38,391 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:38,396 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:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:38,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 17:32:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:38,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:32:38,895 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:38,895 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 <= 20 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:38,896 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:38,896 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:38,896 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:38,897 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:38,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:38,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:38,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:38,898 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:38,898 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:38,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:38,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:38,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:38,899 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:38,899 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:38,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:38,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:38,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:38,900 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:38,901 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:38,901 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:38,901 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:38,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:38,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:38,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:38,902 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:38,902 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:38,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:38,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:38,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:38,904 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:38,904 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:38,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:38,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:38,904 INFO L290 TraceCheckUtils]: 35: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:38,905 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:38,905 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:38,906 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:38,906 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:38,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:38,906 INFO L290 TraceCheckUtils]: 41: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:38,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:38,911 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:38,911 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:38,912 INFO L290 TraceCheckUtils]: 45: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:38,912 INFO L290 TraceCheckUtils]: 46: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:38,912 INFO L290 TraceCheckUtils]: 47: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:38,913 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:38,913 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:38,914 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:38,914 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:38,915 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:38,915 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:38,916 INFO L290 TraceCheckUtils]: 54: Hoare triple {1822#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1655#false} is VALID [2022-02-20 17:32:38,916 INFO L290 TraceCheckUtils]: 55: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-02-20 17:32:38,916 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:38,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:32:44,796 INFO L290 TraceCheckUtils]: 55: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-02-20 17:32:44,796 INFO L290 TraceCheckUtils]: 54: Hoare triple {1822#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1655#false} is VALID [2022-02-20 17:32:44,797 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:44,797 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:44,798 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:44,806 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:44,818 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:44,819 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:44,819 INFO L290 TraceCheckUtils]: 47: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:44,819 INFO L290 TraceCheckUtils]: 46: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:44,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:44,819 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:44,820 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:44,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:44,820 INFO L290 TraceCheckUtils]: 41: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:44,820 INFO L290 TraceCheckUtils]: 40: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:44,820 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:44,821 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:44,822 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:44,823 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:44,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:44,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:44,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:44,823 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:44,824 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:44,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:44,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:44,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:44,825 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:44,825 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:44,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:44,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:44,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:44,826 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:44,827 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:44,838 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:44,839 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:44,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:44,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:44,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:44,839 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:44,840 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:44,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:44,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:44,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:44,840 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:44,842 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:44,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:44,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:44,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:44,842 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:44,843 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:44,843 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:44,843 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:44,843 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 <= 20 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:44,843 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:44,844 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:44,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:44,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102987151] [2022-02-20 17:32:44,844 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:32:44,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520064245] [2022-02-20 17:32:44,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520064245] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:32:44,844 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:32:44,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-02-20 17:32:44,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528321128] [2022-02-20 17:32:44,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:32:44,845 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:44,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:44,845 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:44,929 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:44,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:32:44,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:44,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:32:44,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:32:44,930 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:50,358 WARN L228 SmtUtils]: Spent 5.18s on a formula simplification. DAG size of input: 54 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-20 17:32:54,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:32:56,502 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:58,959 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,484 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:07,698 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:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:08,061 INFO L93 Difference]: Finished difference Result 146 states and 202 transitions. [2022-02-20 17:33:08,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:33:08,062 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:08,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:08,063 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:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-02-20 17:33:08,066 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:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-02-20 17:33:08,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 133 transitions. [2022-02-20 17:33:08,264 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:08,267 INFO L225 Difference]: With dead ends: 146 [2022-02-20 17:33:08,267 INFO L226 Difference]: Without dead ends: 117 [2022-02-20 17:33:08,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:33:08,268 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 36 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 72 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s 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, 11.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:33:08,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 210 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 220 Invalid, 5 Unknown, 0 Unchecked, 11.1s Time] [2022-02-20 17:33:08,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-20 17:33:08,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2022-02-20 17:33:08,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:08,308 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:08,309 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:08,309 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:08,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:08,315 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2022-02-20 17:33:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2022-02-20 17:33:08,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:08,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:08,316 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:08,317 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:08,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:08,322 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2022-02-20 17:33:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2022-02-20 17:33:08,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:08,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:08,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:08,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:08,323 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:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2022-02-20 17:33:08,327 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 56 [2022-02-20 17:33:08,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:08,327 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2022-02-20 17:33:08,327 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:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2022-02-20 17:33:08,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 17:33:08,328 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:08,328 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:08,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:33:08,535 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:08,535 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:08,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:08,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1199454569, now seen corresponding path program 1 times [2022-02-20 17:33:08,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:33:08,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742218868] [2022-02-20 17:33:08,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:33:08,550 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:33:08,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1030074210] [2022-02-20 17:33:08,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:08,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:08,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:08,552 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:08,553 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:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:08,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-20 17:33:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:08,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:09,256 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:09,256 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 <= 20 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:09,256 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:09,257 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:09,257 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:09,257 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:09,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:09,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:09,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:09,258 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:09,258 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:09,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:09,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:09,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:09,259 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:09,259 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:09,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:09,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:09,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:09,260 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:09,260 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:09,261 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:09,261 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:09,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:09,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:09,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:09,261 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:09,261 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:09,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:09,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:09,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:09,262 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:09,262 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:09,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:09,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:09,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:09,263 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:09,264 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:09,264 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:09,265 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:09,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:09,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:09,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:09,265 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:09,266 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:09,266 INFO L290 TraceCheckUtils]: 45: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:09,266 INFO L290 TraceCheckUtils]: 46: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:09,266 INFO L290 TraceCheckUtils]: 47: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:09,267 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:09,267 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:09,268 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:09,268 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:09,269 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:09,269 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:09,269 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:09,270 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:09,270 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:09,270 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:09,271 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:09,271 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:09,271 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:09,272 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:09,273 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:09,273 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:09,274 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:09,276 INFO L290 TraceCheckUtils]: 65: Hoare triple {2804#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2599#false} is VALID [2022-02-20 17:33:09,276 INFO L290 TraceCheckUtils]: 66: Hoare triple {2599#false} assume !false; {2599#false} is VALID [2022-02-20 17:33:09,277 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:09,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:33:25,782 INFO L290 TraceCheckUtils]: 66: Hoare triple {2599#false} assume !false; {2599#false} is VALID [2022-02-20 17:33:25,782 INFO L290 TraceCheckUtils]: 65: Hoare triple {2804#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2599#false} is VALID [2022-02-20 17:33:25,783 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:25,783 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:25,784 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:25,784 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:25,785 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:25,785 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:25,785 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:25,785 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:25,787 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:25,788 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:25,788 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:25,788 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:25,788 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:25,788 INFO L290 TraceCheckUtils]: 51: Hoare triple {2598#true} assume !false; {2598#true} is VALID [2022-02-20 17:33:25,788 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:25,788 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:25,788 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2598#true} {2598#true} #80#return; {2598#true} is VALID [2022-02-20 17:33:25,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:25,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:25,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:25,789 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:25,789 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2598#true} {2598#true} #78#return; {2598#true} is VALID [2022-02-20 17:33:25,789 INFO L290 TraceCheckUtils]: 42: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:25,789 INFO L290 TraceCheckUtils]: 41: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:25,789 INFO L290 TraceCheckUtils]: 40: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:25,789 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:25,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {2598#true} assume !false; {2598#true} is VALID [2022-02-20 17:33:25,789 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:25,789 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2598#true} {2598#true} #76#return; {2598#true} is VALID [2022-02-20 17:33:25,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:25,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:25,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:25,790 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:25,790 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2598#true} {2598#true} #74#return; {2598#true} is VALID [2022-02-20 17:33:25,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:25,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:25,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:25,790 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:25,791 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2598#true} {2598#true} #72#return; {2598#true} is VALID [2022-02-20 17:33:25,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:25,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:25,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:25,791 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:25,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {2598#true} assume !false; {2598#true} is VALID [2022-02-20 17:33:25,791 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:25,791 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2598#true} {2598#true} #76#return; {2598#true} is VALID [2022-02-20 17:33:25,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:25,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:25,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:25,792 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:25,792 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2598#true} {2598#true} #74#return; {2598#true} is VALID [2022-02-20 17:33:25,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:25,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:25,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:25,792 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:25,793 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2598#true} {2598#true} #72#return; {2598#true} is VALID [2022-02-20 17:33:25,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:25,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:25,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:25,793 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:25,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {2598#true} assume !false; {2598#true} is VALID [2022-02-20 17:33:25,793 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:25,793 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:25,794 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 <= 20 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:25,794 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:25,794 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:25,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:33:25,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742218868] [2022-02-20 17:33:25,794 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:33:25,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030074210] [2022-02-20 17:33:25,795 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030074210] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:33:25,795 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:33:25,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-02-20 17:33:25,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170813934] [2022-02-20 17:33:25,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:33:25,795 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:25,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:33:25,796 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:25,853 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:25,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 17:33:25,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:33:25,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 17:33:25,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:33:25,854 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:26,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:26,923 INFO L93 Difference]: Finished difference Result 161 states and 211 transitions. [2022-02-20 17:33:26,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:33:26,923 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:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:26,924 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:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 106 transitions. [2022-02-20 17:33:26,926 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:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 106 transitions. [2022-02-20 17:33:26,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 106 transitions. [2022-02-20 17:33:27,036 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:27,044 INFO L225 Difference]: With dead ends: 161 [2022-02-20 17:33:27,044 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 17:33:27,045 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:27,045 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:27,046 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:27,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 17:33:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2022-02-20 17:33:27,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:27,065 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:27,066 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:27,066 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:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:27,068 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2022-02-20 17:33:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2022-02-20 17:33:27,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:27,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:27,069 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:27,070 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:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:27,072 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2022-02-20 17:33:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2022-02-20 17:33:27,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:27,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:27,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:27,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:27,074 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:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2022-02-20 17:33:27,077 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 67 [2022-02-20 17:33:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:27,077 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2022-02-20 17:33:27,077 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:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2022-02-20 17:33:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 17:33:27,079 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:27,079 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:27,095 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:27,295 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:27,296 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:27,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:27,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1842513023, now seen corresponding path program 1 times [2022-02-20 17:33:27,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:33:27,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115174143] [2022-02-20 17:33:27,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:27,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:33:27,307 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:33:27,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [216387135] [2022-02-20 17:33:27,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:27,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:27,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:27,311 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:27,328 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:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:27,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 17:33:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:27,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:29,422 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:29,422 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 <= 20 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:29,422 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:29,422 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:29,423 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:29,423 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:29,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:29,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:29,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:29,423 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:29,423 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:29,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:29,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:29,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:29,424 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:29,424 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:29,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:29,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:29,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:29,425 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:29,425 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:29,425 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:29,425 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:29,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:29,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:29,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:29,426 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:29,426 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:29,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:29,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:29,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:29,427 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:29,427 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:29,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:29,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:29,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:29,427 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:29,428 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:29,428 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:29,428 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:29,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:29,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:29,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:29,429 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:29,429 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:29,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:29,429 INFO L290 TraceCheckUtils]: 46: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:29,429 INFO L290 TraceCheckUtils]: 47: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:29,429 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:29,430 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:29,430 INFO L290 TraceCheckUtils]: 50: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:29,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:29,430 INFO L290 TraceCheckUtils]: 52: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:29,430 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:29,430 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:29,431 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:29,431 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:29,431 INFO L290 TraceCheckUtils]: 57: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:29,431 INFO L290 TraceCheckUtils]: 58: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:29,431 INFO L290 TraceCheckUtils]: 59: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:29,431 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:29,432 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:29,432 INFO L290 TraceCheckUtils]: 62: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:29,432 INFO L290 TraceCheckUtils]: 63: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:29,432 INFO L290 TraceCheckUtils]: 64: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:29,432 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:29,433 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:29,433 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:29,433 INFO L290 TraceCheckUtils]: 68: Hoare triple {3593#false} ~cond := #in~cond; {3593#false} is VALID [2022-02-20 17:33:29,433 INFO L290 TraceCheckUtils]: 69: Hoare triple {3593#false} assume !(0 == ~cond); {3593#false} is VALID [2022-02-20 17:33:29,433 INFO L290 TraceCheckUtils]: 70: Hoare triple {3593#false} assume true; {3593#false} is VALID [2022-02-20 17:33:29,433 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3593#false} {3593#false} #82#return; {3593#false} is VALID [2022-02-20 17:33:29,433 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:29,434 INFO L290 TraceCheckUtils]: 73: Hoare triple {3593#false} ~cond := #in~cond; {3593#false} is VALID [2022-02-20 17:33:29,434 INFO L290 TraceCheckUtils]: 74: Hoare triple {3593#false} assume 0 == ~cond; {3593#false} is VALID [2022-02-20 17:33:29,434 INFO L290 TraceCheckUtils]: 75: Hoare triple {3593#false} assume !false; {3593#false} is VALID [2022-02-20 17:33:29,434 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:29,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:33:29,434 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:33:29,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115174143] [2022-02-20 17:33:29,435 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:33:29,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216387135] [2022-02-20 17:33:29,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216387135] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:33:29,435 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:33:29,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:33:29,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797241606] [2022-02-20 17:33:29,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:33:29,437 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:29,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:33:29,437 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:29,468 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:29,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:33:29,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:33:29,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:33:29,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:33:29,469 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:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:29,636 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2022-02-20 17:33:29,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:33:29,636 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:29,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:29,637 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:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 17:33:29,638 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:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 17:33:29,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-02-20 17:33:29,692 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:29,693 INFO L225 Difference]: With dead ends: 107 [2022-02-20 17:33:29,693 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 17:33:29,694 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:29,694 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:33:29,694 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.1s Time] [2022-02-20 17:33:29,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 17:33:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-02-20 17:33:29,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:29,727 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:29,727 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:29,727 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:29,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:29,729 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-02-20 17:33:29,729 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-02-20 17:33:29,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:29,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:29,731 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:29,731 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:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:29,734 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-02-20 17:33:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-02-20 17:33:29,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:29,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:29,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:29,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:29,735 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:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2022-02-20 17:33:29,736 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 76 [2022-02-20 17:33:29,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:29,736 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2022-02-20 17:33:29,737 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:29,737 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-02-20 17:33:29,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-20 17:33:29,738 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:29,738 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:29,754 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:29,951 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:29,952 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1412721000, now seen corresponding path program 1 times [2022-02-20 17:33:29,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:33:29,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71017290] [2022-02-20 17:33:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:29,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:33:29,962 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:33:29,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [263629532] [2022-02-20 17:33:29,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:29,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:29,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:29,963 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:29,964 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:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:30,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 17:33:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:30,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:31,644 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:31,644 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 <= 20 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:31,644 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:31,645 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:31,645 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:31,645 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:31,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:31,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:31,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:31,646 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:31,646 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:31,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:31,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:31,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:31,646 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:31,647 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:31,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:31,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:31,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:31,647 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:31,648 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:31,648 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:31,648 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:31,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:31,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:31,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:31,649 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:31,649 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:31,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:31,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:31,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:31,656 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:31,656 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:31,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:31,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:31,656 INFO L290 TraceCheckUtils]: 35: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:31,657 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:31,658 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:31,658 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:31,658 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:31,658 INFO L290 TraceCheckUtils]: 40: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:31,658 INFO L290 TraceCheckUtils]: 41: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:31,659 INFO L290 TraceCheckUtils]: 42: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:31,659 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:31,659 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:31,659 INFO L290 TraceCheckUtils]: 45: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:31,659 INFO L290 TraceCheckUtils]: 46: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:31,659 INFO L290 TraceCheckUtils]: 47: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:31,660 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:31,660 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:31,660 INFO L290 TraceCheckUtils]: 50: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:31,660 INFO L290 TraceCheckUtils]: 51: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:31,660 INFO L290 TraceCheckUtils]: 52: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:31,660 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:31,661 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:31,661 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:31,661 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:31,661 INFO L290 TraceCheckUtils]: 57: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:31,661 INFO L290 TraceCheckUtils]: 58: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:31,661 INFO L290 TraceCheckUtils]: 59: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:31,662 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:31,662 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:31,662 INFO L290 TraceCheckUtils]: 62: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:31,662 INFO L290 TraceCheckUtils]: 63: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:31,662 INFO L290 TraceCheckUtils]: 64: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:31,662 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:31,663 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:31,664 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:31,664 INFO L290 TraceCheckUtils]: 68: Hoare triple {4295#false} assume !false; {4295#false} is VALID [2022-02-20 17:33:31,664 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:31,664 INFO L290 TraceCheckUtils]: 70: Hoare triple {4295#false} ~cond := #in~cond; {4295#false} is VALID [2022-02-20 17:33:31,664 INFO L290 TraceCheckUtils]: 71: Hoare triple {4295#false} assume !(0 == ~cond); {4295#false} is VALID [2022-02-20 17:33:31,664 INFO L290 TraceCheckUtils]: 72: Hoare triple {4295#false} assume true; {4295#false} is VALID [2022-02-20 17:33:31,664 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4295#false} {4295#false} #78#return; {4295#false} is VALID [2022-02-20 17:33:31,664 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:31,664 INFO L290 TraceCheckUtils]: 75: Hoare triple {4295#false} ~cond := #in~cond; {4295#false} is VALID [2022-02-20 17:33:31,664 INFO L290 TraceCheckUtils]: 76: Hoare triple {4295#false} assume !(0 == ~cond); {4295#false} is VALID [2022-02-20 17:33:31,664 INFO L290 TraceCheckUtils]: 77: Hoare triple {4295#false} assume true; {4295#false} is VALID [2022-02-20 17:33:31,664 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4295#false} {4295#false} #80#return; {4295#false} is VALID [2022-02-20 17:33:31,664 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:31,664 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:31,664 INFO L290 TraceCheckUtils]: 81: Hoare triple {4295#false} assume !false; {4295#false} is VALID [2022-02-20 17:33:31,665 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:31,665 INFO L290 TraceCheckUtils]: 83: Hoare triple {4295#false} ~cond := #in~cond; {4295#false} is VALID [2022-02-20 17:33:31,665 INFO L290 TraceCheckUtils]: 84: Hoare triple {4295#false} assume 0 == ~cond; {4295#false} is VALID [2022-02-20 17:33:31,665 INFO L290 TraceCheckUtils]: 85: Hoare triple {4295#false} assume !false; {4295#false} is VALID [2022-02-20 17:33:31,665 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:31,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:33:31,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:33:31,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71017290] [2022-02-20 17:33:31,665 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:33:31,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263629532] [2022-02-20 17:33:31,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263629532] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:33:31,666 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:33:31,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:33:31,666 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454956952] [2022-02-20 17:33:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:33:31,666 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:31,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:33:31,667 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:31,703 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:31,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:33:31,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:33:31,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:33:31,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:33:31,704 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:32,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:32,032 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2022-02-20 17:33:32,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:33:32,032 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:32,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:32,032 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:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-02-20 17:33:32,033 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:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-02-20 17:33:32,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2022-02-20 17:33:32,114 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:32,115 INFO L225 Difference]: With dead ends: 131 [2022-02-20 17:33:32,116 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 17:33:32,116 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:32,116 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:33:32,116 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.0s Time] [2022-02-20 17:33:32,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 17:33:32,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2022-02-20 17:33:32,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:32,157 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:32,158 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:32,158 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:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:32,160 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-02-20 17:33:32,160 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2022-02-20 17:33:32,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:32,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:32,160 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:32,160 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:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:32,162 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-02-20 17:33:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2022-02-20 17:33:32,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:32,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:32,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:32,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:32,163 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:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2022-02-20 17:33:32,164 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 86 [2022-02-20 17:33:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:32,165 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2022-02-20 17:33:32,165 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:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2022-02-20 17:33:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-20 17:33:32,165 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:32,166 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:32,181 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:32,379 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:32,380 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:32,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:32,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1193302554, now seen corresponding path program 2 times [2022-02-20 17:33:32,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:33:32,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653828753] [2022-02-20 17:33:32,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:32,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:33:32,398 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:33:32,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [415879661] [2022-02-20 17:33:32,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:33:32,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:32,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:32,399 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:32,400 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:32,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:33:32,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:33:32,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 39 conjunts are in the unsatisfiable core [2022-02-20 17:33:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:32,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:33,184 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:33,185 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 <= 20 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:33,185 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:33,185 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:33,186 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:33,186 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:33,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:33,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:33,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:33,186 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:33,186 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:33,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:33,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:33,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:33,187 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:33,187 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:33,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:33,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:33,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:33,188 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:33,188 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:33,189 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:33,189 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:33,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:33,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:33,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:33,189 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:33,189 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:33,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:33,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:33,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:33,190 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:33,190 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:33,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:33,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:33,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:33,191 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:33,191 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:33,191 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:33,191 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:33,192 INFO L290 TraceCheckUtils]: 40: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:33,192 INFO L290 TraceCheckUtils]: 41: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:33,192 INFO L290 TraceCheckUtils]: 42: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:33,192 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:33,192 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:33,192 INFO L290 TraceCheckUtils]: 45: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:33,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:33,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:33,193 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:33,193 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:33,193 INFO L290 TraceCheckUtils]: 50: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:33,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:33,193 INFO L290 TraceCheckUtils]: 52: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:33,194 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:33,194 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:33,195 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:33,195 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:33,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:33,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:33,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:33,195 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:33,196 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:33,196 INFO L290 TraceCheckUtils]: 62: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:33,196 INFO L290 TraceCheckUtils]: 63: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:33,196 INFO L290 TraceCheckUtils]: 64: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:33,197 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:33,198 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:33,198 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:33,199 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:33,199 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:33,199 INFO L290 TraceCheckUtils]: 70: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:33,199 INFO L290 TraceCheckUtils]: 71: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:33,199 INFO L290 TraceCheckUtils]: 72: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:33,201 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:33,201 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:33,201 INFO L290 TraceCheckUtils]: 75: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:33,201 INFO L290 TraceCheckUtils]: 76: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:33,201 INFO L290 TraceCheckUtils]: 77: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:33,201 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:33,202 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:33,203 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:33,204 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:33,204 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:33,205 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:33,205 INFO L290 TraceCheckUtils]: 84: Hoare triple {5317#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5055#false} is VALID [2022-02-20 17:33:33,205 INFO L290 TraceCheckUtils]: 85: Hoare triple {5055#false} assume !false; {5055#false} is VALID [2022-02-20 17:33:33,205 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:33,205 INFO L328 TraceCheckSpWp]: Computing backward predicates...