./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i --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/divbin_unwindbound20.i -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 7e073a4c36b82f2b6062e496bb836cd3d16667ec7228f4ab2b6689e74fa81265 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:18:54,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:18:54,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:18:54,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:18:54,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:18:54,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:18:54,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:18:54,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:18:54,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:18:54,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:18:54,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:18:54,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:18:54,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:18:54,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:18:54,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:18:54,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:18:54,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:18:54,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:18:54,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:18:54,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:18:54,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:18:54,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:18:54,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:18:54,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:18:54,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:18:54,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:18:54,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:18:54,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:18:54,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:18:54,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:18:54,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:18:54,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:18:54,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:18:54,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:18:54,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:18:54,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:18:54,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:18:54,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:18:54,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:18:54,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:18:54,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:18:54,409 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:18:54,426 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:18:54,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:18:54,427 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:18:54,427 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:18:54,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:18:54,428 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:18:54,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:18:54,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:18:54,429 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:18:54,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:18:54,430 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:18:54,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:18:54,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:18:54,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:18:54,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:18:54,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:18:54,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:18:54,431 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:18:54,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:18:54,431 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:18:54,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:18:54,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:18:54,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:18:54,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:18:54,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:18:54,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:18:54,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:18:54,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:18:54,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:18:54,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:18:54,434 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:18:54,434 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:18:54,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:18:54,434 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 -> 7e073a4c36b82f2b6062e496bb836cd3d16667ec7228f4ab2b6689e74fa81265 [2022-02-20 17:18:54,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:18:54,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:18:54,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:18:54,673 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:18:54,674 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:18:54,675 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i [2022-02-20 17:18:54,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4304c137/5f2da6bdbe1f430ca13d92a176255d58/FLAG441b2671a [2022-02-20 17:18:55,101 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:18:55,102 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i [2022-02-20 17:18:55,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4304c137/5f2da6bdbe1f430ca13d92a176255d58/FLAG441b2671a [2022-02-20 17:18:55,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4304c137/5f2da6bdbe1f430ca13d92a176255d58 [2022-02-20 17:18:55,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:18:55,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:18:55,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:18:55,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:18:55,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:18:55,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:18:55" (1/1) ... [2022-02-20 17:18:55,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669380a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:55, skipping insertion in model container [2022-02-20 17:18:55,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:18:55" (1/1) ... [2022-02-20 17:18:55,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:18:55,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:18:55,295 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/divbin_unwindbound20.i[950,963] [2022-02-20 17:18:55,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:18:55,322 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:18:55,339 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/divbin_unwindbound20.i[950,963] [2022-02-20 17:18:55,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:18:55,353 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:18:55,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:55 WrapperNode [2022-02-20 17:18:55,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:18:55,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:18:55,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:18:55,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:18:55,363 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:18:55" (1/1) ... [2022-02-20 17:18:55,368 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:18:55" (1/1) ... [2022-02-20 17:18:55,391 INFO L137 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-02-20 17:18:55,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:18:55,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:18:55,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:18:55,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:18:55,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:55" (1/1) ... [2022-02-20 17:18:55,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:55" (1/1) ... [2022-02-20 17:18:55,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:55" (1/1) ... [2022-02-20 17:18:55,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:55" (1/1) ... [2022-02-20 17:18:55,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:55" (1/1) ... [2022-02-20 17:18:55,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:55" (1/1) ... [2022-02-20 17:18:55,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:55" (1/1) ... [2022-02-20 17:18:55,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:18:55,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:18:55,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:18:55,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:18:55,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:55" (1/1) ... [2022-02-20 17:18:55,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:18:55,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:18:55,454 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:18:55,460 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:18:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:18:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:18:55,482 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:18:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:18:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:18:55,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:18:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:18:55,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:18:55,526 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:18:55,527 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:18:55,691 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:18:55,727 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:18:55,727 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:18:55,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:18:55 BoogieIcfgContainer [2022-02-20 17:18:55,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:18:55,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:18:55,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:18:55,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:18:55,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:18:55" (1/3) ... [2022-02-20 17:18:55,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a66ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:18:55, skipping insertion in model container [2022-02-20 17:18:55,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:55" (2/3) ... [2022-02-20 17:18:55,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a66ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:18:55, skipping insertion in model container [2022-02-20 17:18:55,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:18:55" (3/3) ... [2022-02-20 17:18:55,735 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound20.i [2022-02-20 17:18:55,738 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:18:55,739 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:18:55,789 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:18:55,795 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:18:55,796 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:18:55,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:18:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:18:55,821 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:18:55,822 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:18:55,822 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:18:55,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:18:55,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1267887399, now seen corresponding path program 1 times [2022-02-20 17:18:55,834 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:18:55,835 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516590062] [2022-02-20 17:18:55,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:55,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:18:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:55,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:18:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:56,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-02-20 17:18:56,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-02-20 17:18:56,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-02-20 17:18:56,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #73#return; {32#false} is VALID [2022-02-20 17:18:56,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 17:18:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:56,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-02-20 17:18:56,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-02-20 17:18:56,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-02-20 17:18:56,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {32#false} #75#return; {32#false} is VALID [2022-02-20 17:18:56,038 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);~counter~0 := 0; {31#true} is VALID [2022-02-20 17:18:56,038 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~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {31#true} is VALID [2022-02-20 17:18:56,038 INFO L272 TraceCheckUtils]: 2: Hoare triple {31#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {31#true} is VALID [2022-02-20 17:18:56,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-02-20 17:18:56,039 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-02-20 17:18:56,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#false} assume true; {32#false} is VALID [2022-02-20 17:18:56,039 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {32#false} {31#true} #73#return; {32#false} is VALID [2022-02-20 17:18:56,039 INFO L272 TraceCheckUtils]: 7: Hoare triple {32#false} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {31#true} is VALID [2022-02-20 17:18:56,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-02-20 17:18:56,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-02-20 17:18:56,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#false} assume true; {32#false} is VALID [2022-02-20 17:18:56,053 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {32#false} {32#false} #75#return; {32#false} is VALID [2022-02-20 17:18:56,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {32#false} is VALID [2022-02-20 17:18:56,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:18:56,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:18:56,054 INFO L272 TraceCheckUtils]: 15: Hoare triple {32#false} 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)); {32#false} is VALID [2022-02-20 17:18:56,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-02-20 17:18:56,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-02-20 17:18:56,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 17:18:56,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:18:56,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:18:56,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516590062] [2022-02-20 17:18:56,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516590062] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:18:56,057 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:18:56,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:18:56,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803332684] [2022-02-20 17:18:56,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:18:56,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-02-20 17:18:56,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:18:56,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:56,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:56,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:18:56,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:18:56,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:18:56,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:18:56,124 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:56,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:56,196 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-02-20 17:18:56,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:18:56,197 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-02-20 17:18:56,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:18:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2022-02-20 17:18:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2022-02-20 17:18:56,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2022-02-20 17:18:56,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:56,317 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:18:56,318 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:18:56,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:18:56,325 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:18:56,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:18:56,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:18:56,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:18:56,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:18:56,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:18:56,354 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:18:56,354 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:18:56,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:56,358 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-02-20 17:18:56,358 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-02-20 17:18:56,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:56,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:56,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-02-20 17:18:56,363 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-02-20 17:18:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:56,366 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-02-20 17:18:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-02-20 17:18:56,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:56,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:56,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:18:56,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:18:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:18:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-02-20 17:18:56,377 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 19 [2022-02-20 17:18:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:18:56,377 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-02-20 17:18:56,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-02-20 17:18:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 17:18:56,378 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:18:56,379 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:18:56,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:18:56,380 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:18:56,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:18:56,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1485611193, now seen corresponding path program 1 times [2022-02-20 17:18:56,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:18:56,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362589053] [2022-02-20 17:18:56,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:56,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:18:56,419 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:18:56,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790507658] [2022-02-20 17:18:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:56,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:56,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:18:56,422 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:18:56,422 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:18:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:56,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:18:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:56,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:18:56,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {190#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);~counter~0 := 0; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:56,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:56,638 INFO L272 TraceCheckUtils]: 2: Hoare triple {195#(<= ~counter~0 0)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:56,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {195#(<= ~counter~0 0)} ~cond := #in~cond; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:56,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {195#(<= ~counter~0 0)} assume !(0 == ~cond); {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:56,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {195#(<= ~counter~0 0)} assume true; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:56,640 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {195#(<= ~counter~0 0)} {195#(<= ~counter~0 0)} #73#return; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:56,640 INFO L272 TraceCheckUtils]: 7: Hoare triple {195#(<= ~counter~0 0)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:56,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {195#(<= ~counter~0 0)} ~cond := #in~cond; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:56,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {195#(<= ~counter~0 0)} assume !(0 == ~cond); {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:56,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {195#(<= ~counter~0 0)} assume true; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:56,642 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {195#(<= ~counter~0 0)} {195#(<= ~counter~0 0)} #75#return; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:56,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {195#(<= ~counter~0 0)} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {195#(<= ~counter~0 0)} is VALID [2022-02-20 17:18:56,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {195#(<= ~counter~0 0)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {235#(<= |ULTIMATE.start_main_#t~post3#1| 0)} is VALID [2022-02-20 17:18:56,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#(<= |ULTIMATE.start_main_#t~post3#1| 0)} assume !(main_#t~post3#1 < 20);havoc main_#t~post3#1; {191#false} is VALID [2022-02-20 17:18:56,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {191#false} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {191#false} is VALID [2022-02-20 17:18:56,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {191#false} assume !!(main_#t~post4#1 < 20);havoc main_#t~post4#1; {191#false} is VALID [2022-02-20 17:18:56,645 INFO L272 TraceCheckUtils]: 17: Hoare triple {191#false} 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)); {191#false} is VALID [2022-02-20 17:18:56,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2022-02-20 17:18:56,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID [2022-02-20 17:18:56,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-02-20 17:18:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:18:56,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:18:56,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:18:56,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362589053] [2022-02-20 17:18:56,646 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:18:56,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790507658] [2022-02-20 17:18:56,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790507658] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:18:56,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:18:56,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:18:56,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884212204] [2022-02-20 17:18:56,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:18:56,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-02-20 17:18:56,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:18:56,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:18:56,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:56,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:18:56,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:18:56,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:18:56,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:18:56,678 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:18:56,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:56,749 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-02-20 17:18:56,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:18:56,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-02-20 17:18:56,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:18:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:18:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-02-20 17:18:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:18:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-02-20 17:18:56,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2022-02-20 17:18:56,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:56,787 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:18:56,787 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 17:18:56,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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:18:56,788 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 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:18:56,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:18:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 17:18:56,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 17:18:56,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:18:56,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:18:56,794 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:18:56,795 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:18:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:56,796 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 17:18:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 17:18:56,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:56,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:56,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-02-20 17:18:56,797 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-02-20 17:18:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:56,798 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 17:18:56,799 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 17:18:56,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:56,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:56,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:18:56,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:18:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:18:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-02-20 17:18:56,801 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 21 [2022-02-20 17:18:56,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:18:56,801 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-02-20 17:18:56,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:18:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 17:18:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 17:18:56,802 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:18:56,802 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:18:56,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:18:57,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:57,016 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:18:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:18:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1580975129, now seen corresponding path program 1 times [2022-02-20 17:18:57,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:18:57,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799433094] [2022-02-20 17:18:57,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:57,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:18:57,028 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:18:57,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [470299111] [2022-02-20 17:18:57,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:57,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:57,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:18:57,045 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:18:57,046 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:18:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:57,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 17:18:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:57,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:18:57,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {391#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);~counter~0 := 0; {391#true} is VALID [2022-02-20 17:18:57,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {391#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {391#true} is VALID [2022-02-20 17:18:57,958 INFO L272 TraceCheckUtils]: 2: Hoare triple {391#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {391#true} is VALID [2022-02-20 17:18:57,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {391#true} ~cond := #in~cond; {405#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:18:57,963 INFO L290 TraceCheckUtils]: 4: Hoare triple {405#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {409#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:18:57,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {409#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {409#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:18:57,965 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {409#(not (= |assume_abort_if_not_#in~cond| 0))} {391#true} #73#return; {416#(< (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 2147483647)} is VALID [2022-02-20 17:18:57,965 INFO L272 TraceCheckUtils]: 7: Hoare triple {416#(< (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 2147483647)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {391#true} is VALID [2022-02-20 17:18:57,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#true} ~cond := #in~cond; {391#true} is VALID [2022-02-20 17:18:57,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#true} assume !(0 == ~cond); {391#true} is VALID [2022-02-20 17:18:57,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {391#true} assume true; {391#true} is VALID [2022-02-20 17:18:57,966 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {391#true} {416#(< (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 2147483647)} #75#return; {416#(< (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 2147483647)} is VALID [2022-02-20 17:18:57,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {416#(< (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 2147483647)} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {435#(and (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |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:18:57,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {435#(and (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {435#(and (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |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:18:57,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {435#(and (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {435#(and (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |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:18:57,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {435#(and (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |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_~b~0#1 % 4294967296); {445#(and (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |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:18:57,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {445#(and (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {445#(and (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |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:18:57,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {445#(and (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post4#1 < 20);havoc main_#t~post4#1; {445#(and (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |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:18:57,970 INFO L272 TraceCheckUtils]: 18: Hoare triple {445#(and (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (< (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 2147483647) (= |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)); {455#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:18:57,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {455#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {459#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:18:57,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {459#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {392#false} is VALID [2022-02-20 17:18:57,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {392#false} assume !false; {392#false} is VALID [2022-02-20 17:18:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:18:57,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:18:58,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {392#false} assume !false; {392#false} is VALID [2022-02-20 17:18:58,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {459#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {392#false} is VALID [2022-02-20 17:18:58,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {455#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {459#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:18:58,375 INFO L272 TraceCheckUtils]: 18: Hoare triple {475#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} 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)); {455#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:18:58,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {475#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} assume !!(main_#t~post4#1 < 20);havoc main_#t~post4#1; {475#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} is VALID [2022-02-20 17:18:58,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {475#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {475#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} is VALID [2022-02-20 17:18:58,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {485#(or (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {475#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} is VALID [2022-02-20 17:18:58,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {485#(or (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {485#(or (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:18:58,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {485#(or (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {485#(or (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:18:58,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {391#true} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {485#(or (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:18:58,378 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {391#true} {391#true} #75#return; {391#true} is VALID [2022-02-20 17:18:58,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {391#true} assume true; {391#true} is VALID [2022-02-20 17:18:58,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#true} assume !(0 == ~cond); {391#true} is VALID [2022-02-20 17:18:58,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#true} ~cond := #in~cond; {391#true} is VALID [2022-02-20 17:18:58,378 INFO L272 TraceCheckUtils]: 7: Hoare triple {391#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {391#true} is VALID [2022-02-20 17:18:58,378 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {391#true} {391#true} #73#return; {391#true} is VALID [2022-02-20 17:18:58,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {391#true} assume true; {391#true} is VALID [2022-02-20 17:18:58,379 INFO L290 TraceCheckUtils]: 4: Hoare triple {391#true} assume !(0 == ~cond); {391#true} is VALID [2022-02-20 17:18:58,379 INFO L290 TraceCheckUtils]: 3: Hoare triple {391#true} ~cond := #in~cond; {391#true} is VALID [2022-02-20 17:18:58,379 INFO L272 TraceCheckUtils]: 2: Hoare triple {391#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {391#true} is VALID [2022-02-20 17:18:58,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {391#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {391#true} is VALID [2022-02-20 17:18:58,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {391#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);~counter~0 := 0; {391#true} is VALID [2022-02-20 17:18:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:18:58,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:18:58,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799433094] [2022-02-20 17:18:58,380 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:18:58,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470299111] [2022-02-20 17:18:58,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470299111] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:18:58,380 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:18:58,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-02-20 17:18:58,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438445067] [2022-02-20 17:18:58,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:18:58,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 17:18:58,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:18:58,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:18:58,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:58,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:18:58,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:18:58,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:18:58,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:18:58,395 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:19:00,575 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:19:02,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:19:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:02,753 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-02-20 17:19:02,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:19:02,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 17:19:02,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:02,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:19:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 17:19:02,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:19:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-02-20 17:19:02,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-02-20 17:19:02,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:02,905 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:19:02,905 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 17:19:02,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:19:02,906 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:19:02,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 90 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-02-20 17:19:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 17:19:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-02-20 17:19:02,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:02,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:02,917 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:02,917 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:02,919 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-02-20 17:19:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-02-20 17:19:02,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:02,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:02,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-02-20 17:19:02,920 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-02-20 17:19:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:02,923 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-02-20 17:19:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-02-20 17:19:02,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:02,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:02,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:02,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-02-20 17:19:02,926 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 22 [2022-02-20 17:19:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:02,926 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-02-20 17:19:02,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:19:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-02-20 17:19:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:19:02,927 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:02,927 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:02,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 17:19:03,151 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,SelfDestructingSolverStorable2 [2022-02-20 17:19:03,152 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:03,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:03,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1106421036, now seen corresponding path program 1 times [2022-02-20 17:19:03,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:03,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410386873] [2022-02-20 17:19:03,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:03,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:03,164 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:03,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929237271] [2022-02-20 17:19:03,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:03,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:03,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:03,173 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:19:03,174 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:19:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:03,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:19:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:03,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:19:03,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {696#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);~counter~0 := 0; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:03,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:03,319 INFO L272 TraceCheckUtils]: 2: Hoare triple {701#(<= ~counter~0 0)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:03,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {701#(<= ~counter~0 0)} ~cond := #in~cond; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:03,320 INFO L290 TraceCheckUtils]: 4: Hoare triple {701#(<= ~counter~0 0)} assume !(0 == ~cond); {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:03,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {701#(<= ~counter~0 0)} assume true; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:03,321 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {701#(<= ~counter~0 0)} {701#(<= ~counter~0 0)} #73#return; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:03,321 INFO L272 TraceCheckUtils]: 7: Hoare triple {701#(<= ~counter~0 0)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:03,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {701#(<= ~counter~0 0)} ~cond := #in~cond; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:03,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {701#(<= ~counter~0 0)} assume !(0 == ~cond); {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:03,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {701#(<= ~counter~0 0)} assume true; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:03,340 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {701#(<= ~counter~0 0)} {701#(<= ~counter~0 0)} #75#return; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:03,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {701#(<= ~counter~0 0)} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {701#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:03,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {701#(<= ~counter~0 0)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {741#(<= ~counter~0 1)} is VALID [2022-02-20 17:19:03,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {741#(<= ~counter~0 1)} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {741#(<= ~counter~0 1)} is VALID [2022-02-20 17:19:03,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {741#(<= ~counter~0 1)} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {741#(<= ~counter~0 1)} is VALID [2022-02-20 17:19:03,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {741#(<= ~counter~0 1)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {751#(<= |ULTIMATE.start_main_#t~post3#1| 1)} is VALID [2022-02-20 17:19:03,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {751#(<= |ULTIMATE.start_main_#t~post3#1| 1)} assume !(main_#t~post3#1 < 20);havoc main_#t~post3#1; {697#false} is VALID [2022-02-20 17:19:03,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {697#false} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {697#false} is VALID [2022-02-20 17:19:03,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {697#false} assume !!(main_#t~post4#1 < 20);havoc main_#t~post4#1; {697#false} is VALID [2022-02-20 17:19:03,343 INFO L272 TraceCheckUtils]: 20: Hoare triple {697#false} 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)); {697#false} is VALID [2022-02-20 17:19:03,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {697#false} ~cond := #in~cond; {697#false} is VALID [2022-02-20 17:19:03,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {697#false} assume 0 == ~cond; {697#false} is VALID [2022-02-20 17:19:03,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {697#false} assume !false; {697#false} is VALID [2022-02-20 17:19:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:19:03,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:19:03,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {697#false} assume !false; {697#false} is VALID [2022-02-20 17:19:03,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {697#false} assume 0 == ~cond; {697#false} is VALID [2022-02-20 17:19:03,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {697#false} ~cond := #in~cond; {697#false} is VALID [2022-02-20 17:19:03,467 INFO L272 TraceCheckUtils]: 20: Hoare triple {697#false} 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)); {697#false} is VALID [2022-02-20 17:19:03,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {697#false} assume !!(main_#t~post4#1 < 20);havoc main_#t~post4#1; {697#false} is VALID [2022-02-20 17:19:03,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {697#false} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {697#false} is VALID [2022-02-20 17:19:03,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {791#(< |ULTIMATE.start_main_#t~post3#1| 20)} assume !(main_#t~post3#1 < 20);havoc main_#t~post3#1; {697#false} is VALID [2022-02-20 17:19:03,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {795#(< ~counter~0 20)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {791#(< |ULTIMATE.start_main_#t~post3#1| 20)} is VALID [2022-02-20 17:19:03,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {795#(< ~counter~0 20)} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {795#(< ~counter~0 20)} is VALID [2022-02-20 17:19:03,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {795#(< ~counter~0 20)} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {795#(< ~counter~0 20)} is VALID [2022-02-20 17:19:03,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {805#(< ~counter~0 19)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {795#(< ~counter~0 20)} is VALID [2022-02-20 17:19:03,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {805#(< ~counter~0 19)} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {805#(< ~counter~0 19)} is VALID [2022-02-20 17:19:03,478 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {696#true} {805#(< ~counter~0 19)} #75#return; {805#(< ~counter~0 19)} is VALID [2022-02-20 17:19:03,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {696#true} assume true; {696#true} is VALID [2022-02-20 17:19:03,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {696#true} assume !(0 == ~cond); {696#true} is VALID [2022-02-20 17:19:03,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {696#true} ~cond := #in~cond; {696#true} is VALID [2022-02-20 17:19:03,478 INFO L272 TraceCheckUtils]: 7: Hoare triple {805#(< ~counter~0 19)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {696#true} is VALID [2022-02-20 17:19:03,479 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {696#true} {805#(< ~counter~0 19)} #73#return; {805#(< ~counter~0 19)} is VALID [2022-02-20 17:19:03,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {696#true} assume true; {696#true} is VALID [2022-02-20 17:19:03,479 INFO L290 TraceCheckUtils]: 4: Hoare triple {696#true} assume !(0 == ~cond); {696#true} is VALID [2022-02-20 17:19:03,479 INFO L290 TraceCheckUtils]: 3: Hoare triple {696#true} ~cond := #in~cond; {696#true} is VALID [2022-02-20 17:19:03,479 INFO L272 TraceCheckUtils]: 2: Hoare triple {805#(< ~counter~0 19)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {696#true} is VALID [2022-02-20 17:19:03,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {805#(< ~counter~0 19)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {805#(< ~counter~0 19)} is VALID [2022-02-20 17:19:03,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {696#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);~counter~0 := 0; {805#(< ~counter~0 19)} is VALID [2022-02-20 17:19:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:19:03,480 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:03,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410386873] [2022-02-20 17:19:03,480 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:19:03,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929237271] [2022-02-20 17:19:03,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929237271] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:19:03,481 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:19:03,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:19:03,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488036761] [2022-02-20 17:19:03,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:19:03,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2022-02-20 17:19:03,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:03,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:03,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:03,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:19:03,509 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:03,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:19:03,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:19:03,510 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:03,740 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2022-02-20 17:19:03,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:19:03,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2022-02-20 17:19:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:03,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-02-20 17:19:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-02-20 17:19:03,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 88 transitions. [2022-02-20 17:19:03,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:03,831 INFO L225 Difference]: With dead ends: 69 [2022-02-20 17:19:03,831 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 17:19:03,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:19:03,832 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 41 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:19:03,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 116 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:19:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 17:19:03,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2022-02-20 17:19:03,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:03,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:03,841 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:03,841 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:03,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:03,843 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-02-20 17:19:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-02-20 17:19:03,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:03,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:03,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 57 states. [2022-02-20 17:19:03,844 INFO L87 Difference]: Start difference. First operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 57 states. [2022-02-20 17:19:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:03,846 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-02-20 17:19:03,846 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-02-20 17:19:03,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:03,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:03,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:03,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:19:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2022-02-20 17:19:03,848 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 24 [2022-02-20 17:19:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:03,848 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-02-20 17:19:03,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-02-20 17:19:03,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:19:03,849 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:03,849 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:03,868 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:19:04,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:04,065 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:04,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:04,066 INFO L85 PathProgramCache]: Analyzing trace with hash -450968108, now seen corresponding path program 1 times [2022-02-20 17:19:04,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:04,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668599293] [2022-02-20 17:19:04,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:04,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:04,079 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:04,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272940411] [2022-02-20 17:19:04,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:04,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:04,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:04,081 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:19:04,082 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:19:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:04,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 17:19:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:04,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:19:04,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {1108#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);~counter~0 := 0; {1108#true} is VALID [2022-02-20 17:19:04,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {1108#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1108#true} is VALID [2022-02-20 17:19:04,674 INFO L272 TraceCheckUtils]: 2: Hoare triple {1108#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {1108#true} is VALID [2022-02-20 17:19:04,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {1108#true} ~cond := #in~cond; {1108#true} is VALID [2022-02-20 17:19:04,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {1108#true} assume !(0 == ~cond); {1108#true} is VALID [2022-02-20 17:19:04,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {1108#true} assume true; {1108#true} is VALID [2022-02-20 17:19:04,674 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1108#true} {1108#true} #73#return; {1108#true} is VALID [2022-02-20 17:19:04,674 INFO L272 TraceCheckUtils]: 7: Hoare triple {1108#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {1108#true} is VALID [2022-02-20 17:19:04,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {1108#true} ~cond := #in~cond; {1137#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:19:04,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1141#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:19:04,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {1141#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1141#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:19:04,676 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1141#(not (= |assume_abort_if_not_#in~cond| 0))} {1108#true} #75#return; {1148#(<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))} is VALID [2022-02-20 17:19:04,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {1148#(<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {1152#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 4294967296)) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:19:04,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {1152#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 4294967296)) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1152#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 4294967296)) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:19:04,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {1152#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 4294967296)) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {1152#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 4294967296)) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:19:04,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {1152#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 4294967296)) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} is VALID [2022-02-20 17:19:04,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} is VALID [2022-02-20 17:19:04,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} is VALID [2022-02-20 17:19:04,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} is VALID [2022-02-20 17:19:04,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} is VALID [2022-02-20 17:19:04,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} assume !!(main_#t~post4#1 < 20);havoc main_#t~post4#1; {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 1))} is VALID [2022-02-20 17:19:04,681 INFO L272 TraceCheckUtils]: 21: Hoare triple {1162#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (< (div (+ (- 1) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (- 4294967296)) 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)); {1181#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:19:04,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {1181#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1185#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:19:04,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {1185#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1109#false} is VALID [2022-02-20 17:19:04,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2022-02-20 17:19:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:19:04,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:19:05,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2022-02-20 17:19:05,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {1185#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1109#false} is VALID [2022-02-20 17:19:05,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {1181#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1185#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:19:05,220 INFO L272 TraceCheckUtils]: 21: Hoare triple {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} 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)); {1181#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:19:05,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} assume !!(main_#t~post4#1 < 20);havoc main_#t~post4#1; {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:19:05,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:19:05,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:19:05,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:19:05,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:19:05,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {1220#(or (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))))} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {1201#(forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:19:05,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {1220#(or (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))))} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {1220#(or (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))))} is VALID [2022-02-20 17:19:05,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {1220#(or (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))))} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1220#(or (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))))} is VALID [2022-02-20 17:19:05,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {1108#true} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {1220#(or (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (forall ((|ULTIMATE.start_main_~b~0#1| Int)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))))} is VALID [2022-02-20 17:19:05,225 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1108#true} {1108#true} #75#return; {1108#true} is VALID [2022-02-20 17:19:05,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {1108#true} assume true; {1108#true} is VALID [2022-02-20 17:19:05,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {1108#true} assume !(0 == ~cond); {1108#true} is VALID [2022-02-20 17:19:05,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {1108#true} ~cond := #in~cond; {1108#true} is VALID [2022-02-20 17:19:05,225 INFO L272 TraceCheckUtils]: 7: Hoare triple {1108#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {1108#true} is VALID [2022-02-20 17:19:05,226 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1108#true} {1108#true} #73#return; {1108#true} is VALID [2022-02-20 17:19:05,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {1108#true} assume true; {1108#true} is VALID [2022-02-20 17:19:05,226 INFO L290 TraceCheckUtils]: 4: Hoare triple {1108#true} assume !(0 == ~cond); {1108#true} is VALID [2022-02-20 17:19:05,226 INFO L290 TraceCheckUtils]: 3: Hoare triple {1108#true} ~cond := #in~cond; {1108#true} is VALID [2022-02-20 17:19:05,226 INFO L272 TraceCheckUtils]: 2: Hoare triple {1108#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {1108#true} is VALID [2022-02-20 17:19:05,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {1108#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1108#true} is VALID [2022-02-20 17:19:05,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {1108#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);~counter~0 := 0; {1108#true} is VALID [2022-02-20 17:19:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:19:05,226 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:05,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668599293] [2022-02-20 17:19:05,226 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:19:05,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272940411] [2022-02-20 17:19:05,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272940411] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:19:05,227 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:19:05,227 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-02-20 17:19:05,227 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008175134] [2022-02-20 17:19:05,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:19:05,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 17:19:05,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:05,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:19:07,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 21 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:07,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:19:07,282 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:07,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:19:07,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:19:07,283 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:19:08,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:08,115 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-02-20 17:19:08,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:19:08,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 17:19:08,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:19:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-02-20 17:19:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:19:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-02-20 17:19:08,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-02-20 17:19:09,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:09,991 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:19:09,991 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 17:19:09,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:19:09,992 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 9 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:19:09,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 138 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-02-20 17:19:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 17:19:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-02-20 17:19:10,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:10,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:19:10,007 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:19:10,007 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:19:10,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:10,009 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-02-20 17:19:10,009 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-02-20 17:19:10,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:10,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:10,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-02-20 17:19:10,010 INFO L87 Difference]: Start difference. First operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-02-20 17:19:10,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:10,012 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-02-20 17:19:10,012 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-02-20 17:19:10,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:10,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:10,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:10,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:19:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-02-20 17:19:10,015 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 25 [2022-02-20 17:19:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:10,015 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-02-20 17:19:10,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:19:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-02-20 17:19:10,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:19:10,016 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:10,016 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:10,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 17:19:10,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:10,223 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash -452755568, now seen corresponding path program 1 times [2022-02-20 17:19:10,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:10,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448219464] [2022-02-20 17:19:10,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:10,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:10,236 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:10,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [797170371] [2022-02-20 17:19:10,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:10,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:10,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:10,237 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:19:10,238 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:19:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:10,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:19:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:10,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:19:10,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {1503#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);~counter~0 := 0; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:10,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {1508#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:10,435 INFO L272 TraceCheckUtils]: 2: Hoare triple {1508#(<= ~counter~0 0)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:10,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {1508#(<= ~counter~0 0)} ~cond := #in~cond; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:10,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {1508#(<= ~counter~0 0)} assume !(0 == ~cond); {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:10,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {1508#(<= ~counter~0 0)} assume true; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:10,437 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1508#(<= ~counter~0 0)} {1508#(<= ~counter~0 0)} #73#return; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:10,437 INFO L272 TraceCheckUtils]: 7: Hoare triple {1508#(<= ~counter~0 0)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:10,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {1508#(<= ~counter~0 0)} ~cond := #in~cond; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:10,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {1508#(<= ~counter~0 0)} assume !(0 == ~cond); {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:10,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {1508#(<= ~counter~0 0)} assume true; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:10,439 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1508#(<= ~counter~0 0)} {1508#(<= ~counter~0 0)} #75#return; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:10,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {1508#(<= ~counter~0 0)} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {1508#(<= ~counter~0 0)} is VALID [2022-02-20 17:19:10,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {1508#(<= ~counter~0 0)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1548#(<= ~counter~0 1)} is VALID [2022-02-20 17:19:10,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {1548#(<= ~counter~0 1)} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {1548#(<= ~counter~0 1)} is VALID [2022-02-20 17:19:10,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {1548#(<= ~counter~0 1)} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {1548#(<= ~counter~0 1)} is VALID [2022-02-20 17:19:10,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {1548#(<= ~counter~0 1)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1558#(<= ~counter~0 2)} is VALID [2022-02-20 17:19:10,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {1558#(<= ~counter~0 2)} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {1558#(<= ~counter~0 2)} is VALID [2022-02-20 17:19:10,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {1558#(<= ~counter~0 2)} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {1558#(<= ~counter~0 2)} is VALID [2022-02-20 17:19:10,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {1558#(<= ~counter~0 2)} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {1568#(<= |ULTIMATE.start_main_#t~post4#1| 2)} is VALID [2022-02-20 17:19:10,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {1568#(<= |ULTIMATE.start_main_#t~post4#1| 2)} assume !(main_#t~post4#1 < 20);havoc main_#t~post4#1; {1504#false} is VALID [2022-02-20 17:19:10,443 INFO L272 TraceCheckUtils]: 21: Hoare triple {1504#false} 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)); {1504#false} is VALID [2022-02-20 17:19:10,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {1504#false} ~cond := #in~cond; {1504#false} is VALID [2022-02-20 17:19:10,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#false} assume 0 == ~cond; {1504#false} is VALID [2022-02-20 17:19:10,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#false} assume !false; {1504#false} is VALID [2022-02-20 17:19:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:19:10,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:19:10,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#false} assume !false; {1504#false} is VALID [2022-02-20 17:19:10,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#false} assume 0 == ~cond; {1504#false} is VALID [2022-02-20 17:19:10,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {1504#false} ~cond := #in~cond; {1504#false} is VALID [2022-02-20 17:19:10,589 INFO L272 TraceCheckUtils]: 21: Hoare triple {1504#false} 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)); {1504#false} is VALID [2022-02-20 17:19:10,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {1596#(< |ULTIMATE.start_main_#t~post4#1| 20)} assume !(main_#t~post4#1 < 20);havoc main_#t~post4#1; {1504#false} is VALID [2022-02-20 17:19:10,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {1600#(< ~counter~0 20)} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {1596#(< |ULTIMATE.start_main_#t~post4#1| 20)} is VALID [2022-02-20 17:19:10,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {1600#(< ~counter~0 20)} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {1600#(< ~counter~0 20)} is VALID [2022-02-20 17:19:10,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {1600#(< ~counter~0 20)} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {1600#(< ~counter~0 20)} is VALID [2022-02-20 17:19:10,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {1610#(< ~counter~0 19)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1600#(< ~counter~0 20)} is VALID [2022-02-20 17:19:10,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {1610#(< ~counter~0 19)} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {1610#(< ~counter~0 19)} is VALID [2022-02-20 17:19:10,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {1610#(< ~counter~0 19)} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {1610#(< ~counter~0 19)} is VALID [2022-02-20 17:19:10,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {1620#(< ~counter~0 18)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {1610#(< ~counter~0 19)} is VALID [2022-02-20 17:19:10,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {1620#(< ~counter~0 18)} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {1620#(< ~counter~0 18)} is VALID [2022-02-20 17:19:10,594 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1503#true} {1620#(< ~counter~0 18)} #75#return; {1620#(< ~counter~0 18)} is VALID [2022-02-20 17:19:10,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-02-20 17:19:10,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {1503#true} assume !(0 == ~cond); {1503#true} is VALID [2022-02-20 17:19:10,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {1503#true} ~cond := #in~cond; {1503#true} is VALID [2022-02-20 17:19:10,594 INFO L272 TraceCheckUtils]: 7: Hoare triple {1620#(< ~counter~0 18)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {1503#true} is VALID [2022-02-20 17:19:10,594 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1503#true} {1620#(< ~counter~0 18)} #73#return; {1620#(< ~counter~0 18)} is VALID [2022-02-20 17:19:10,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-02-20 17:19:10,594 INFO L290 TraceCheckUtils]: 4: Hoare triple {1503#true} assume !(0 == ~cond); {1503#true} is VALID [2022-02-20 17:19:10,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {1503#true} ~cond := #in~cond; {1503#true} is VALID [2022-02-20 17:19:10,595 INFO L272 TraceCheckUtils]: 2: Hoare triple {1620#(< ~counter~0 18)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {1503#true} is VALID [2022-02-20 17:19:10,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {1620#(< ~counter~0 18)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1620#(< ~counter~0 18)} is VALID [2022-02-20 17:19:10,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {1503#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);~counter~0 := 0; {1620#(< ~counter~0 18)} is VALID [2022-02-20 17:19:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:19:10,596 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:10,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448219464] [2022-02-20 17:19:10,596 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:19:10,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797170371] [2022-02-20 17:19:10,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797170371] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:19:10,596 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:19:10,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-02-20 17:19:10,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837436265] [2022-02-20 17:19:10,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:19:10,597 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-02-20 17:19:10,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:10,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:10,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:10,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:19:10,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:10,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:19:10,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:19:10,621 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:11,451 INFO L93 Difference]: Finished difference Result 124 states and 151 transitions. [2022-02-20 17:19:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:19:11,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-02-20 17:19:11,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 116 transitions. [2022-02-20 17:19:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 116 transitions. [2022-02-20 17:19:11,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 116 transitions. [2022-02-20 17:19:11,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:11,533 INFO L225 Difference]: With dead ends: 124 [2022-02-20 17:19:11,533 INFO L226 Difference]: Without dead ends: 117 [2022-02-20 17:19:11,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 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:19:11,534 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 88 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:19:11,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 163 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:19:11,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-20 17:19:11,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2022-02-20 17:19:11,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:11,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 110 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 92 states have internal predecessors, (107), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:19:11,565 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 110 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 92 states have internal predecessors, (107), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:19:11,565 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 110 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 92 states have internal predecessors, (107), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:19:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:11,569 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2022-02-20 17:19:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2022-02-20 17:19:11,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:11,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:11,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 92 states have internal predecessors, (107), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand 117 states. [2022-02-20 17:19:11,570 INFO L87 Difference]: Start difference. First operand has 110 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 92 states have internal predecessors, (107), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand 117 states. [2022-02-20 17:19:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:11,583 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2022-02-20 17:19:11,584 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2022-02-20 17:19:11,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:11,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:11,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:11,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 92 states have internal predecessors, (107), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:19:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2022-02-20 17:19:11,591 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 25 [2022-02-20 17:19:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:11,591 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2022-02-20 17:19:11,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2022-02-20 17:19:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 17:19:11,592 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:11,593 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:11,611 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:19:11,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:11,807 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:11,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash -791365823, now seen corresponding path program 1 times [2022-02-20 17:19:11,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:11,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334846728] [2022-02-20 17:19:11,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:11,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:11,817 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:11,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [393099236] [2022-02-20 17:19:11,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:11,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:11,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:11,819 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:19:11,820 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:19:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:11,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:19:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:11,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:19:11,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {2200#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);~counter~0 := 0; {2200#true} is VALID [2022-02-20 17:19:11,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {2200#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2200#true} is VALID [2022-02-20 17:19:11,917 INFO L272 TraceCheckUtils]: 2: Hoare triple {2200#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {2200#true} is VALID [2022-02-20 17:19:11,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {2200#true} ~cond := #in~cond; {2200#true} is VALID [2022-02-20 17:19:11,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {2200#true} assume !(0 == ~cond); {2200#true} is VALID [2022-02-20 17:19:11,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {2200#true} assume true; {2200#true} is VALID [2022-02-20 17:19:11,917 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2200#true} {2200#true} #73#return; {2200#true} is VALID [2022-02-20 17:19:11,918 INFO L272 TraceCheckUtils]: 7: Hoare triple {2200#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {2200#true} is VALID [2022-02-20 17:19:11,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {2200#true} ~cond := #in~cond; {2200#true} is VALID [2022-02-20 17:19:11,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {2200#true} assume !(0 == ~cond); {2200#true} is VALID [2022-02-20 17:19:11,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {2200#true} assume true; {2200#true} is VALID [2022-02-20 17:19:11,918 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2200#true} {2200#true} #75#return; {2200#true} is VALID [2022-02-20 17:19:11,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {2200#true} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:11,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:11,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:11,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:11,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:11,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} assume !!(main_#t~post4#1 < 20);havoc main_#t~post4#1; {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:11,921 INFO L272 TraceCheckUtils]: 18: Hoare triple {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~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)); {2200#true} is VALID [2022-02-20 17:19:11,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {2200#true} ~cond := #in~cond; {2200#true} is VALID [2022-02-20 17:19:11,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {2200#true} assume !(0 == ~cond); {2200#true} is VALID [2022-02-20 17:19:11,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {2200#true} assume true; {2200#true} is VALID [2022-02-20 17:19:11,922 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2200#true} {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} #77#return; {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:11,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {2241#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} assume !!(main_~b~0#1 % 4294967296 != main_~B~0#1 % 4294967296);main_~q~0#1 := 2 * main_~q~0#1;main_~b~0#1 := (if main_~b~0#1 % 4294967296 < 0 && 0 != main_~b~0#1 % 4294967296 % 2 then 1 + main_~b~0#1 % 4294967296 / 2 else main_~b~0#1 % 4294967296 / 2); {2201#false} is VALID [2022-02-20 17:19:11,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {2201#false} assume main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296;main_~q~0#1 := 1 + main_~q~0#1;main_~r~0#1 := main_~r~0#1 - main_~b~0#1; {2201#false} is VALID [2022-02-20 17:19:11,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {2201#false} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {2201#false} is VALID [2022-02-20 17:19:11,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {2201#false} assume !!(main_#t~post4#1 < 20);havoc main_#t~post4#1; {2201#false} is VALID [2022-02-20 17:19:11,924 INFO L272 TraceCheckUtils]: 27: Hoare triple {2201#false} 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)); {2201#false} is VALID [2022-02-20 17:19:11,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {2201#false} ~cond := #in~cond; {2201#false} is VALID [2022-02-20 17:19:11,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {2201#false} assume 0 == ~cond; {2201#false} is VALID [2022-02-20 17:19:11,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {2201#false} assume !false; {2201#false} is VALID [2022-02-20 17:19:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:19:11,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:19:11,927 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:11,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334846728] [2022-02-20 17:19:11,927 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:19:11,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393099236] [2022-02-20 17:19:11,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393099236] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:19:11,927 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:19:11,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:19:11,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543368597] [2022-02-20 17:19:11,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:19:11,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-02-20 17:19:11,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:11,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:19:11,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:11,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:19:11,950 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:11,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:19:11,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:19:11,950 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:19:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:12,080 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2022-02-20 17:19:12,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:19:12,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-02-20 17:19:12,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:12,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:19:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 17:19:12,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:19:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 17:19:12,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-02-20 17:19:12,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:12,133 INFO L225 Difference]: With dead ends: 151 [2022-02-20 17:19:12,133 INFO L226 Difference]: Without dead ends: 96 [2022-02-20 17:19:12,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:19:12,135 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 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:19:12,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:19:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-20 17:19:12,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-02-20 17:19:12,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:12,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:19:12,179 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:19:12,179 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:19:12,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:12,183 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-02-20 17:19:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-02-20 17:19:12,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:12,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:12,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) Second operand 96 states. [2022-02-20 17:19:12,185 INFO L87 Difference]: Start difference. First operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) Second operand 96 states. [2022-02-20 17:19:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:12,188 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-02-20 17:19:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-02-20 17:19:12,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:12,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:12,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:12,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:19:12,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-02-20 17:19:12,192 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 31 [2022-02-20 17:19:12,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:12,192 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-02-20 17:19:12,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:19:12,193 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-02-20 17:19:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 17:19:12,195 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:12,195 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:12,214 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:19:12,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:12,412 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:12,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1505101988, now seen corresponding path program 1 times [2022-02-20 17:19:12,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:12,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664707748] [2022-02-20 17:19:12,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:12,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:12,423 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:12,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1889018400] [2022-02-20 17:19:12,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:12,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:12,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:12,429 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:19:12,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 17:19:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:12,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:19:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:12,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:19:12,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {2804#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);~counter~0 := 0; {2804#true} is VALID [2022-02-20 17:19:12,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {2804#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2804#true} is VALID [2022-02-20 17:19:12,767 INFO L272 TraceCheckUtils]: 2: Hoare triple {2804#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {2804#true} is VALID [2022-02-20 17:19:12,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-02-20 17:19:12,767 INFO L290 TraceCheckUtils]: 4: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-02-20 17:19:12,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-02-20 17:19:12,767 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2804#true} {2804#true} #73#return; {2804#true} is VALID [2022-02-20 17:19:12,767 INFO L272 TraceCheckUtils]: 7: Hoare triple {2804#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {2804#true} is VALID [2022-02-20 17:19:12,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-02-20 17:19:12,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-02-20 17:19:12,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-02-20 17:19:12,767 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2804#true} {2804#true} #75#return; {2804#true} is VALID [2022-02-20 17:19:12,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {2804#true} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {2804#true} is VALID [2022-02-20 17:19:12,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {2804#true} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {2804#true} is VALID [2022-02-20 17:19:12,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {2804#true} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {2804#true} is VALID [2022-02-20 17:19:12,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {2804#true} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {2804#true} is VALID [2022-02-20 17:19:12,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {2804#true} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {2804#true} is VALID [2022-02-20 17:19:12,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {2804#true} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {2804#true} is VALID [2022-02-20 17:19:12,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {2804#true} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {2804#true} is VALID [2022-02-20 17:19:12,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {2804#true} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {2804#true} is VALID [2022-02-20 17:19:12,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {2804#true} assume !!(main_#t~post4#1 < 20);havoc main_#t~post4#1; {2804#true} is VALID [2022-02-20 17:19:12,768 INFO L272 TraceCheckUtils]: 21: Hoare triple {2804#true} 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)); {2804#true} is VALID [2022-02-20 17:19:12,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {2804#true} ~cond := #in~cond; {2875#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:19:12,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {2875#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:19:12,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:19:12,770 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} {2804#true} #77#return; {2886#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} is VALID [2022-02-20 17:19:12,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {2886#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} assume !(main_~b~0#1 % 4294967296 != main_~B~0#1 % 4294967296); {2886#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} is VALID [2022-02-20 17:19:12,771 INFO L272 TraceCheckUtils]: 27: Hoare triple {2886#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} 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)); {2893#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-02-20 17:19:12,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {2893#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2897#(= __VERIFIER_assert_~cond 1)} is VALID [2022-02-20 17:19:12,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {2897#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {2805#false} is VALID [2022-02-20 17:19:12,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {2805#false} assume !false; {2805#false} is VALID [2022-02-20 17:19:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 17:19:12,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:19:14,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {2805#false} assume !false; {2805#false} is VALID [2022-02-20 17:19:14,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {2907#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2805#false} is VALID [2022-02-20 17:19:14,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2907#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:19:14,385 INFO L272 TraceCheckUtils]: 27: Hoare triple {2886#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} 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)); {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:19:14,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {2886#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} assume !(main_~b~0#1 % 4294967296 != main_~B~0#1 % 4294967296); {2886#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} is VALID [2022-02-20 17:19:14,386 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} {2804#true} #77#return; {2886#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} is VALID [2022-02-20 17:19:14,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:19:14,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {2929#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2879#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:19:14,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {2804#true} ~cond := #in~cond; {2929#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:19:14,388 INFO L272 TraceCheckUtils]: 21: Hoare triple {2804#true} 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)); {2804#true} is VALID [2022-02-20 17:19:14,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {2804#true} assume !!(main_#t~post4#1 < 20);havoc main_#t~post4#1; {2804#true} is VALID [2022-02-20 17:19:14,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {2804#true} main_#t~post4#1 := ~counter~0;~counter~0 := 1 + main_#t~post4#1; {2804#true} is VALID [2022-02-20 17:19:14,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {2804#true} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {2804#true} is VALID [2022-02-20 17:19:14,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {2804#true} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {2804#true} is VALID [2022-02-20 17:19:14,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {2804#true} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {2804#true} is VALID [2022-02-20 17:19:14,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {2804#true} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {2804#true} is VALID [2022-02-20 17:19:14,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {2804#true} assume !!(main_#t~post3#1 < 20);havoc main_#t~post3#1; {2804#true} is VALID [2022-02-20 17:19:14,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {2804#true} main_#t~post3#1 := ~counter~0;~counter~0 := 1 + main_#t~post3#1; {2804#true} is VALID [2022-02-20 17:19:14,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {2804#true} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {2804#true} is VALID [2022-02-20 17:19:14,389 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2804#true} {2804#true} #75#return; {2804#true} is VALID [2022-02-20 17:19:14,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-02-20 17:19:14,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-02-20 17:19:14,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-02-20 17:19:14,389 INFO L272 TraceCheckUtils]: 7: Hoare triple {2804#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {2804#true} is VALID [2022-02-20 17:19:14,389 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2804#true} {2804#true} #73#return; {2804#true} is VALID [2022-02-20 17:19:14,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-02-20 17:19:14,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-02-20 17:19:14,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-02-20 17:19:14,389 INFO L272 TraceCheckUtils]: 2: Hoare triple {2804#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {2804#true} is VALID [2022-02-20 17:19:14,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {2804#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2804#true} is VALID [2022-02-20 17:19:14,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {2804#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);~counter~0 := 0; {2804#true} is VALID [2022-02-20 17:19:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 17:19:14,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:14,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664707748] [2022-02-20 17:19:14,390 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:19:14,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889018400] [2022-02-20 17:19:14,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889018400] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:19:14,390 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:19:14,390 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-02-20 17:19:14,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929870363] [2022-02-20 17:19:14,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:19:14,391 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-02-20 17:19:14,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:14,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:19:14,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:14,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:19:14,419 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:14,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:19:14,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:19:14,419 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:19:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:15,869 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-02-20 17:19:15,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:19:15,869 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-02-20 17:19:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:19:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-02-20 17:19:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:19:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-02-20 17:19:15,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2022-02-20 17:19:15,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:15,905 INFO L225 Difference]: With dead ends: 111 [2022-02-20 17:19:15,906 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 17:19:15,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:19:15,906 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 17:19:15,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 149 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 17:19:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 17:19:15,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-20 17:19:15,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:15,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 76 states have internal predecessors, (88), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:19:15,929 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 76 states have internal predecessors, (88), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:19:15,930 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 76 states have internal predecessors, (88), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:19:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:15,932 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2022-02-20 17:19:15,932 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2022-02-20 17:19:15,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:15,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:15,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 76 states have internal predecessors, (88), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) Second operand 91 states. [2022-02-20 17:19:15,933 INFO L87 Difference]: Start difference. First operand has 91 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 76 states have internal predecessors, (88), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) Second operand 91 states. [2022-02-20 17:19:15,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:15,935 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2022-02-20 17:19:15,935 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2022-02-20 17:19:15,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:15,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:15,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:15,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 76 states have internal predecessors, (88), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:19:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2022-02-20 17:19:15,938 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 31 [2022-02-20 17:19:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:15,938 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2022-02-20 17:19:15,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:19:15,939 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2022-02-20 17:19:15,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 17:19:15,939 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:15,939 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:15,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 17:19:16,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:16,155 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:16,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:16,156 INFO L85 PathProgramCache]: Analyzing trace with hash 675416052, now seen corresponding path program 1 times [2022-02-20 17:19:16,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:16,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059070191] [2022-02-20 17:19:16,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:16,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:16,167 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:16,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1343018254] [2022-02-20 17:19:16,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:16,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:16,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:16,169 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:19:16,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process