./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound10.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/hard-u_unwindbound10.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 91dfff3356c8586e4ab54260d22ce3d78ead2ec4d531619c6564036666f10187 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:30:46,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:30:46,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:30:46,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:30:46,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:30:46,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:30:46,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:30:46,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:30:46,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:30:46,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:30:46,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:30:46,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:30:46,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:30:46,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:30:46,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:30:46,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:30:46,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:30:46,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:30:46,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:30:46,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:30:46,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:30:46,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:30:46,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:30:46,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:30:46,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:30:46,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:30:46,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:30:46,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:30:46,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:30:46,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:30:46,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:30:46,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:30:46,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:30:46,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:30:46,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:30:46,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:30:46,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:30:46,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:30:46,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:30:46,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:30:46,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:30:46,643 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:30:46,666 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:30:46,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:30:46,667 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:30:46,667 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:30:46,668 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:30:46,668 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:30:46,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:30:46,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:30:46,669 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:30:46,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:30:46,669 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:30:46,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:30:46,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:30:46,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:30:46,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:30:46,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:30:46,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:30:46,670 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:30:46,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:30:46,671 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:30:46,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:30:46,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:30:46,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:30:46,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:30:46,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:30:46,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:30:46,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:30:46,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:30:46,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:30:46,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:30:46,673 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:30:46,673 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:30:46,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:30:46,673 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 -> 91dfff3356c8586e4ab54260d22ce3d78ead2ec4d531619c6564036666f10187 [2022-02-20 17:30:46,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:30:46,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:30:46,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:30:46,836 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:30:46,837 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:30:46,837 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound10.c [2022-02-20 17:30:46,882 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebefd7fdd/6dac6a2a3b894bf3b0e4e8e1fd8eedd5/FLAG6346aa16b [2022-02-20 17:30:47,217 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:30:47,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound10.c [2022-02-20 17:30:47,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebefd7fdd/6dac6a2a3b894bf3b0e4e8e1fd8eedd5/FLAG6346aa16b [2022-02-20 17:30:47,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebefd7fdd/6dac6a2a3b894bf3b0e4e8e1fd8eedd5 [2022-02-20 17:30:47,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:30:47,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:30:47,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:30:47,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:30:47,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:30:47,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:30:47" (1/1) ... [2022-02-20 17:30:47,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b88ac5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:30:47, skipping insertion in model container [2022-02-20 17:30:47,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:30:47" (1/1) ... [2022-02-20 17:30:47,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:30:47,262 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:30:47,376 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/hard-u_unwindbound10.c[537,550] [2022-02-20 17:30:47,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:30:47,400 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:30:47,407 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/hard-u_unwindbound10.c[537,550] [2022-02-20 17:30:47,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:30:47,422 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:30:47,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:30:47 WrapperNode [2022-02-20 17:30:47,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:30:47,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:30:47,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:30:47,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:30:47,427 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:30:47" (1/1) ... [2022-02-20 17:30:47,431 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:30:47" (1/1) ... [2022-02-20 17:30:47,449 INFO L137 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-02-20 17:30:47,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:30:47,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:30:47,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:30:47,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:30:47,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:30:47" (1/1) ... [2022-02-20 17:30:47,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:30:47" (1/1) ... [2022-02-20 17:30:47,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:30:47" (1/1) ... [2022-02-20 17:30:47,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:30:47" (1/1) ... [2022-02-20 17:30:47,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:30:47" (1/1) ... [2022-02-20 17:30:47,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:30:47" (1/1) ... [2022-02-20 17:30:47,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:30:47" (1/1) ... [2022-02-20 17:30:47,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:30:47,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:30:47,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:30:47,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:30:47,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:30:47" (1/1) ... [2022-02-20 17:30:47,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:30:47,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:30:47,508 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:30:47,513 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:30:47,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:30:47,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:30:47,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:30:47,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:30:47,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:30:47,539 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:30:47,577 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:30:47,578 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:30:47,727 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:30:47,732 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:30:47,732 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:30:47,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:30:47 BoogieIcfgContainer [2022-02-20 17:30:47,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:30:47,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:30:47,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:30:47,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:30:47,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:30:47" (1/3) ... [2022-02-20 17:30:47,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116e5b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:30:47, skipping insertion in model container [2022-02-20 17:30:47,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:30:47" (2/3) ... [2022-02-20 17:30:47,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116e5b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:30:47, skipping insertion in model container [2022-02-20 17:30:47,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:30:47" (3/3) ... [2022-02-20 17:30:47,753 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound10.c [2022-02-20 17:30:47,762 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:30:47,762 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:30:47,789 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:30:47,793 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:30:47,793 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:30:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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:30:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:30:47,809 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:47,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:47,809 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:47,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:47,812 INFO L85 PathProgramCache]: Analyzing trace with hash -712527539, now seen corresponding path program 1 times [2022-02-20 17:30:47,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:30:47,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529764162] [2022-02-20 17:30:47,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:47,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:30:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:47,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {31#true} is VALID [2022-02-20 17:30:47,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#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;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {31#true} is VALID [2022-02-20 17:30:47,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {32#false} is VALID [2022-02-20 17:30:47,956 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#false} assume { :end_inline_assume_abort_if_not } true;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; {32#false} is VALID [2022-02-20 17:30:47,956 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:30:47,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:30:47,956 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~d~0#1 * main_~q~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {32#false} is VALID [2022-02-20 17:30:47,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-02-20 17:30:47,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-02-20 17:30:47,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 17:30:47,959 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:30:47,960 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:30:47,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529764162] [2022-02-20 17:30:47,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529764162] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:47,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:47,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:30:47,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049796456] [2022-02-20 17:30:47,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:47,967 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2022-02-20 17:30:47,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:47,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:30:47,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:47,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:30:47,996 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:30:48,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:30:48,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:30:48,018 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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.5) internal successors, (9), 2 states have internal predecessors, (9), 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:30:48,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:48,091 INFO L93 Difference]: Finished difference Result 53 states and 87 transitions. [2022-02-20 17:30:48,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:30:48,091 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2022-02-20 17:30:48,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:30:48,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:30:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:30:48,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:30:48,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2022-02-20 17:30:48,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:48,205 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:30:48,205 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:30:48,207 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:30:48,210 INFO L933 BasicCegarLoop]: 38 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, 38 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:30:48,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:30:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:30:48,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:30:48,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:48,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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:30:48,230 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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:30:48,230 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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:30:48,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:48,233 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2022-02-20 17:30:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:30:48,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:48,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:48,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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 24 states. [2022-02-20 17:30:48,234 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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 24 states. [2022-02-20 17:30:48,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:48,237 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2022-02-20 17:30:48,237 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:30:48,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:48,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:48,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:48,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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:30:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2022-02-20 17:30:48,241 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 10 [2022-02-20 17:30:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:48,241 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2022-02-20 17:30:48,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:30:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:30:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:30:48,242 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:48,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:48,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:30:48,242 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:48,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:48,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1983932575, now seen corresponding path program 1 times [2022-02-20 17:30:48,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:30:48,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940642009] [2022-02-20 17:30:48,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:48,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:30:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:48,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {189#true} is VALID [2022-02-20 17:30:48,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#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;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {189#true} is VALID [2022-02-20 17:30:48,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#true} assume !(0 == assume_abort_if_not_~cond#1); {189#true} is VALID [2022-02-20 17:30:48,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {189#true} assume { :end_inline_assume_abort_if_not } true;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; {191#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:30:48,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {191#(= |ULTIMATE.start_main_~q~0#1| 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {191#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:30:48,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#(= |ULTIMATE.start_main_~q~0#1| 0)} assume !!(main_#t~post6#1 < 10);havoc main_#t~post6#1; {191#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:30:48,307 INFO L272 TraceCheckUtils]: 6: Hoare triple {191#(= |ULTIMATE.start_main_~q~0#1| 0)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {192#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:30:48,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {192#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {193#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:30:48,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {190#false} is VALID [2022-02-20 17:30:48,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#false} assume !false; {190#false} is VALID [2022-02-20 17:30:48,308 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:30:48,309 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:30:48,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940642009] [2022-02-20 17:30:48,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940642009] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:48,309 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:48,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:30:48,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024203928] [2022-02-20 17:30:48,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:48,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:30:48,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:48,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:30:48,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:48,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:30:48,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:30:48,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:30:48,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:30:48,325 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:30:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:48,483 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-02-20 17:30:48,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:30:48,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:30:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:30:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:30:48,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:30:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:30:48,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-02-20 17:30:48,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:48,544 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:30:48,544 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 17:30:48,547 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:30:48,550 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 15 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 112 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:30:48,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 112 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:30:48,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 17:30:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-02-20 17:30:48,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:48,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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:30:48,559 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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:30:48,560 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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:30:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:48,565 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-02-20 17:30:48,566 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2022-02-20 17:30:48,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:48,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:48,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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 36 states. [2022-02-20 17:30:48,572 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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 36 states. [2022-02-20 17:30:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:48,575 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-02-20 17:30:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2022-02-20 17:30:48,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:48,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:48,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:48,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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:30:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-02-20 17:30:48,582 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2022-02-20 17:30:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:48,582 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-02-20 17:30:48,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:30:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:30:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:30:48,583 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:48,583 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:48,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:30:48,583 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:48,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1787143384, now seen corresponding path program 1 times [2022-02-20 17:30:48,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:30:48,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586228856] [2022-02-20 17:30:48,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:48,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:30:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:48,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {360#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {362#(= ~counter~0 0)} is VALID [2022-02-20 17:30:48,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#(= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#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;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {362#(= ~counter~0 0)} is VALID [2022-02-20 17:30:48,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {362#(= ~counter~0 0)} is VALID [2022-02-20 17:30:48,619 INFO L290 TraceCheckUtils]: 3: Hoare triple {362#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;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; {362#(= ~counter~0 0)} is VALID [2022-02-20 17:30:48,619 INFO L290 TraceCheckUtils]: 4: Hoare triple {362#(= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {363#(= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:30:48,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#(= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 10);havoc main_#t~post6#1; {361#false} is VALID [2022-02-20 17:30:48,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {361#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {361#false} is VALID [2022-02-20 17:30:48,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#false} assume !(main_#t~post7#1 < 10);havoc main_#t~post7#1; {361#false} is VALID [2022-02-20 17:30:48,626 INFO L272 TraceCheckUtils]: 8: Hoare triple {361#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~d~0#1 * main_~q~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {361#false} is VALID [2022-02-20 17:30:48,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#false} ~cond := #in~cond; {361#false} is VALID [2022-02-20 17:30:48,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {361#false} assume 0 == ~cond; {361#false} is VALID [2022-02-20 17:30:48,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-02-20 17:30:48,627 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:30:48,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:30:48,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586228856] [2022-02-20 17:30:48,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586228856] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:48,628 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:48,628 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:30:48,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799533945] [2022-02-20 17:30:48,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:48,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2022-02-20 17:30:48,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:48,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:30:48,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:48,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:30:48,638 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:30:48,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:30:48,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:30:48,639 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:30:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:48,706 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-02-20 17:30:48,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:30:48,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2022-02-20 17:30:48,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:30:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 17:30:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:30:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 17:30:48,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-02-20 17:30:48,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:48,753 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:30:48,753 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:30:48,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:30:48,760 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:48,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:30:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:30:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 17:30:48,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:48,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 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:30:48,763 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 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:30:48,763 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 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:30:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:48,765 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:30:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:30:48,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:48,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:48,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 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 30 states. [2022-02-20 17:30:48,766 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 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 30 states. [2022-02-20 17:30:48,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:48,767 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:30:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:30:48,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:48,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:48,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:48,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 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:30:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-02-20 17:30:48,773 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-02-20 17:30:48,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:48,773 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-02-20 17:30:48,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:30:48,773 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:30:48,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:30:48,774 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:48,774 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:48,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:30:48,775 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:48,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:48,776 INFO L85 PathProgramCache]: Analyzing trace with hash 472519838, now seen corresponding path program 1 times [2022-02-20 17:30:48,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:30:48,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41801998] [2022-02-20 17:30:48,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:48,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:30:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:48,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 17:30:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:48,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#true} ~cond := #in~cond; {527#true} is VALID [2022-02-20 17:30:48,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} assume !(0 == ~cond); {527#true} is VALID [2022-02-20 17:30:48,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume true; {527#true} is VALID [2022-02-20 17:30:48,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {527#true} {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} #74#return; {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} is VALID [2022-02-20 17:30:48,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {527#true} is VALID [2022-02-20 17:30:48,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#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;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {527#true} is VALID [2022-02-20 17:30:48,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume !(0 == assume_abort_if_not_~cond#1); {527#true} is VALID [2022-02-20 17:30:48,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {527#true} assume { :end_inline_assume_abort_if_not } true;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; {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} is VALID [2022-02-20 17:30:48,844 INFO L290 TraceCheckUtils]: 4: Hoare triple {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} is VALID [2022-02-20 17:30:48,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} assume !!(main_#t~post6#1 < 10);havoc main_#t~post6#1; {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} is VALID [2022-02-20 17:30:48,845 INFO L272 TraceCheckUtils]: 6: Hoare triple {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {527#true} is VALID [2022-02-20 17:30:48,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {527#true} ~cond := #in~cond; {527#true} is VALID [2022-02-20 17:30:48,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {527#true} assume !(0 == ~cond); {527#true} is VALID [2022-02-20 17:30:48,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {527#true} assume true; {527#true} is VALID [2022-02-20 17:30:48,846 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {527#true} {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} #74#return; {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} is VALID [2022-02-20 17:30:48,847 INFO L272 TraceCheckUtils]: 11: Hoare triple {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {534#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:30:48,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {534#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {535#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:30:48,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {535#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {528#false} is VALID [2022-02-20 17:30:48,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {528#false} assume !false; {528#false} is VALID [2022-02-20 17:30:48,848 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:30:48,848 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:30:48,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41801998] [2022-02-20 17:30:48,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41801998] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:48,848 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:48,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:30:48,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200363741] [2022-02-20 17:30:48,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:48,849 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, (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 15 [2022-02-20 17:30:48,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:48,849 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, (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:30:48,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:48,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:30:48,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:30:48,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:30:48,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:30:48,859 INFO L87 Difference]: Start difference. First operand 30 states and 39 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, (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:30:49,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:49,008 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-02-20 17:30:49,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:30:49,008 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, (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 15 [2022-02-20 17:30:49,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:49,008 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, (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:30:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:30:49,011 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, (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:30:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:30:49,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-02-20 17:30:49,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:49,062 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:30:49,062 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 17:30:49,062 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:30:49,063 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 108 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:30:49,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 108 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:30:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 17:30:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-02-20 17:30:49,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:49,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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:30:49,068 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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:30:49,068 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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:30:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:49,069 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:30:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-02-20 17:30:49,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:49,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:49,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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 42 states. [2022-02-20 17:30:49,070 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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 42 states. [2022-02-20 17:30:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:49,072 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:30:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-02-20 17:30:49,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:49,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:49,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:49,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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:30:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-02-20 17:30:49,073 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 15 [2022-02-20 17:30:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:49,073 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-02-20 17:30:49,074 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, (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:30:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-20 17:30:49,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:30:49,074 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:49,074 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:49,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:30:49,074 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:49,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:49,074 INFO L85 PathProgramCache]: Analyzing trace with hash 838495553, now seen corresponding path program 1 times [2022-02-20 17:30:49,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:30:49,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541737171] [2022-02-20 17:30:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:49,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:30:49,092 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:30:49,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1750761309] [2022-02-20 17:30:49,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:49,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:30:49,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:30:49,094 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:30:49,105 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:30:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:49,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:30:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:49,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:49,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {730#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {730#true} is VALID [2022-02-20 17:30:49,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {730#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#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;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {730#true} is VALID [2022-02-20 17:30:49,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {730#true} assume !(0 == assume_abort_if_not_~cond#1); {730#true} is VALID [2022-02-20 17:30:49,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {730#true} assume { :end_inline_assume_abort_if_not } true;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; {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:30:49,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:30:49,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} assume !!(main_#t~post6#1 < 10);havoc main_#t~post6#1; {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:30:49,297 INFO L272 TraceCheckUtils]: 6: Hoare triple {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {730#true} is VALID [2022-02-20 17:30:49,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:30:49,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:30:49,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:30:49,298 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {730#true} {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} #74#return; {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:30:49,298 INFO L272 TraceCheckUtils]: 11: Hoare triple {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {730#true} is VALID [2022-02-20 17:30:49,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:30:49,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:30:49,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:30:49,299 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {730#true} {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} #76#return; {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:30:49,300 INFO L272 TraceCheckUtils]: 16: Hoare triple {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {784#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:30:49,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {784#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {788#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:30:49,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {788#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {731#false} is VALID [2022-02-20 17:30:49,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {731#false} assume !false; {731#false} is VALID [2022-02-20 17:30:49,301 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:30:49,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:30:49,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:30:49,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541737171] [2022-02-20 17:30:49,302 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:30:49,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750761309] [2022-02-20 17:30:49,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750761309] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:49,302 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:49,302 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:30:49,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978946233] [2022-02-20 17:30:49,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:49,302 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, (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 20 [2022-02-20 17:30:49,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:49,303 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, (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:30:49,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:49,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:30:49,316 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:30:49,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:30:49,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:30:49,317 INFO L87 Difference]: Start difference. First operand 34 states and 42 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, (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:30:51,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:30:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:51,629 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-02-20 17:30:51,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:30:51,630 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, (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 20 [2022-02-20 17:30:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:51,630 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, (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:30:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-02-20 17:30:51,632 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, (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:30:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-02-20 17:30:51,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-02-20 17:30:51,692 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:30:51,693 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:30:51,693 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:30:51,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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:30:51,694 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:51,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 119 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 17:30:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:30:51,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-20 17:30:51,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:51,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 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:30:51,714 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 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:30:51,714 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 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:30:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:51,716 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-02-20 17:30:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-02-20 17:30:51,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:51,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:51,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 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 48 states. [2022-02-20 17:30:51,717 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 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 48 states. [2022-02-20 17:30:51,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:51,721 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-02-20 17:30:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-02-20 17:30:51,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:51,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:51,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:51,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 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:30:51,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2022-02-20 17:30:51,723 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 20 [2022-02-20 17:30:51,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:51,724 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2022-02-20 17:30:51,724 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, (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:30:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-02-20 17:30:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:30:51,725 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:51,725 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:51,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:30:51,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:30:51,933 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:51,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:51,934 INFO L85 PathProgramCache]: Analyzing trace with hash 414140572, now seen corresponding path program 1 times [2022-02-20 17:30:51,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:30:51,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205523829] [2022-02-20 17:30:51,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:51,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:30:51,948 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:30:51,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [495217274] [2022-02-20 17:30:51,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:51,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:30:51,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:30:51,949 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:30:51,951 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:30:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:51,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:30:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:51,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:52,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {1030#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1035#(<= ~counter~0 0)} is VALID [2022-02-20 17:30:52,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {1035#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#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;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1035#(<= ~counter~0 0)} is VALID [2022-02-20 17:30:52,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {1035#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {1035#(<= ~counter~0 0)} is VALID [2022-02-20 17:30:52,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {1035#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;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; {1035#(<= ~counter~0 0)} is VALID [2022-02-20 17:30:52,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {1035#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {1048#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 10);havoc main_#t~post6#1; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,193 INFO L272 TraceCheckUtils]: 6: Hoare triple {1048#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#(<= ~counter~0 1)} ~cond := #in~cond; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#(<= ~counter~0 1)} assume !(0 == ~cond); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#(<= ~counter~0 1)} assume true; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,195 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#(<= ~counter~0 1)} {1048#(<= ~counter~0 1)} #74#return; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,195 INFO L272 TraceCheckUtils]: 11: Hoare triple {1048#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {1048#(<= ~counter~0 1)} ~cond := #in~cond; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#(<= ~counter~0 1)} assume !(0 == ~cond); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#(<= ~counter~0 1)} assume true; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,197 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1048#(<= ~counter~0 1)} {1048#(<= ~counter~0 1)} #76#return; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,198 INFO L272 TraceCheckUtils]: 16: Hoare triple {1048#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {1048#(<= ~counter~0 1)} ~cond := #in~cond; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {1048#(<= ~counter~0 1)} assume !(0 == ~cond); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {1048#(<= ~counter~0 1)} assume true; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,199 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1048#(<= ~counter~0 1)} {1048#(<= ~counter~0 1)} #78#return; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#(<= ~counter~0 1)} assume !(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:52,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#(<= ~counter~0 1)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1103#(<= |ULTIMATE.start_main_#t~post7#1| 1)} is VALID [2022-02-20 17:30:52,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {1103#(<= |ULTIMATE.start_main_#t~post7#1| 1)} assume !(main_#t~post7#1 < 10);havoc main_#t~post7#1; {1031#false} is VALID [2022-02-20 17:30:52,201 INFO L272 TraceCheckUtils]: 24: Hoare triple {1031#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~d~0#1 * main_~q~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {1031#false} is VALID [2022-02-20 17:30:52,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {1031#false} ~cond := #in~cond; {1031#false} is VALID [2022-02-20 17:30:52,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {1031#false} assume 0 == ~cond; {1031#false} is VALID [2022-02-20 17:30:52,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {1031#false} assume !false; {1031#false} is VALID [2022-02-20 17:30:52,202 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:30:52,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:30:52,202 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:30:52,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205523829] [2022-02-20 17:30:52,202 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:30:52,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495217274] [2022-02-20 17:30:52,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495217274] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:52,202 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:52,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:30:52,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105779491] [2022-02-20 17:30:52,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:52,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 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 28 [2022-02-20 17:30:52,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:52,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 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:30:52,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:52,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:30:52,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:30:52,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:30:52,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:30:52,223 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 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:30:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:52,357 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-02-20 17:30:52,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:30:52,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 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 28 [2022-02-20 17:30:52,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 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:30:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-02-20 17:30:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 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:30:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-02-20 17:30:52,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2022-02-20 17:30:52,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:52,407 INFO L225 Difference]: With dead ends: 68 [2022-02-20 17:30:52,407 INFO L226 Difference]: Without dead ends: 61 [2022-02-20 17:30:52,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:30:52,408 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:52,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 99 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:30:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-20 17:30:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-02-20 17:30:52,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:52,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:30:52,421 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:30:52,421 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:30:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:52,423 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-02-20 17:30:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-02-20 17:30:52,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:52,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:52,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 61 states. [2022-02-20 17:30:52,424 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 61 states. [2022-02-20 17:30:52,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:52,425 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-02-20 17:30:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-02-20 17:30:52,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:52,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:52,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:52,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:30:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-02-20 17:30:52,427 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 28 [2022-02-20 17:30:52,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:52,427 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-02-20 17:30:52,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 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:30:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-02-20 17:30:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:30:52,428 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:52,428 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:52,462 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:30:52,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 17:30:52,629 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:52,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:52,629 INFO L85 PathProgramCache]: Analyzing trace with hash 415868450, now seen corresponding path program 1 times [2022-02-20 17:30:52,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:30:52,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986222129] [2022-02-20 17:30:52,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:52,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:30:52,639 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:30:52,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582018833] [2022-02-20 17:30:52,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:52,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:30:52,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:30:52,641 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:30:52,674 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:30:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:52,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 17:30:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:52,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:53,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {1415#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1415#true} is VALID [2022-02-20 17:30:53,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {1415#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#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;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1415#true} is VALID [2022-02-20 17:30:53,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {1415#true} assume !(0 == assume_abort_if_not_~cond#1); {1415#true} is VALID [2022-02-20 17:30:53,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {1415#true} assume { :end_inline_assume_abort_if_not } true;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; {1429#(and (= |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|))} is VALID [2022-02-20 17:30:53,238 INFO L290 TraceCheckUtils]: 4: Hoare triple {1429#(and (= |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|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1429#(and (= |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|))} is VALID [2022-02-20 17:30:53,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {1429#(and (= |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|))} assume !!(main_#t~post6#1 < 10);havoc main_#t~post6#1; {1429#(and (= |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|))} is VALID [2022-02-20 17:30:53,240 INFO L272 TraceCheckUtils]: 6: Hoare triple {1429#(and (= |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|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1415#true} is VALID [2022-02-20 17:30:53,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {1415#true} ~cond := #in~cond; {1415#true} is VALID [2022-02-20 17:30:53,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {1415#true} assume !(0 == ~cond); {1415#true} is VALID [2022-02-20 17:30:53,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-02-20 17:30:53,241 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1415#true} {1429#(and (= |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|))} #74#return; {1429#(and (= |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|))} is VALID [2022-02-20 17:30:53,242 INFO L272 TraceCheckUtils]: 11: Hoare triple {1429#(and (= |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|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1415#true} is VALID [2022-02-20 17:30:53,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {1415#true} ~cond := #in~cond; {1415#true} is VALID [2022-02-20 17:30:53,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {1415#true} assume !(0 == ~cond); {1415#true} is VALID [2022-02-20 17:30:53,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-02-20 17:30:53,244 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1415#true} {1429#(and (= |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|))} #76#return; {1429#(and (= |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|))} is VALID [2022-02-20 17:30:53,244 INFO L272 TraceCheckUtils]: 16: Hoare triple {1429#(and (= |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|))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1415#true} is VALID [2022-02-20 17:30:53,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {1415#true} ~cond := #in~cond; {1415#true} is VALID [2022-02-20 17:30:53,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {1415#true} assume !(0 == ~cond); {1415#true} is VALID [2022-02-20 17:30:53,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-02-20 17:30:53,252 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1415#true} {1429#(and (= |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|))} #78#return; {1429#(and (= |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|))} is VALID [2022-02-20 17:30:53,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {1429#(and (= |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|))} assume !(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296); {1484#(and (not (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:30:53,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {1484#(and (not (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1484#(and (not (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:30:53,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {1484#(and (not (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post7#1 < 10);havoc main_#t~post7#1; {1484#(and (not (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:30:53,259 INFO L272 TraceCheckUtils]: 24: Hoare triple {1484#(and (not (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~B~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {1494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:30:53,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {1494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:30:53,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {1498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1416#false} is VALID [2022-02-20 17:30:53,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {1416#false} assume !false; {1416#false} is VALID [2022-02-20 17:30:53,260 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:30:53,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:30:53,260 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:30:53,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986222129] [2022-02-20 17:30:53,260 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:30:53,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582018833] [2022-02-20 17:30:53,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582018833] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:30:53,262 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:30:53,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:30:53,262 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895151717] [2022-02-20 17:30:53,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:30:53,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 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 28 [2022-02-20 17:30:53,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:53,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 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:30:53,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:53,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:30:53,282 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:30:53,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:30:53,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:30:53,283 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 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:30:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:58,369 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2022-02-20 17:30:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:30:58,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 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 28 [2022-02-20 17:30:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 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:30:58,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-02-20 17:30:58,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 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:30:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-02-20 17:30:58,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-02-20 17:30:58,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:58,450 INFO L225 Difference]: With dead ends: 74 [2022-02-20 17:30:58,450 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 17:30:58,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:30:58,451 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:58,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 149 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:30:58,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 17:30:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-02-20 17:30:58,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:58,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:30:58,468 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:30:58,468 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:30:58,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:58,470 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-02-20 17:30:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2022-02-20 17:30:58,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:58,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:58,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 71 states. [2022-02-20 17:30:58,471 INFO L87 Difference]: Start difference. First operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 71 states. [2022-02-20 17:30:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:58,473 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-02-20 17:30:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2022-02-20 17:30:58,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:58,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:58,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:58,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:30:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-02-20 17:30:58,476 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 28 [2022-02-20 17:30:58,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:58,476 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-02-20 17:30:58,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 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:30:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-02-20 17:30:58,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:30:58,477 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:58,477 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:58,497 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:30:58,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:30:58,692 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:58,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:58,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1040101153, now seen corresponding path program 1 times [2022-02-20 17:30:58,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:30:58,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525194964] [2022-02-20 17:30:58,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:58,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:30:58,709 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:30:58,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1271182155] [2022-02-20 17:30:58,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:58,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:30:58,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:30:58,716 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:30:58,717 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:30:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:58,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:30:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:30:58,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:30:58,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {1846#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1851#(<= ~counter~0 0)} is VALID [2022-02-20 17:30:58,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {1851#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#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;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1851#(<= ~counter~0 0)} is VALID [2022-02-20 17:30:58,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {1851#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {1851#(<= ~counter~0 0)} is VALID [2022-02-20 17:30:58,891 INFO L290 TraceCheckUtils]: 3: Hoare triple {1851#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;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; {1851#(<= ~counter~0 0)} is VALID [2022-02-20 17:30:58,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {1851#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {1864#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 10);havoc main_#t~post6#1; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,893 INFO L272 TraceCheckUtils]: 6: Hoare triple {1864#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {1864#(<= ~counter~0 1)} ~cond := #in~cond; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {1864#(<= ~counter~0 1)} assume !(0 == ~cond); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {1864#(<= ~counter~0 1)} assume true; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1864#(<= ~counter~0 1)} {1864#(<= ~counter~0 1)} #74#return; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,895 INFO L272 TraceCheckUtils]: 11: Hoare triple {1864#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {1864#(<= ~counter~0 1)} ~cond := #in~cond; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {1864#(<= ~counter~0 1)} assume !(0 == ~cond); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {1864#(<= ~counter~0 1)} assume true; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,896 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1864#(<= ~counter~0 1)} {1864#(<= ~counter~0 1)} #76#return; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,897 INFO L272 TraceCheckUtils]: 16: Hoare triple {1864#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {1864#(<= ~counter~0 1)} ~cond := #in~cond; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {1864#(<= ~counter~0 1)} assume !(0 == ~cond); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {1864#(<= ~counter~0 1)} assume true; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,898 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1864#(<= ~counter~0 1)} {1864#(<= ~counter~0 1)} #78#return; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {1864#(<= ~counter~0 1)} assume !!(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:30:58,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {1864#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1919#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:30:58,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {1919#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 10);havoc main_#t~post6#1; {1847#false} is VALID [2022-02-20 17:30:58,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {1847#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1847#false} is VALID [2022-02-20 17:30:58,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {1847#false} assume !(main_#t~post7#1 < 10);havoc main_#t~post7#1; {1847#false} is VALID [2022-02-20 17:30:58,899 INFO L272 TraceCheckUtils]: 26: Hoare triple {1847#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~d~0#1 * main_~q~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {1847#false} is VALID [2022-02-20 17:30:58,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {1847#false} ~cond := #in~cond; {1847#false} is VALID [2022-02-20 17:30:58,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {1847#false} assume 0 == ~cond; {1847#false} is VALID [2022-02-20 17:30:58,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {1847#false} assume !false; {1847#false} is VALID [2022-02-20 17:30:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:30:58,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:30:59,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {1847#false} assume !false; {1847#false} is VALID [2022-02-20 17:30:59,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {1847#false} assume 0 == ~cond; {1847#false} is VALID [2022-02-20 17:30:59,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {1847#false} ~cond := #in~cond; {1847#false} is VALID [2022-02-20 17:30:59,030 INFO L272 TraceCheckUtils]: 26: Hoare triple {1847#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~d~0#1 * main_~q~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {1847#false} is VALID [2022-02-20 17:30:59,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {1847#false} assume !(main_#t~post7#1 < 10);havoc main_#t~post7#1; {1847#false} is VALID [2022-02-20 17:30:59,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {1847#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1847#false} is VALID [2022-02-20 17:30:59,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {1959#(< |ULTIMATE.start_main_#t~post6#1| 10)} assume !(main_#t~post6#1 < 10);havoc main_#t~post6#1; {1847#false} is VALID [2022-02-20 17:30:59,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {1963#(< ~counter~0 10)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1959#(< |ULTIMATE.start_main_#t~post6#1| 10)} is VALID [2022-02-20 17:30:59,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {1963#(< ~counter~0 10)} assume !!(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {1963#(< ~counter~0 10)} is VALID [2022-02-20 17:30:59,032 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1846#true} {1963#(< ~counter~0 10)} #78#return; {1963#(< ~counter~0 10)} is VALID [2022-02-20 17:30:59,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 17:30:59,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#true} assume !(0 == ~cond); {1846#true} is VALID [2022-02-20 17:30:59,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#true} ~cond := #in~cond; {1846#true} is VALID [2022-02-20 17:30:59,032 INFO L272 TraceCheckUtils]: 16: Hoare triple {1963#(< ~counter~0 10)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1846#true} is VALID [2022-02-20 17:30:59,033 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1846#true} {1963#(< ~counter~0 10)} #76#return; {1963#(< ~counter~0 10)} is VALID [2022-02-20 17:30:59,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 17:30:59,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {1846#true} assume !(0 == ~cond); {1846#true} is VALID [2022-02-20 17:30:59,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {1846#true} ~cond := #in~cond; {1846#true} is VALID [2022-02-20 17:30:59,033 INFO L272 TraceCheckUtils]: 11: Hoare triple {1963#(< ~counter~0 10)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1846#true} is VALID [2022-02-20 17:30:59,033 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1846#true} {1963#(< ~counter~0 10)} #74#return; {1963#(< ~counter~0 10)} is VALID [2022-02-20 17:30:59,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 17:30:59,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {1846#true} assume !(0 == ~cond); {1846#true} is VALID [2022-02-20 17:30:59,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {1846#true} ~cond := #in~cond; {1846#true} is VALID [2022-02-20 17:30:59,034 INFO L272 TraceCheckUtils]: 6: Hoare triple {1963#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1846#true} is VALID [2022-02-20 17:30:59,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {1963#(< ~counter~0 10)} assume !!(main_#t~post6#1 < 10);havoc main_#t~post6#1; {1963#(< ~counter~0 10)} is VALID [2022-02-20 17:30:59,035 INFO L290 TraceCheckUtils]: 4: Hoare triple {2018#(< ~counter~0 9)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1963#(< ~counter~0 10)} is VALID [2022-02-20 17:30:59,035 INFO L290 TraceCheckUtils]: 3: Hoare triple {2018#(< ~counter~0 9)} assume { :end_inline_assume_abort_if_not } true;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; {2018#(< ~counter~0 9)} is VALID [2022-02-20 17:30:59,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {2018#(< ~counter~0 9)} assume !(0 == assume_abort_if_not_~cond#1); {2018#(< ~counter~0 9)} is VALID [2022-02-20 17:30:59,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {2018#(< ~counter~0 9)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#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;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2018#(< ~counter~0 9)} is VALID [2022-02-20 17:30:59,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {1846#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2018#(< ~counter~0 9)} is VALID [2022-02-20 17:30:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:30:59,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:30:59,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525194964] [2022-02-20 17:30:59,037 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:30:59,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271182155] [2022-02-20 17:30:59,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271182155] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:30:59,037 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:30:59,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:30:59,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671266272] [2022-02-20 17:30:59,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:30:59,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 30 [2022-02-20 17:30:59,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:30:59,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:30:59,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:59,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:30:59,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:30:59,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:30:59,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:30:59,068 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:30:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:59,542 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2022-02-20 17:30:59,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:30:59,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 30 [2022-02-20 17:30:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:30:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:30:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2022-02-20 17:30:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:30:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2022-02-20 17:30:59,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 125 transitions. [2022-02-20 17:30:59,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:30:59,647 INFO L225 Difference]: With dead ends: 152 [2022-02-20 17:30:59,647 INFO L226 Difference]: Without dead ends: 138 [2022-02-20 17:30:59,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:30:59,648 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 69 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:30:59,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 202 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:30:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-02-20 17:30:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2022-02-20 17:30:59,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:30:59,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 17:30:59,690 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 17:30:59,692 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 17:30:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:59,704 INFO L93 Difference]: Finished difference Result 138 states and 166 transitions. [2022-02-20 17:30:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-02-20 17:30:59,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:59,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:59,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 138 states. [2022-02-20 17:30:59,707 INFO L87 Difference]: Start difference. First operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 138 states. [2022-02-20 17:30:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:30:59,710 INFO L93 Difference]: Finished difference Result 138 states and 166 transitions. [2022-02-20 17:30:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-02-20 17:30:59,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:30:59,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:30:59,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:30:59,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:30:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 17:30:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 158 transitions. [2022-02-20 17:30:59,716 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 158 transitions. Word has length 30 [2022-02-20 17:30:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:30:59,717 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 158 transitions. [2022-02-20 17:30:59,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:30:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2022-02-20 17:30:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 17:30:59,719 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:30:59,719 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:30:59,741 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:30:59,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:30:59,939 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:30:59,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:30:59,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1884102282, now seen corresponding path program 1 times [2022-02-20 17:30:59,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:30:59,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010849926] [2022-02-20 17:30:59,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:59,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:30:59,949 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:30:59,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [153574151] [2022-02-20 17:30:59,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:30:59,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:30:59,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:30:59,954 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:30:59,970 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:31:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:00,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 17:31:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:00,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:00,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {2697#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2697#true} is VALID [2022-02-20 17:31:00,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {2697#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#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;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2705#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (and (not (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} is VALID [2022-02-20 17:31:00,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {2705#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (and (not (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} assume !(0 == assume_abort_if_not_~cond#1); {2709#(<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))} is VALID [2022-02-20 17:31:00,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {2709#(<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))} assume { :end_inline_assume_abort_if_not } true;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; {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:00,981 INFO L290 TraceCheckUtils]: 4: Hoare triple {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:00,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post6#1 < 10);havoc main_#t~post6#1; {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:00,981 INFO L272 TraceCheckUtils]: 6: Hoare triple {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:00,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:00,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:00,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:00,982 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2697#true} {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #74#return; {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:00,982 INFO L272 TraceCheckUtils]: 11: Hoare triple {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:00,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {2697#true} ~cond := #in~cond; {2741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:00,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {2741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:00,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:00,987 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #76#return; {2752#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:00,987 INFO L272 TraceCheckUtils]: 16: Hoare triple {2752#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:00,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:00,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:00,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:00,988 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2697#true} {2752#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} #78#return; {2752#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:00,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {2752#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} assume !!(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:00,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:00,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} assume !!(main_#t~post6#1 < 10);havoc main_#t~post6#1; {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:00,990 INFO L272 TraceCheckUtils]: 24: Hoare triple {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:00,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:00,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:00,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:00,991 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2697#true} {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} #74#return; {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:00,991 INFO L272 TraceCheckUtils]: 29: Hoare triple {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:00,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:00,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:00,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:00,992 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2697#true} {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} #76#return; {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:00,996 INFO L272 TraceCheckUtils]: 34: Hoare triple {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {2811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:00,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {2811#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:00,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {2815#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2698#false} is VALID [2022-02-20 17:31:00,997 INFO L290 TraceCheckUtils]: 37: Hoare triple {2698#false} assume !false; {2698#false} is VALID [2022-02-20 17:31:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 17:31:00,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:31:08,909 INFO L290 TraceCheckUtils]: 37: Hoare triple {2698#false} assume !false; {2698#false} is VALID [2022-02-20 17:31:08,909 INFO L290 TraceCheckUtils]: 36: Hoare triple {2815#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2698#false} is VALID [2022-02-20 17:31:08,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {2811#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:08,910 INFO L272 TraceCheckUtils]: 34: Hoare triple {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {2811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:08,911 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2697#true} {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} #76#return; {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:08,911 INFO L290 TraceCheckUtils]: 32: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:08,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:08,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:08,911 INFO L272 TraceCheckUtils]: 29: Hoare triple {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:08,911 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2697#true} {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} #74#return; {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:08,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:08,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:08,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:08,912 INFO L272 TraceCheckUtils]: 24: Hoare triple {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:08,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} assume !!(main_#t~post6#1 < 10);havoc main_#t~post6#1; {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:08,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:10,920 WARN L290 TraceCheckUtils]: 21: Hoare triple {2871#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} assume !!(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is UNKNOWN [2022-02-20 17:31:10,920 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2697#true} {2871#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} #78#return; {2871#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} is VALID [2022-02-20 17:31:10,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:10,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:10,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:10,921 INFO L272 TraceCheckUtils]: 16: Hoare triple {2871#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:10,921 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} #76#return; {2871#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} is VALID [2022-02-20 17:31:10,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:10,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {2900#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:10,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {2697#true} ~cond := #in~cond; {2900#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:31:10,922 INFO L272 TraceCheckUtils]: 11: Hoare triple {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:10,923 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2697#true} {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} #74#return; {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} is VALID [2022-02-20 17:31:10,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:10,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:10,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:10,923 INFO L272 TraceCheckUtils]: 6: Hoare triple {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:10,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} assume !!(main_#t~post6#1 < 10);havoc main_#t~post6#1; {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} is VALID [2022-02-20 17:31:10,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} is VALID [2022-02-20 17:31:10,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {2697#true} assume { :end_inline_assume_abort_if_not } true;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; {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} is VALID [2022-02-20 17:31:10,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {2697#true} assume !(0 == assume_abort_if_not_~cond#1); {2697#true} is VALID [2022-02-20 17:31:10,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {2697#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#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;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2697#true} is VALID [2022-02-20 17:31:10,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {2697#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2697#true} is VALID [2022-02-20 17:31:10,926 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 17:31:10,926 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:10,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010849926] [2022-02-20 17:31:10,926 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:10,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153574151] [2022-02-20 17:31:10,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153574151] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:31:10,926 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:31:10,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-02-20 17:31:10,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534079867] [2022-02-20 17:31:10,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:31:10,927 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 38 [2022-02-20 17:31:10,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:10,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 17:31:13,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 49 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:13,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:31:13,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:13,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:31:13,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=161, Unknown=2, NotChecked=0, Total=210 [2022-02-20 17:31:13,268 INFO L87 Difference]: Start difference. First operand 130 states and 158 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 17:31:17,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:31:23,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:26,498 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:31:28,510 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:31:34,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:38,320 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-02-20 17:31:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:31:38,321 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 38 [2022-02-20 17:31:38,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 17:31:38,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-02-20 17:31:38,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 17:31:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-02-20 17:31:38,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 100 transitions. [2022-02-20 17:31:42,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 99 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:42,380 INFO L225 Difference]: With dead ends: 166 [2022-02-20 17:31:42,380 INFO L226 Difference]: Without dead ends: 158 [2022-02-20 17:31:42,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=93, Invalid=325, Unknown=2, NotChecked=0, Total=420 [2022-02-20 17:31:42,381 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 86 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 84 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:42,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 213 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 239 Invalid, 3 Unknown, 0 Unchecked, 15.2s Time] [2022-02-20 17:31:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-20 17:31:42,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 147. [2022-02-20 17:31:42,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:42,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:31:42,431 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:31:42,431 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:31:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:42,435 INFO L93 Difference]: Finished difference Result 158 states and 196 transitions. [2022-02-20 17:31:42,435 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions. [2022-02-20 17:31:42,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:42,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:42,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 158 states. [2022-02-20 17:31:42,437 INFO L87 Difference]: Start difference. First operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 158 states. [2022-02-20 17:31:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:42,441 INFO L93 Difference]: Finished difference Result 158 states and 196 transitions. [2022-02-20 17:31:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions. [2022-02-20 17:31:42,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:42,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:42,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:42,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:42,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:31:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2022-02-20 17:31:42,444 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 38 [2022-02-20 17:31:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:42,444 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2022-02-20 17:31:42,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 17:31:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2022-02-20 17:31:42,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 17:31:42,445 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:42,445 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:42,461 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:31:42,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:42,645 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:42,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:42,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1109899640, now seen corresponding path program 1 times [2022-02-20 17:31:42,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:42,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429341573] [2022-02-20 17:31:42,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:42,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:42,655 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:42,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [688045942] [2022-02-20 17:31:42,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:42,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:42,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:42,657 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:31:42,658 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:31:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:42,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:31:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:42,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:42,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {3701#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3706#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:42,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {3706#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#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;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3706#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:42,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {3706#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {3706#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:42,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {3706#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;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; {3706#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:42,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {3706#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {3719#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 10);havoc main_#t~post6#1; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,893 INFO L272 TraceCheckUtils]: 6: Hoare triple {3719#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {3719#(<= ~counter~0 1)} ~cond := #in~cond; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {3719#(<= ~counter~0 1)} assume !(0 == ~cond); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {3719#(<= ~counter~0 1)} assume true; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3719#(<= ~counter~0 1)} {3719#(<= ~counter~0 1)} #74#return; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,894 INFO L272 TraceCheckUtils]: 11: Hoare triple {3719#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {3719#(<= ~counter~0 1)} ~cond := #in~cond; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {3719#(<= ~counter~0 1)} assume !(0 == ~cond); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {3719#(<= ~counter~0 1)} assume true; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,896 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3719#(<= ~counter~0 1)} {3719#(<= ~counter~0 1)} #76#return; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,896 INFO L272 TraceCheckUtils]: 16: Hoare triple {3719#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {3719#(<= ~counter~0 1)} ~cond := #in~cond; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {3719#(<= ~counter~0 1)} assume !(0 == ~cond); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {3719#(<= ~counter~0 1)} assume true; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,898 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3719#(<= ~counter~0 1)} {3719#(<= ~counter~0 1)} #78#return; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {3719#(<= ~counter~0 1)} assume !(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:42,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {3719#(<= ~counter~0 1)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:42,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {3774#(<= ~counter~0 2)} assume !!(main_#t~post7#1 < 10);havoc main_#t~post7#1; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:42,906 INFO L272 TraceCheckUtils]: 24: Hoare triple {3774#(<= ~counter~0 2)} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~B~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:42,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {3774#(<= ~counter~0 2)} ~cond := #in~cond; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:42,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {3774#(<= ~counter~0 2)} assume !(0 == ~cond); {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:42,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {3774#(<= ~counter~0 2)} assume true; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:42,908 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3774#(<= ~counter~0 2)} {3774#(<= ~counter~0 2)} #80#return; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:42,908 INFO L272 TraceCheckUtils]: 29: Hoare triple {3774#(<= ~counter~0 2)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:42,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {3774#(<= ~counter~0 2)} ~cond := #in~cond; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:42,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {3774#(<= ~counter~0 2)} assume !(0 == ~cond); {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:42,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {3774#(<= ~counter~0 2)} assume true; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:42,909 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3774#(<= ~counter~0 2)} {3774#(<= ~counter~0 2)} #82#return; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:42,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {3774#(<= ~counter~0 2)} assume !!(1 != main_~p~0#1 % 4294967296);main_~d~0#1 := (if main_~d~0#1 % 4294967296 < 0 && 0 != main_~d~0#1 % 4294967296 % 2 then 1 + main_~d~0#1 % 4294967296 / 2 else main_~d~0#1 % 4294967296 / 2);main_~p~0#1 := (if main_~p~0#1 % 4294967296 < 0 && 0 != main_~p~0#1 % 4294967296 % 2 then 1 + main_~p~0#1 % 4294967296 / 2 else main_~p~0#1 % 4294967296 / 2); {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:42,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {3774#(<= ~counter~0 2)} assume main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:42,915 INFO L290 TraceCheckUtils]: 36: Hoare triple {3774#(<= ~counter~0 2)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {3817#(<= |ULTIMATE.start_main_#t~post7#1| 2)} is VALID [2022-02-20 17:31:42,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {3817#(<= |ULTIMATE.start_main_#t~post7#1| 2)} assume !(main_#t~post7#1 < 10);havoc main_#t~post7#1; {3702#false} is VALID [2022-02-20 17:31:42,915 INFO L272 TraceCheckUtils]: 38: Hoare triple {3702#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~d~0#1 * main_~q~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {3702#false} is VALID [2022-02-20 17:31:42,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {3702#false} ~cond := #in~cond; {3702#false} is VALID [2022-02-20 17:31:42,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {3702#false} assume 0 == ~cond; {3702#false} is VALID [2022-02-20 17:31:42,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {3702#false} assume !false; {3702#false} is VALID [2022-02-20 17:31:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 17:31:42,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:31:43,085 INFO L290 TraceCheckUtils]: 41: Hoare triple {3702#false} assume !false; {3702#false} is VALID [2022-02-20 17:31:43,085 INFO L290 TraceCheckUtils]: 40: Hoare triple {3702#false} assume 0 == ~cond; {3702#false} is VALID [2022-02-20 17:31:43,085 INFO L290 TraceCheckUtils]: 39: Hoare triple {3702#false} ~cond := #in~cond; {3702#false} is VALID [2022-02-20 17:31:43,085 INFO L272 TraceCheckUtils]: 38: Hoare triple {3702#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~d~0#1 * main_~q~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {3702#false} is VALID [2022-02-20 17:31:43,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {3845#(< |ULTIMATE.start_main_#t~post7#1| 10)} assume !(main_#t~post7#1 < 10);havoc main_#t~post7#1; {3702#false} is VALID [2022-02-20 17:31:43,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {3849#(< ~counter~0 10)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {3845#(< |ULTIMATE.start_main_#t~post7#1| 10)} is VALID [2022-02-20 17:31:43,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {3849#(< ~counter~0 10)} assume main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {3849#(< ~counter~0 10)} is VALID [2022-02-20 17:31:43,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {3849#(< ~counter~0 10)} assume !!(1 != main_~p~0#1 % 4294967296);main_~d~0#1 := (if main_~d~0#1 % 4294967296 < 0 && 0 != main_~d~0#1 % 4294967296 % 2 then 1 + main_~d~0#1 % 4294967296 / 2 else main_~d~0#1 % 4294967296 / 2);main_~p~0#1 := (if main_~p~0#1 % 4294967296 < 0 && 0 != main_~p~0#1 % 4294967296 % 2 then 1 + main_~p~0#1 % 4294967296 / 2 else main_~p~0#1 % 4294967296 / 2); {3849#(< ~counter~0 10)} is VALID [2022-02-20 17:31:43,087 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3701#true} {3849#(< ~counter~0 10)} #82#return; {3849#(< ~counter~0 10)} is VALID [2022-02-20 17:31:43,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {3701#true} assume true; {3701#true} is VALID [2022-02-20 17:31:43,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2022-02-20 17:31:43,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2022-02-20 17:31:43,087 INFO L272 TraceCheckUtils]: 29: Hoare triple {3849#(< ~counter~0 10)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {3701#true} is VALID [2022-02-20 17:31:43,087 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3701#true} {3849#(< ~counter~0 10)} #80#return; {3849#(< ~counter~0 10)} is VALID [2022-02-20 17:31:43,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {3701#true} assume true; {3701#true} is VALID [2022-02-20 17:31:43,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2022-02-20 17:31:43,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2022-02-20 17:31:43,088 INFO L272 TraceCheckUtils]: 24: Hoare triple {3849#(< ~counter~0 10)} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~B~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {3701#true} is VALID [2022-02-20 17:31:43,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {3849#(< ~counter~0 10)} assume !!(main_#t~post7#1 < 10);havoc main_#t~post7#1; {3849#(< ~counter~0 10)} is VALID [2022-02-20 17:31:43,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {3892#(< ~counter~0 9)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {3849#(< ~counter~0 10)} is VALID [2022-02-20 17:31:43,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {3892#(< ~counter~0 9)} assume !(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296); {3892#(< ~counter~0 9)} is VALID [2022-02-20 17:31:43,089 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3701#true} {3892#(< ~counter~0 9)} #78#return; {3892#(< ~counter~0 9)} is VALID [2022-02-20 17:31:43,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {3701#true} assume true; {3701#true} is VALID [2022-02-20 17:31:43,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2022-02-20 17:31:43,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2022-02-20 17:31:43,089 INFO L272 TraceCheckUtils]: 16: Hoare triple {3892#(< ~counter~0 9)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {3701#true} is VALID [2022-02-20 17:31:43,090 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3701#true} {3892#(< ~counter~0 9)} #76#return; {3892#(< ~counter~0 9)} is VALID [2022-02-20 17:31:43,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {3701#true} assume true; {3701#true} is VALID [2022-02-20 17:31:43,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2022-02-20 17:31:43,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2022-02-20 17:31:43,090 INFO L272 TraceCheckUtils]: 11: Hoare triple {3892#(< ~counter~0 9)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {3701#true} is VALID [2022-02-20 17:31:43,093 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3701#true} {3892#(< ~counter~0 9)} #74#return; {3892#(< ~counter~0 9)} is VALID [2022-02-20 17:31:43,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {3701#true} assume true; {3701#true} is VALID [2022-02-20 17:31:43,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2022-02-20 17:31:43,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2022-02-20 17:31:43,093 INFO L272 TraceCheckUtils]: 6: Hoare triple {3892#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {3701#true} is VALID [2022-02-20 17:31:43,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {3892#(< ~counter~0 9)} assume !!(main_#t~post6#1 < 10);havoc main_#t~post6#1; {3892#(< ~counter~0 9)} is VALID [2022-02-20 17:31:43,107 INFO L290 TraceCheckUtils]: 4: Hoare triple {3947#(< ~counter~0 8)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {3892#(< ~counter~0 9)} is VALID [2022-02-20 17:31:43,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {3947#(< ~counter~0 8)} assume { :end_inline_assume_abort_if_not } true;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; {3947#(< ~counter~0 8)} is VALID [2022-02-20 17:31:43,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {3947#(< ~counter~0 8)} assume !(0 == assume_abort_if_not_~cond#1); {3947#(< ~counter~0 8)} is VALID [2022-02-20 17:31:43,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {3947#(< ~counter~0 8)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#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;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3947#(< ~counter~0 8)} is VALID [2022-02-20 17:31:43,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {3701#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3947#(< ~counter~0 8)} is VALID [2022-02-20 17:31:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:31:43,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:43,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429341573] [2022-02-20 17:31:43,110 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:43,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688045942] [2022-02-20 17:31:43,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688045942] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:31:43,110 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:31:43,110 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-02-20 17:31:43,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964991625] [2022-02-20 17:31:43,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:31:43,110 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 42 [2022-02-20 17:31:43,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:43,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:31:43,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:43,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:31:43,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:43,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:31:43,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:31:43,156 INFO L87 Difference]: Start difference. First operand 147 states and 178 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:31:46,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:46,012 INFO L93 Difference]: Finished difference Result 274 states and 339 transitions. [2022-02-20 17:31:46,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:31:46,013 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 42 [2022-02-20 17:31:46,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:31:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 169 transitions. [2022-02-20 17:31:46,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:31:46,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 169 transitions. [2022-02-20 17:31:46,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 169 transitions. [2022-02-20 17:31:46,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:46,180 INFO L225 Difference]: With dead ends: 274 [2022-02-20 17:31:46,180 INFO L226 Difference]: Without dead ends: 250 [2022-02-20 17:31:46,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:31:46,181 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 137 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:46,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 271 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 17:31:46,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-02-20 17:31:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 243. [2022-02-20 17:31:46,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:46,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand has 243 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 169 states have internal predecessors, (190), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (52), 45 states have call predecessors, (52), 52 states have call successors, (52) [2022-02-20 17:31:46,280 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand has 243 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 169 states have internal predecessors, (190), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (52), 45 states have call predecessors, (52), 52 states have call successors, (52) [2022-02-20 17:31:46,280 INFO L87 Difference]: Start difference. First operand 250 states. Second operand has 243 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 169 states have internal predecessors, (190), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (52), 45 states have call predecessors, (52), 52 states have call successors, (52) [2022-02-20 17:31:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:46,287 INFO L93 Difference]: Finished difference Result 250 states and 302 transitions. [2022-02-20 17:31:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 302 transitions. [2022-02-20 17:31:46,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:46,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:46,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 169 states have internal predecessors, (190), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (52), 45 states have call predecessors, (52), 52 states have call successors, (52) Second operand 250 states. [2022-02-20 17:31:46,289 INFO L87 Difference]: Start difference. First operand has 243 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 169 states have internal predecessors, (190), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (52), 45 states have call predecessors, (52), 52 states have call successors, (52) Second operand 250 states. [2022-02-20 17:31:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:46,296 INFO L93 Difference]: Finished difference Result 250 states and 302 transitions. [2022-02-20 17:31:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 302 transitions. [2022-02-20 17:31:46,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:46,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:46,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:46,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 169 states have internal predecessors, (190), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (52), 45 states have call predecessors, (52), 52 states have call successors, (52) [2022-02-20 17:31:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 298 transitions. [2022-02-20 17:31:46,303 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 298 transitions. Word has length 42 [2022-02-20 17:31:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:46,303 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 298 transitions. [2022-02-20 17:31:46,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:31:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 298 transitions. [2022-02-20 17:31:46,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 17:31:46,304 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:46,304 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:46,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 17:31:46,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:46,515 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:46,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:46,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1108171762, now seen corresponding path program 1 times [2022-02-20 17:31:46,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:46,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477177976] [2022-02-20 17:31:46,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:46,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:46,524 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:46,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1512347866] [2022-02-20 17:31:46,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:46,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:46,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:46,526 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:31:46,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process