./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound5.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_valuebound5.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 a077c1334c11d8329da2d0c58ca917b2036581fa7e949d1d304e3346ec54a811 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:32:29,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:32:29,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:32:29,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:32:29,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:32:29,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:32:29,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:32:29,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:32:29,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:32:29,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:32:29,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:32:29,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:32:29,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:32:29,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:32:29,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:32:29,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:32:29,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:32:29,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:32:29,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:32:29,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:32:29,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:32:29,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:32:29,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:32:29,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:32:29,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:32:29,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:32:29,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:32:29,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:32:29,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:32:29,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:32:29,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:32:29,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:32:29,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:32:29,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:32:29,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:32:29,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:32:29,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:32:29,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:32:29,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:32:29,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:32:29,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:32:29,659 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,673 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:32:29,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:32:29,674 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:32:29,674 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:32:29,675 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:32:29,675 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:32:29,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:32:29,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:32:29,676 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:32:29,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:32:29,676 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:32:29,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:32:29,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:32:29,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:32:29,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:32:29,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:32:29,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:32:29,678 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:32:29,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:32:29,678 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:32:29,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:32:29,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:32:29,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:32:29,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:32:29,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:32:29,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:32:29,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:32:29,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:32:29,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:32:29,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:32:29,680 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:32:29,680 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:32:29,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:32:29,681 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 -> a077c1334c11d8329da2d0c58ca917b2036581fa7e949d1d304e3346ec54a811 [2022-02-20 17:32:29,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:32:29,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:32:29,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:32:29,881 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:32:29,881 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:32:29,882 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound5.c [2022-02-20 17:32:29,924 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/245e3bd5c/e4c45986c360456990ca4bb8d37f303d/FLAG90bed32ea [2022-02-20 17:32:30,268 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:32:30,268 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound5.c [2022-02-20 17:32:30,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/245e3bd5c/e4c45986c360456990ca4bb8d37f303d/FLAG90bed32ea [2022-02-20 17:32:30,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/245e3bd5c/e4c45986c360456990ca4bb8d37f303d [2022-02-20 17:32:30,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:32:30,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:32:30,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:32:30,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:32:30,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:32:30,734 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,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb2a1c3 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,736 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,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:32:30,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:32:30,859 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_valuebound5.c[526,539] [2022-02-20 17:32:30,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:32:30,891 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:32:30,901 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_valuebound5.c[526,539] [2022-02-20 17:32:30,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:32:30,922 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:32:30,922 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,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:32:30,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:32:30,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:32:30,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:32:30,928 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,933 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,947 INFO L137 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2022-02-20 17:32:30,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:32:30,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:32:30,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:32:30,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:32:30,954 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,954 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,962 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,963 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,973 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,975 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,976 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,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:32:30,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:32:30,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:32:30,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:32:30,984 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,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:32:30,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:31,004 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:31,006 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:31,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:32:31,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:32:31,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:32:31,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:32:31,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:32:31,027 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:32:31,077 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:32:31,078 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:32:31,190 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:32:31,195 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:32:31,195 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:32:31,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:32:31 BoogieIcfgContainer [2022-02-20 17:32:31,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:32:31,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:32:31,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:32:31,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:32:31,201 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:31,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75eeec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:32:31, skipping insertion in model container [2022-02-20 17:32:31,201 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:31,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75eeec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:32:31, skipping insertion in model container [2022-02-20 17:32:31,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:32:31" (3/3) ... [2022-02-20 17:32:31,203 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_valuebound5.c [2022-02-20 17:32:31,206 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:32:31,207 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:32:31,235 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:32:31,239 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:31,240 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:32:31,271 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:31,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:32:31,287 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:31,288 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:31,288 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash -586848446, now seen corresponding path program 1 times [2022-02-20 17:32:31,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:31,299 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623255893] [2022-02-20 17:32:31,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:31,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:31,425 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:31,426 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 <= 5 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:31,427 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:31,427 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:31,427 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:32:31,427 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:31,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-02-20 17:32:31,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-02-20 17:32:31,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:32:31,430 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,430 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:31,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623255893] [2022-02-20 17:32:31,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623255893] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:31,432 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:31,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:32:31,434 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466644924] [2022-02-20 17:32:31,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:31,438 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:31,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:31,443 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:31,463 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,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:32:31,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:31,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:32:31,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:32:31,491 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:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:31,575 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. [2022-02-20 17:32:31,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:32:31,576 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:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:31,577 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:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2022-02-20 17:32:31,588 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:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2022-02-20 17:32:31,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 83 transitions. [2022-02-20 17:32:31,692 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,701 INFO L225 Difference]: With dead ends: 49 [2022-02-20 17:32:31,701 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:32:31,703 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,706 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,707 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,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:32:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:32:31,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:31,732 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,733 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,734 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,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:31,739 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-02-20 17:32:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-20 17:32:31,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:31,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:31,741 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,742 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,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:31,746 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-02-20 17:32:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-20 17:32:31,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:31,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:31,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:31,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:31,749 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,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-02-20 17:32:31,757 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 9 [2022-02-20 17:32:31,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:31,757 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-02-20 17:32:31,757 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,758 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-20 17:32:31,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:32:31,759 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:31,759 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:31,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:32:31,759 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:31,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1188158916, now seen corresponding path program 1 times [2022-02-20 17:32:31,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:31,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790182323] [2022-02-20 17:32:31,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:31,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:31,861 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,862 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 <= 5 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,862 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,863 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,864 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,865 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,868 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,868 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,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#false} assume !false; {178#false} is VALID [2022-02-20 17:32:31,868 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,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:31,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790182323] [2022-02-20 17:32:31,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790182323] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:31,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:31,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:32:31,872 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489970540] [2022-02-20 17:32:31,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:31,873 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,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:31,874 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,881 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,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:31,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:31,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:31,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:32:31,883 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,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:31,992 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-02-20 17:32:31,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:32:31,993 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,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:31,993 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,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 17:32:31,997 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,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 17:32:31,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-02-20 17:32:32,035 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,036 INFO L225 Difference]: With dead ends: 35 [2022-02-20 17:32:32,037 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 17:32:32,037 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:32,038 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:32,038 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:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 17:32:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2022-02-20 17:32:32,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:32,042 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:32,042 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:32,042 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:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,044 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-02-20 17:32:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-02-20 17:32:32,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:32,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:32,045 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:32,045 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:32,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,047 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-02-20 17:32:32,047 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-02-20 17:32:32,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:32,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:32,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:32,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:32,048 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:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-02-20 17:32:32,050 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2022-02-20 17:32:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:32,050 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-02-20 17:32:32,050 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:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-02-20 17:32:32,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 17:32:32,051 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:32,051 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:32,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:32:32,051 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:32,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:32,052 INFO L85 PathProgramCache]: Analyzing trace with hash -697944935, now seen corresponding path program 1 times [2022-02-20 17:32:32,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:32,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804425248] [2022-02-20 17:32:32,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:32,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:32,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-20 17:32:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:32,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} ~cond := #in~cond; {337#true} is VALID [2022-02-20 17:32:32,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume !(0 == ~cond); {337#true} is VALID [2022-02-20 17:32:32,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 17:32:32,102 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:32,102 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:32,102 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 <= 5 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:32,102 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:32,103 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:32,104 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:32,104 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:32,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {337#true} ~cond := #in~cond; {337#true} is VALID [2022-02-20 17:32:32,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#true} assume !(0 == ~cond); {337#true} is VALID [2022-02-20 17:32:32,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#true} assume true; {337#true} is VALID [2022-02-20 17:32:32,105 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:32,106 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:32,106 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:32,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {345#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {338#false} is VALID [2022-02-20 17:32:32,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {338#false} assume !false; {338#false} is VALID [2022-02-20 17:32:32,107 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:32,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:32,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804425248] [2022-02-20 17:32:32,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804425248] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:32,109 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:32,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:32:32,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793784626] [2022-02-20 17:32:32,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:32,111 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:32,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:32,111 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:32,121 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:32,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:32,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:32,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:32,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:32:32,157 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:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,279 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-02-20 17:32:32,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:32:32,279 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:32,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:32,280 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:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 17:32:32,281 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:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-02-20 17:32:32,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-02-20 17:32:32,316 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,317 INFO L225 Difference]: With dead ends: 39 [2022-02-20 17:32:32,317 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 17:32:32,317 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:32,318 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:32,318 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:32,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 17:32:32,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-02-20 17:32:32,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:32,322 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:32,322 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:32,322 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:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,324 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-02-20 17:32:32,324 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-02-20 17:32:32,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:32,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:32,325 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:32,326 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:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,327 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-02-20 17:32:32,327 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-02-20 17:32:32,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:32,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:32,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:32,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:32,328 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:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 17:32:32,329 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2022-02-20 17:32:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:32,330 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 17:32:32,330 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:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 17:32:32,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:32:32,330 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:32,331 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:32,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:32:32,331 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:32,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:32,331 INFO L85 PathProgramCache]: Analyzing trace with hash 262992548, now seen corresponding path program 1 times [2022-02-20 17:32:32,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:32,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888880934] [2022-02-20 17:32:32,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:32,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:32,341 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:32,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [382498229] [2022-02-20 17:32:32,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:32,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:32,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:32,343 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:32,375 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:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:32,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:32:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:32,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:32:32,584 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,584 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 <= 5 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,585 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,585 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,586 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,586 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,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {519#true} ~cond := #in~cond; {519#true} is VALID [2022-02-20 17:32:32,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {519#true} assume !(0 == ~cond); {519#true} is VALID [2022-02-20 17:32:32,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 17:32:32,587 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,588 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,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {519#true} ~cond := #in~cond; {519#true} is VALID [2022-02-20 17:32:32,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {519#true} assume !(0 == ~cond); {519#true} is VALID [2022-02-20 17:32:32,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {519#true} assume true; {519#true} is VALID [2022-02-20 17:32:32,591 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,592 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,593 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,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {520#false} is VALID [2022-02-20 17:32:32,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {520#false} assume !false; {520#false} is VALID [2022-02-20 17:32:32,593 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,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:32:32,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:32,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888880934] [2022-02-20 17:32:32,594 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:32:32,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382498229] [2022-02-20 17:32:32,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382498229] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:32,595 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:32,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:32:32,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119112202] [2022-02-20 17:32:32,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:32,596 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,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:32,597 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,609 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,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:32,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:32,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:32,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:32:32,613 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,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,749 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-02-20 17:32:32,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:32:32,749 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,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:32,750 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,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 17:32:32,752 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,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 17:32:32,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-02-20 17:32:32,807 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,809 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:32:32,809 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:32:32,810 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,814 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,815 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,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:32:32,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 17:32:32,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:32,827 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,827 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,828 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,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,832 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-02-20 17:32:32,832 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-02-20 17:32:32,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:32,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:32,834 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,834 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,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:32,838 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-02-20 17:32:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-02-20 17:32:32,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:32,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:32,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:32,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:32,839 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,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2022-02-20 17:32:32,843 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 19 [2022-02-20 17:32:32,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:32,844 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2022-02-20 17:32:32,844 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,845 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2022-02-20 17:32:32,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:32:32,845 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:32,845 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,871 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:33,062 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:33,062 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:33,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:33,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1807142342, now seen corresponding path program 1 times [2022-02-20 17:32:33,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:33,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441284366] [2022-02-20 17:32:33,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:33,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:33,072 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:33,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [297336421] [2022-02-20 17:32:33,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:33,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:33,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:33,074 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:33,075 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:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:33,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:32:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:33,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:32:33,290 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:33,291 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 <= 5 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:33,291 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:33,293 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:33,293 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:33,293 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:33,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {816#true} ~cond := #in~cond; {816#true} is VALID [2022-02-20 17:32:33,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {816#true} assume !(0 == ~cond); {816#true} is VALID [2022-02-20 17:32:33,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {816#true} assume true; {816#true} is VALID [2022-02-20 17:32:33,294 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:33,294 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:33,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {816#true} ~cond := #in~cond; {816#true} is VALID [2022-02-20 17:32:33,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {816#true} assume !(0 == ~cond); {816#true} is VALID [2022-02-20 17:32:33,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#true} assume true; {816#true} is VALID [2022-02-20 17:32:33,296 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:33,296 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:33,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {816#true} ~cond := #in~cond; {816#true} is VALID [2022-02-20 17:32:33,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {816#true} assume !(0 == ~cond); {816#true} is VALID [2022-02-20 17:32:33,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {816#true} assume true; {816#true} is VALID [2022-02-20 17:32:33,297 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:33,297 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:33,298 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:33,298 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:33,299 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:33,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {892#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {817#false} is VALID [2022-02-20 17:32:33,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {817#false} assume !false; {817#false} is VALID [2022-02-20 17:32:33,300 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:33,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:32:33,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:33,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441284366] [2022-02-20 17:32:33,300 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:32:33,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297336421] [2022-02-20 17:32:33,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297336421] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:32:33,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:32:33,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:32:33,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764020012] [2022-02-20 17:32:33,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:33,301 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:33,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:33,302 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:33,317 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:33,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:33,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:33,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:33,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:32:33,318 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:33,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:33,440 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-02-20 17:32:33,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:32:33,440 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:33,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:33,441 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:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 17:32:33,442 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:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 17:32:33,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-02-20 17:32:33,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:33,480 INFO L225 Difference]: With dead ends: 57 [2022-02-20 17:32:33,480 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 17:32:33,480 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:33,481 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:33,481 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:33,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 17:32:33,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-02-20 17:32:33,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:33,487 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:33,487 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:33,487 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:33,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:33,489 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-02-20 17:32:33,489 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-20 17:32:33,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:33,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:33,490 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:33,490 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:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:33,491 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-02-20 17:32:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-20 17:32:33,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:33,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:33,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:33,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:33,492 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:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-02-20 17:32:33,494 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 26 [2022-02-20 17:32:33,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:33,495 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-02-20 17:32:33,495 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:33,495 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-02-20 17:32:33,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:32:33,496 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:33,496 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:33,513 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,703 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,706 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:33,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:33,707 INFO L85 PathProgramCache]: Analyzing trace with hash -979933353, now seen corresponding path program 1 times [2022-02-20 17:32:33,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:33,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320012204] [2022-02-20 17:32:33,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:33,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:33,716 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:33,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380945471] [2022-02-20 17:32:33,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:33,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:33,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:33,718 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,719 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,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:33,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 17:32:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:33,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:32:33,907 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,908 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 <= 5 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,908 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,908 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,909 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,909 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,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:33,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:33,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:33,910 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,910 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,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:33,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:33,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:33,911 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,911 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,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:33,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:33,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:33,912 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,913 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,913 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,914 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,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:33,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:33,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:33,916 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,916 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,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:33,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:33,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:33,917 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,917 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,918 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,918 INFO L290 TraceCheckUtils]: 34: Hoare triple {1257#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1151#false} is VALID [2022-02-20 17:32:33,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {1151#false} assume !false; {1151#false} is VALID [2022-02-20 17:32:33,919 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,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:32:34,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {1151#false} assume !false; {1151#false} is VALID [2022-02-20 17:32:34,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {1257#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1151#false} is VALID [2022-02-20 17:32:34,107 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:34,108 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:34,108 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:34,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:34,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:34,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:34,109 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:34,109 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:34,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:34,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:34,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:34,110 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:34,120 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:34,122 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:34,122 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:34,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:34,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:34,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:34,123 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:34,123 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:34,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:34,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:34,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:34,124 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:34,124 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:34,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {1150#true} assume true; {1150#true} is VALID [2022-02-20 17:32:34,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {1150#true} assume !(0 == ~cond); {1150#true} is VALID [2022-02-20 17:32:34,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {1150#true} ~cond := #in~cond; {1150#true} is VALID [2022-02-20 17:32:34,124 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:34,125 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:34,126 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:34,126 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:34,126 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 <= 5 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:34,126 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:34,126 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:34,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:34,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320012204] [2022-02-20 17:32:34,126 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:32:34,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380945471] [2022-02-20 17:32:34,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380945471] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:32:34,127 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:32:34,127 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:32:34,127 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882356041] [2022-02-20 17:32:34,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:32:34,127 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:34,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:34,128 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:34,141 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:34,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:32:34,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:34,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:32:34,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:32:34,142 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:34,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:34,549 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-02-20 17:32:34,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:32:34,549 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:34,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:34,550 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:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 17:32:34,552 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:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 17:32:34,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-02-20 17:32:34,585 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:34,587 INFO L225 Difference]: With dead ends: 61 [2022-02-20 17:32:34,587 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 17:32:34,587 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:34,587 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:32:34,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 90 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:32:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 17:32:34,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-02-20 17:32:34,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:34,595 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:34,596 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:34,596 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:34,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:34,598 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-02-20 17:32:34,598 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-02-20 17:32:34,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:34,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:34,600 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:34,601 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:34,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:34,602 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-02-20 17:32:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-02-20 17:32:34,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:34,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:34,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:34,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:34,604 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:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2022-02-20 17:32:34,607 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 36 [2022-02-20 17:32:34,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:34,607 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2022-02-20 17:32:34,608 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:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-02-20 17:32:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 17:32:34,610 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:34,610 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:34,627 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:34,826 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:34,827 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:34,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:34,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1034157389, now seen corresponding path program 1 times [2022-02-20 17:32:34,827 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:34,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832639574] [2022-02-20 17:32:34,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:34,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:34,842 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:34,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291481639] [2022-02-20 17:32:34,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:34,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:34,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:34,849 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:34,850 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:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:34,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 17:32:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:32:34,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:32:35,299 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:35,299 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 <= 5 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:35,299 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:35,300 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:35,300 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:35,300 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:35,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:35,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:35,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:35,301 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:35,302 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:35,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:35,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:35,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:35,302 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:35,303 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:35,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:35,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:35,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:35,304 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:35,304 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:35,305 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:35,305 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:35,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:35,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:35,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:35,306 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:35,306 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:35,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:35,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:35,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:35,307 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:35,307 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:35,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:35,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:35,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:35,310 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:35,311 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:35,311 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:35,311 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:35,311 INFO L290 TraceCheckUtils]: 40: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:35,311 INFO L290 TraceCheckUtils]: 41: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:35,312 INFO L290 TraceCheckUtils]: 42: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:35,312 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:35,312 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:35,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:35,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:35,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:35,316 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:35,317 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:35,317 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:35,317 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:35,318 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:35,318 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:35,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {1822#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1655#false} is VALID [2022-02-20 17:32:35,319 INFO L290 TraceCheckUtils]: 55: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-02-20 17:32:35,319 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:35,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:32:40,972 INFO L290 TraceCheckUtils]: 55: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-02-20 17:32:40,973 INFO L290 TraceCheckUtils]: 54: Hoare triple {1822#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1655#false} is VALID [2022-02-20 17:32:40,973 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:40,974 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:40,975 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:40,981 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:40,994 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:40,995 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:40,995 INFO L290 TraceCheckUtils]: 47: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:40,995 INFO L290 TraceCheckUtils]: 46: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:40,995 INFO L290 TraceCheckUtils]: 45: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:40,995 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:40,996 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:40,996 INFO L290 TraceCheckUtils]: 42: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:40,996 INFO L290 TraceCheckUtils]: 41: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:40,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:40,996 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:40,997 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:40,998 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:40,999 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:40,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:40,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:41,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:41,000 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:41,000 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:41,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:41,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:41,001 INFO L290 TraceCheckUtils]: 28: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:41,001 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:41,002 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:41,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:41,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:41,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:41,002 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:41,003 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:41,010 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:41,011 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:41,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:41,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:41,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:41,011 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:41,012 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:41,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:41,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:41,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:41,012 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:41,013 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:41,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-02-20 17:32:41,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-02-20 17:32:41,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-02-20 17:32:41,013 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:41,013 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:41,014 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:41,014 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:41,014 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 <= 5 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:41,014 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:41,015 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:41,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:32:41,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832639574] [2022-02-20 17:32:41,015 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:32:41,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291481639] [2022-02-20 17:32:41,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291481639] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:32:41,015 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:32:41,015 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-02-20 17:32:41,015 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416670363] [2022-02-20 17:32:41,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:32:41,016 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:41,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:32:41,016 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:41,099 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:41,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:32:41,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:32:41,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:32:41,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:32:41,100 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:47,695 WARN L228 SmtUtils]: Spent 6.34s 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:51,493 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:32:53,535 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:32:55,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:32:57,834 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:01,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:33:02,798 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:33:03,944 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:33:05,950 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:06,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:06,733 INFO L93 Difference]: Finished difference Result 146 states and 202 transitions. [2022-02-20 17:33:06,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:33:06,733 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:06,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:06,734 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:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-02-20 17:33:06,736 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:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-02-20 17:33:06,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 133 transitions. [2022-02-20 17:33:06,953 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:06,955 INFO L225 Difference]: With dead ends: 146 [2022-02-20 17:33:06,955 INFO L226 Difference]: Without dead ends: 117 [2022-02-20 17:33:06,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:33:06,956 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 36 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 72 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:33:06,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 210 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 223 Invalid, 3 Unknown, 0 Unchecked, 13.3s Time] [2022-02-20 17:33:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-20 17:33:07,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2022-02-20 17:33:07,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:07,005 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:07,005 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:07,005 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:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:07,012 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2022-02-20 17:33:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2022-02-20 17:33:07,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:07,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:07,014 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:07,014 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:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:07,019 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2022-02-20 17:33:07,019 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2022-02-20 17:33:07,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:07,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:07,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:07,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:07,020 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:07,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2022-02-20 17:33:07,024 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 56 [2022-02-20 17:33:07,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:07,024 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2022-02-20 17:33:07,024 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:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2022-02-20 17:33:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 17:33:07,025 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:07,025 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:07,041 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:07,239 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:07,239 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:07,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:07,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1199454569, now seen corresponding path program 1 times [2022-02-20 17:33:07,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:33:07,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553434198] [2022-02-20 17:33:07,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:07,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:33:07,258 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:33:07,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587023302] [2022-02-20 17:33:07,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:07,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:07,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:07,272 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:07,273 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:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:07,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-20 17:33:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:07,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:07,923 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:07,923 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 <= 5 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:07,924 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:07,924 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:07,924 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:07,925 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:07,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:07,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:07,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:07,926 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:07,926 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:07,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:07,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:07,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:07,927 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:07,927 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:07,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:07,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:07,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:07,928 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:07,928 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:07,929 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:07,929 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:07,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:07,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:07,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:07,930 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:07,930 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:07,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:07,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:07,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:07,931 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:07,931 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:07,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:07,932 INFO L290 TraceCheckUtils]: 34: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:07,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:07,932 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:07,933 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:07,933 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:07,933 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:07,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:07,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:07,934 INFO L290 TraceCheckUtils]: 42: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:07,935 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:07,935 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:07,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:07,935 INFO L290 TraceCheckUtils]: 46: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:07,935 INFO L290 TraceCheckUtils]: 47: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:07,936 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:07,936 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:07,937 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:07,937 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:07,938 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:07,938 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:07,938 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:07,939 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:07,939 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:07,940 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:07,940 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:07,940 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:07,940 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:07,941 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:07,942 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:07,942 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:07,943 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:07,943 INFO L290 TraceCheckUtils]: 65: Hoare triple {2804#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2599#false} is VALID [2022-02-20 17:33:07,943 INFO L290 TraceCheckUtils]: 66: Hoare triple {2599#false} assume !false; {2599#false} is VALID [2022-02-20 17:33:07,944 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:07,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:33:21,672 INFO L290 TraceCheckUtils]: 66: Hoare triple {2599#false} assume !false; {2599#false} is VALID [2022-02-20 17:33:21,673 INFO L290 TraceCheckUtils]: 65: Hoare triple {2804#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2599#false} is VALID [2022-02-20 17:33:21,673 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:21,674 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:21,674 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:21,675 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:21,675 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:21,675 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:21,675 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:21,676 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:21,677 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:21,678 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:21,678 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:21,678 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:21,678 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:21,679 INFO L290 TraceCheckUtils]: 51: Hoare triple {2598#true} assume !false; {2598#true} is VALID [2022-02-20 17:33:21,679 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:21,679 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:21,679 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2598#true} {2598#true} #80#return; {2598#true} is VALID [2022-02-20 17:33:21,679 INFO L290 TraceCheckUtils]: 47: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:21,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:21,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:21,679 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:21,680 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2598#true} {2598#true} #78#return; {2598#true} is VALID [2022-02-20 17:33:21,680 INFO L290 TraceCheckUtils]: 42: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:21,680 INFO L290 TraceCheckUtils]: 41: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:21,680 INFO L290 TraceCheckUtils]: 40: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:21,680 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:21,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {2598#true} assume !false; {2598#true} is VALID [2022-02-20 17:33:21,681 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:21,681 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2598#true} {2598#true} #76#return; {2598#true} is VALID [2022-02-20 17:33:21,681 INFO L290 TraceCheckUtils]: 35: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:21,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:21,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:21,682 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:21,682 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2598#true} {2598#true} #74#return; {2598#true} is VALID [2022-02-20 17:33:21,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:21,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:21,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:21,682 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:21,683 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2598#true} {2598#true} #72#return; {2598#true} is VALID [2022-02-20 17:33:21,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:21,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:21,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:21,691 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:21,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {2598#true} assume !false; {2598#true} is VALID [2022-02-20 17:33:21,694 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:21,694 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2598#true} {2598#true} #76#return; {2598#true} is VALID [2022-02-20 17:33:21,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:21,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:21,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:21,695 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:21,695 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2598#true} {2598#true} #74#return; {2598#true} is VALID [2022-02-20 17:33:21,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:21,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:21,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:21,697 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:21,697 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2598#true} {2598#true} #72#return; {2598#true} is VALID [2022-02-20 17:33:21,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 17:33:21,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {2598#true} assume !(0 == ~cond); {2598#true} is VALID [2022-02-20 17:33:21,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {2598#true} ~cond := #in~cond; {2598#true} is VALID [2022-02-20 17:33:21,698 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:21,698 INFO L290 TraceCheckUtils]: 4: Hoare triple {2598#true} assume !false; {2598#true} is VALID [2022-02-20 17:33:21,698 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:21,698 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:21,698 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 <= 5 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:21,698 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:21,699 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:21,699 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:33:21,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553434198] [2022-02-20 17:33:21,699 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:33:21,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587023302] [2022-02-20 17:33:21,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587023302] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:33:21,699 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:33:21,699 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-02-20 17:33:21,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759952720] [2022-02-20 17:33:21,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:33:21,703 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:21,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:33:21,703 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:21,751 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:21,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 17:33:21,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:33:21,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 17:33:21,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:33:21,752 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:22,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:22,807 INFO L93 Difference]: Finished difference Result 161 states and 211 transitions. [2022-02-20 17:33:22,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:33:22,807 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) Word has length 67 [2022-02-20 17:33:22,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:22,808 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:22,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 106 transitions. [2022-02-20 17:33:22,815 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:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 106 transitions. [2022-02-20 17:33:22,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 106 transitions. [2022-02-20 17:33:22,909 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:22,911 INFO L225 Difference]: With dead ends: 161 [2022-02-20 17:33:22,911 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 17:33:22,913 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:22,913 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:22,913 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:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 17:33:22,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2022-02-20 17:33:22,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:22,933 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:22,933 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:22,934 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:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:22,937 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2022-02-20 17:33:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2022-02-20 17:33:22,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:22,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:22,941 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:22,941 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:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:22,949 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2022-02-20 17:33:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2022-02-20 17:33:22,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:22,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:22,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:22,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:22,950 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:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2022-02-20 17:33:22,952 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 67 [2022-02-20 17:33:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:22,953 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2022-02-20 17:33:22,953 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:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2022-02-20 17:33:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 17:33:22,954 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:22,954 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:22,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:33:23,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:23,167 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:23,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:23,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1842513023, now seen corresponding path program 1 times [2022-02-20 17:33:23,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:33:23,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338490031] [2022-02-20 17:33:23,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:33:23,176 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:33:23,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1318028417] [2022-02-20 17:33:23,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:23,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:23,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:23,177 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:33:23,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 17:33:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:23,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 17:33:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:23,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:24,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {3592#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {3592#true} is VALID [2022-02-20 17:33:24,826 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 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3592#true} is VALID [2022-02-20 17:33:24,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {3592#true} assume !(0 == assume_abort_if_not_~cond#1); {3592#true} is VALID [2022-02-20 17:33:24,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {3592#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:33:24,827 INFO L290 TraceCheckUtils]: 4: Hoare triple {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} assume !false; {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:33:24,827 INFO L272 TraceCheckUtils]: 5: Hoare triple {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,829 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3592#true} {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} #72#return; {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:33:24,829 INFO L272 TraceCheckUtils]: 10: Hoare triple {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,829 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3592#true} {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} #74#return; {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:33:24,829 INFO L272 TraceCheckUtils]: 15: Hoare triple {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,830 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3592#true} {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} #76#return; {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} is VALID [2022-02-20 17:33:24,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {3606#(<= 1 |ULTIMATE.start_main_~p~0#1|)} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} is VALID [2022-02-20 17:33:24,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} assume !false; {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} is VALID [2022-02-20 17:33:24,831 INFO L272 TraceCheckUtils]: 22: Hoare triple {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,832 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3592#true} {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} #72#return; {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} is VALID [2022-02-20 17:33:24,832 INFO L272 TraceCheckUtils]: 27: Hoare triple {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,832 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3592#true} {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} #74#return; {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} is VALID [2022-02-20 17:33:24,832 INFO L272 TraceCheckUtils]: 32: Hoare triple {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,832 INFO L290 TraceCheckUtils]: 35: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,833 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3592#true} {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} #76#return; {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} is VALID [2022-02-20 17:33:24,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {3658#(<= 1 (div |ULTIMATE.start_main_~p~0#1| 2))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} assume !false; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,834 INFO L272 TraceCheckUtils]: 39: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,834 INFO L290 TraceCheckUtils]: 41: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,834 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3592#true} {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} #72#return; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,834 INFO L272 TraceCheckUtils]: 44: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,835 INFO L290 TraceCheckUtils]: 45: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,835 INFO L290 TraceCheckUtils]: 46: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,835 INFO L290 TraceCheckUtils]: 47: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,835 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3592#true} {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} #74#return; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,835 INFO L272 TraceCheckUtils]: 49: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,835 INFO L290 TraceCheckUtils]: 50: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,835 INFO L290 TraceCheckUtils]: 51: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,835 INFO L290 TraceCheckUtils]: 52: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,836 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3592#true} {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} #76#return; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,836 INFO L290 TraceCheckUtils]: 54: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} assume !(main_~r~0#1 >= main_~d~0#1); {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,836 INFO L290 TraceCheckUtils]: 55: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} assume !false; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,836 INFO L272 TraceCheckUtils]: 56: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,836 INFO L290 TraceCheckUtils]: 57: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,836 INFO L290 TraceCheckUtils]: 58: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,836 INFO L290 TraceCheckUtils]: 59: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,837 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3592#true} {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} #78#return; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,837 INFO L272 TraceCheckUtils]: 61: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {3592#true} is VALID [2022-02-20 17:33:24,837 INFO L290 TraceCheckUtils]: 62: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-02-20 17:33:24,837 INFO L290 TraceCheckUtils]: 63: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-02-20 17:33:24,837 INFO L290 TraceCheckUtils]: 64: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-02-20 17:33:24,840 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {3592#true} {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} #80#return; {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} is VALID [2022-02-20 17:33:24,842 INFO L290 TraceCheckUtils]: 66: Hoare triple {3710#(<= 1 (div (div |ULTIMATE.start_main_~p~0#1| 2) 2))} assume !(1 != main_~p~0#1); {3593#false} is VALID [2022-02-20 17:33:24,842 INFO L272 TraceCheckUtils]: 67: Hoare triple {3593#false} call __VERIFIER_assert((if main_~A~0#1 == main_~d~0#1 * main_~q~0#1 + main_~r~0#1 then 1 else 0)); {3593#false} is VALID [2022-02-20 17:33:24,842 INFO L290 TraceCheckUtils]: 68: Hoare triple {3593#false} ~cond := #in~cond; {3593#false} is VALID [2022-02-20 17:33:24,842 INFO L290 TraceCheckUtils]: 69: Hoare triple {3593#false} assume !(0 == ~cond); {3593#false} is VALID [2022-02-20 17:33:24,842 INFO L290 TraceCheckUtils]: 70: Hoare triple {3593#false} assume true; {3593#false} is VALID [2022-02-20 17:33:24,842 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3593#false} {3593#false} #82#return; {3593#false} is VALID [2022-02-20 17:33:24,842 INFO L272 TraceCheckUtils]: 72: Hoare triple {3593#false} call __VERIFIER_assert((if main_~B~0#1 == main_~d~0#1 then 1 else 0)); {3593#false} is VALID [2022-02-20 17:33:24,842 INFO L290 TraceCheckUtils]: 73: Hoare triple {3593#false} ~cond := #in~cond; {3593#false} is VALID [2022-02-20 17:33:24,842 INFO L290 TraceCheckUtils]: 74: Hoare triple {3593#false} assume 0 == ~cond; {3593#false} is VALID [2022-02-20 17:33:24,843 INFO L290 TraceCheckUtils]: 75: Hoare triple {3593#false} assume !false; {3593#false} is VALID [2022-02-20 17:33:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-02-20 17:33:24,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:33:24,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:33:24,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338490031] [2022-02-20 17:33:24,843 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:33:24,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318028417] [2022-02-20 17:33:24,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318028417] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:33:24,844 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:33:24,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:33:24,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491097727] [2022-02-20 17:33:24,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:33:24,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 76 [2022-02-20 17:33:24,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:33:24,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:33:24,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:24,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:33:24,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:33:24,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:33:24,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:33:24,887 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:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:25,024 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2022-02-20 17:33:25,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:33:25,024 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:25,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:25,025 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:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 17:33:25,026 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:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-02-20 17:33:25,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-02-20 17:33:25,076 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:25,078 INFO L225 Difference]: With dead ends: 107 [2022-02-20 17:33:25,078 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 17:33:25,078 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:25,079 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:33:25,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 71 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:33:25,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 17:33:25,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-02-20 17:33:25,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:25,116 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:25,117 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:25,117 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:25,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:25,119 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-02-20 17:33:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-02-20 17:33:25,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:25,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:25,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 95 states. [2022-02-20 17:33:25,120 INFO L87 Difference]: Start difference. First operand has 95 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 95 states. [2022-02-20 17:33:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:25,123 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-02-20 17:33:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-02-20 17:33:25,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:25,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:25,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:25,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:33:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2022-02-20 17:33:25,126 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 76 [2022-02-20 17:33:25,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:25,126 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2022-02-20 17:33:25,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 17:33:25,127 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-02-20 17:33:25,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-20 17:33:25,127 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:25,127 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:33:25,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-20 17:33:25,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:25,344 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:25,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:25,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1412721000, now seen corresponding path program 1 times [2022-02-20 17:33:25,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:33:25,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100155683] [2022-02-20 17:33:25,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:25,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:33:25,361 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:33:25,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1560303951] [2022-02-20 17:33:25,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:25,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:25,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:25,366 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:33:25,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 17:33:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:25,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 17:33:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:25,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:27,076 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:27,076 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 <= 5 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:27,076 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:27,076 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:27,077 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:27,077 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:27,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:27,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:27,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:27,077 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:27,078 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:27,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:27,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:27,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:27,078 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:27,078 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:27,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:27,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:27,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:27,079 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:27,080 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:27,080 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:27,080 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:27,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:27,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:27,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:27,081 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:27,081 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:27,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:27,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:27,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:27,083 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:27,083 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:27,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:27,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:27,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:27,084 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:27,085 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:27,085 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:27,085 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:27,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:27,086 INFO L290 TraceCheckUtils]: 41: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:27,086 INFO L290 TraceCheckUtils]: 42: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:27,086 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:27,086 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:27,086 INFO L290 TraceCheckUtils]: 45: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:27,086 INFO L290 TraceCheckUtils]: 46: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:27,086 INFO L290 TraceCheckUtils]: 47: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:27,087 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:27,087 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:27,087 INFO L290 TraceCheckUtils]: 50: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:27,087 INFO L290 TraceCheckUtils]: 51: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:27,087 INFO L290 TraceCheckUtils]: 52: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:27,088 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:27,088 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:27,088 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:27,088 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:27,089 INFO L290 TraceCheckUtils]: 57: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:27,089 INFO L290 TraceCheckUtils]: 58: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:27,089 INFO L290 TraceCheckUtils]: 59: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:27,089 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:27,089 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:27,089 INFO L290 TraceCheckUtils]: 62: Hoare triple {4294#true} ~cond := #in~cond; {4294#true} is VALID [2022-02-20 17:33:27,090 INFO L290 TraceCheckUtils]: 63: Hoare triple {4294#true} assume !(0 == ~cond); {4294#true} is VALID [2022-02-20 17:33:27,090 INFO L290 TraceCheckUtils]: 64: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-02-20 17:33:27,090 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:27,091 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:27,091 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:27,092 INFO L290 TraceCheckUtils]: 68: Hoare triple {4295#false} assume !false; {4295#false} is VALID [2022-02-20 17:33:27,092 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:27,092 INFO L290 TraceCheckUtils]: 70: Hoare triple {4295#false} ~cond := #in~cond; {4295#false} is VALID [2022-02-20 17:33:27,092 INFO L290 TraceCheckUtils]: 71: Hoare triple {4295#false} assume !(0 == ~cond); {4295#false} is VALID [2022-02-20 17:33:27,093 INFO L290 TraceCheckUtils]: 72: Hoare triple {4295#false} assume true; {4295#false} is VALID [2022-02-20 17:33:27,093 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4295#false} {4295#false} #78#return; {4295#false} is VALID [2022-02-20 17:33:27,093 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:27,093 INFO L290 TraceCheckUtils]: 75: Hoare triple {4295#false} ~cond := #in~cond; {4295#false} is VALID [2022-02-20 17:33:27,093 INFO L290 TraceCheckUtils]: 76: Hoare triple {4295#false} assume !(0 == ~cond); {4295#false} is VALID [2022-02-20 17:33:27,093 INFO L290 TraceCheckUtils]: 77: Hoare triple {4295#false} assume true; {4295#false} is VALID [2022-02-20 17:33:27,094 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4295#false} {4295#false} #80#return; {4295#false} is VALID [2022-02-20 17:33:27,094 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:27,094 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:27,094 INFO L290 TraceCheckUtils]: 81: Hoare triple {4295#false} assume !false; {4295#false} is VALID [2022-02-20 17:33:27,094 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:27,094 INFO L290 TraceCheckUtils]: 83: Hoare triple {4295#false} ~cond := #in~cond; {4295#false} is VALID [2022-02-20 17:33:27,094 INFO L290 TraceCheckUtils]: 84: Hoare triple {4295#false} assume 0 == ~cond; {4295#false} is VALID [2022-02-20 17:33:27,094 INFO L290 TraceCheckUtils]: 85: Hoare triple {4295#false} assume !false; {4295#false} is VALID [2022-02-20 17:33:27,095 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:27,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:33:27,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:33:27,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100155683] [2022-02-20 17:33:27,096 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:33:27,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560303951] [2022-02-20 17:33:27,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560303951] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:33:27,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:33:27,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:33:27,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992772372] [2022-02-20 17:33:27,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:33:27,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2022-02-20 17:33:27,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:33:27,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 17:33:27,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:27,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:33:27,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:33:27,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:33:27,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:33:27,145 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 17:33:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:27,497 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2022-02-20 17:33:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:33:27,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2022-02-20 17:33:27,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 17:33:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-02-20 17:33:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 17:33:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-02-20 17:33:27,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2022-02-20 17:33:27,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:27,569 INFO L225 Difference]: With dead ends: 131 [2022-02-20 17:33:27,569 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 17:33:27,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:33:27,570 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:33:27,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 127 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:33:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 17:33:27,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2022-02-20 17:33:27,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:33:27,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:33:27,605 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:33:27,606 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:33:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:27,607 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-02-20 17:33:27,608 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2022-02-20 17:33:27,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:27,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:27,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 97 states. [2022-02-20 17:33:27,608 INFO L87 Difference]: Start difference. First operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 97 states. [2022-02-20 17:33:27,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:27,610 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-02-20 17:33:27,610 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2022-02-20 17:33:27,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:33:27,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:33:27,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:33:27,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:33:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:33:27,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2022-02-20 17:33:27,613 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 86 [2022-02-20 17:33:27,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:33:27,613 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2022-02-20 17:33:27,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-20 17:33:27,613 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2022-02-20 17:33:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-20 17:33:27,614 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:27,614 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:33:27,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 17:33:27,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:27,825 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:27,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:27,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1193302554, now seen corresponding path program 2 times [2022-02-20 17:33:27,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:33:27,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611978560] [2022-02-20 17:33:27,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:27,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:33:27,835 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:33:27,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954262217] [2022-02-20 17:33:27,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:33:27,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:33:27,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:27,837 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:33:27,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 17:33:27,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:33:27,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:33:27,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 39 conjunts are in the unsatisfiable core [2022-02-20 17:33:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:27,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:28,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {5054#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {5054#true} is VALID [2022-02-20 17:33:28,632 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 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5054#true} is VALID [2022-02-20 17:33:28,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {5054#true} assume !(0 == assume_abort_if_not_~cond#1); {5054#true} is VALID [2022-02-20 17:33:28,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {5054#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,632 INFO L272 TraceCheckUtils]: 5: Hoare triple {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,633 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {5054#true} {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,633 INFO L272 TraceCheckUtils]: 10: Hoare triple {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,634 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5054#true} {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,634 INFO L272 TraceCheckUtils]: 15: Hoare triple {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,635 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5054#true} {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {5068#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,635 INFO L272 TraceCheckUtils]: 22: Hoare triple {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,636 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5054#true} {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,636 INFO L272 TraceCheckUtils]: 27: Hoare triple {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,637 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5054#true} {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,637 INFO L272 TraceCheckUtils]: 32: Hoare triple {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,638 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5054#true} {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,638 INFO L290 TraceCheckUtils]: 37: Hoare triple {5120#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(main_~r~0#1 >= main_~d~0#1);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,638 INFO L290 TraceCheckUtils]: 38: Hoare triple {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,638 INFO L272 TraceCheckUtils]: 39: Hoare triple {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,639 INFO L290 TraceCheckUtils]: 41: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,639 INFO L290 TraceCheckUtils]: 42: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,639 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5054#true} {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #72#return; {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,639 INFO L272 TraceCheckUtils]: 44: Hoare triple {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,639 INFO L290 TraceCheckUtils]: 45: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,639 INFO L290 TraceCheckUtils]: 47: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,640 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5054#true} {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #74#return; {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,640 INFO L272 TraceCheckUtils]: 49: Hoare triple {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,640 INFO L290 TraceCheckUtils]: 50: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,640 INFO L290 TraceCheckUtils]: 51: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,641 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5054#true} {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #76#return; {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {5172#(and (= |ULTIMATE.start_main_~p~0#1| 4) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !(main_~r~0#1 >= main_~d~0#1); {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,641 INFO L290 TraceCheckUtils]: 55: Hoare triple {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,641 INFO L272 TraceCheckUtils]: 56: Hoare triple {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,642 INFO L290 TraceCheckUtils]: 58: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,642 INFO L290 TraceCheckUtils]: 59: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,642 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5054#true} {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #78#return; {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,642 INFO L272 TraceCheckUtils]: 61: Hoare triple {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,642 INFO L290 TraceCheckUtils]: 62: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,642 INFO L290 TraceCheckUtils]: 63: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,642 INFO L290 TraceCheckUtils]: 64: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,643 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {5054#true} {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #80#return; {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,644 INFO L290 TraceCheckUtils]: 66: Hoare triple {5224#(and (= |ULTIMATE.start_main_~p~0#1| 4) (not (<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~d~0#1| (* |ULTIMATE.start_main_~B~0#1| 4)) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {5261#(and (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} is VALID [2022-02-20 17:33:28,645 INFO L290 TraceCheckUtils]: 67: Hoare triple {5261#(and (= 2 |ULTIMATE.start_main_~p~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} assume main_~r~0#1 >= main_~d~0#1;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} is VALID [2022-02-20 17:33:28,645 INFO L290 TraceCheckUtils]: 68: Hoare triple {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} assume !false; {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} is VALID [2022-02-20 17:33:28,645 INFO L272 TraceCheckUtils]: 69: Hoare triple {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,645 INFO L290 TraceCheckUtils]: 70: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,646 INFO L290 TraceCheckUtils]: 71: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,646 INFO L290 TraceCheckUtils]: 72: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,646 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5054#true} {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} #78#return; {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} is VALID [2022-02-20 17:33:28,646 INFO L272 TraceCheckUtils]: 74: Hoare triple {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {5054#true} is VALID [2022-02-20 17:33:28,646 INFO L290 TraceCheckUtils]: 75: Hoare triple {5054#true} ~cond := #in~cond; {5054#true} is VALID [2022-02-20 17:33:28,646 INFO L290 TraceCheckUtils]: 76: Hoare triple {5054#true} assume !(0 == ~cond); {5054#true} is VALID [2022-02-20 17:33:28,646 INFO L290 TraceCheckUtils]: 77: Hoare triple {5054#true} assume true; {5054#true} is VALID [2022-02-20 17:33:28,647 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {5054#true} {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} #80#return; {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} is VALID [2022-02-20 17:33:28,648 INFO L290 TraceCheckUtils]: 79: Hoare triple {5265#(and (= |ULTIMATE.start_main_~r~0#1| (+ |ULTIMATE.start_main_~A~0#1| (* (- 1) |ULTIMATE.start_main_~d~0#1|))) (= 2 |ULTIMATE.start_main_~p~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1) (= |ULTIMATE.start_main_~d~0#1| (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)))} assume !!(1 != main_~p~0#1);main_~d~0#1 := (if main_~d~0#1 < 0 && 0 != main_~d~0#1 % 2 then 1 + main_~d~0#1 / 2 else main_~d~0#1 / 2);main_~p~0#1 := (if main_~p~0#1 < 0 && 0 != main_~p~0#1 % 2 then 1 + main_~p~0#1 / 2 else main_~p~0#1 / 2); {5302#(and (= (div (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 2) |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)) (= (+ (- 2) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:33:28,649 INFO L290 TraceCheckUtils]: 80: Hoare triple {5302#(and (= (div (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 2) |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) (div (* |ULTIMATE.start_main_~B~0#1| 4) 2)) (= (+ (- 2) |ULTIMATE.start_main_~q~0#1|) 0) (= |ULTIMATE.start_main_~B~0#1| 1))} assume main_~r~0#1 >= main_~d~0#1;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {5306#(and (<= 0 |ULTIMATE.start_main_~r~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~B~0#1| 1) (= (div (* 2 |ULTIMATE.start_main_~B~0#1|) 2) (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:33:28,649 INFO L290 TraceCheckUtils]: 81: Hoare triple {5306#(and (<= 0 |ULTIMATE.start_main_~r~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~B~0#1| 1) (= (div (* 2 |ULTIMATE.start_main_~B~0#1|) 2) (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~q~0#1|) 0))} assume !false; {5306#(and (<= 0 |ULTIMATE.start_main_~r~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~B~0#1| 1) (= (div (* 2 |ULTIMATE.start_main_~B~0#1|) 2) (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:33:28,650 INFO L272 TraceCheckUtils]: 82: Hoare triple {5306#(and (<= 0 |ULTIMATE.start_main_~r~0#1|) (not (<= (* |ULTIMATE.start_main_~B~0#1| 4) |ULTIMATE.start_main_~A~0#1|)) (= |ULTIMATE.start_main_~B~0#1| 1) (= (div (* 2 |ULTIMATE.start_main_~B~0#1|) 2) (+ (* (- 2) |ULTIMATE.start_main_~B~0#1|) (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|)) (= (+ (- 3) |ULTIMATE.start_main_~q~0#1|) 0))} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {5313#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:33:28,650 INFO L290 TraceCheckUtils]: 83: Hoare triple {5313#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5317#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:33:28,650 INFO L290 TraceCheckUtils]: 84: Hoare triple {5317#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5055#false} is VALID [2022-02-20 17:33:28,650 INFO L290 TraceCheckUtils]: 85: Hoare triple {5055#false} assume !false; {5055#false} is VALID [2022-02-20 17:33:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 26 proven. 24 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-02-20 17:33:28,651 INFO L328 TraceCheckSpWp]: Computing backward predicates...