./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound100.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_valuebound100.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 918183af41ed822b080517d21adc4e88771d95d1ab967de55d618cd7a5912a2d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:19:28,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:19:28,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:19:28,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:19:28,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:19:28,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:19:28,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:19:28,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:19:28,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:19:28,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:19:28,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:19:28,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:19:28,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:19:28,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:19:28,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:19:28,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:19:28,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:19:28,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:19:28,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:19:28,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:19:28,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:19:28,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:19:28,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:19:28,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:19:28,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:19:28,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:19:28,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:19:28,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:19:28,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:19:28,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:19:28,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:19:28,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:19:28,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:19:28,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:19:28,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:19:28,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:19:28,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:19:28,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:19:28,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:19:28,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:19:28,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:19:28,749 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:19:28,774 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:19:28,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:19:28,776 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:19:28,776 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:19:28,776 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:19:28,777 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:19:28,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:19:28,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:19:28,777 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:19:28,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:19:28,779 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:19:28,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:19:28,779 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:19:28,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:19:28,779 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:19:28,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:19:28,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:19:28,780 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:19:28,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:19:28,780 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:19:28,780 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:19:28,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:19:28,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:19:28,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:19:28,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:19:28,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:19:28,781 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:19:28,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:19:28,782 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:19:28,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:19:28,782 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:19:28,782 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:19:28,782 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:19:28,782 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 -> 918183af41ed822b080517d21adc4e88771d95d1ab967de55d618cd7a5912a2d [2022-02-20 17:19:28,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:19:28,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:19:28,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:19:28,984 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:19:28,985 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:19:28,986 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound100.i [2022-02-20 17:19:29,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31d7373d/e7159b8f374d416e8288fe3999730032/FLAG11e181639 [2022-02-20 17:19:29,409 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:19:29,409 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound100.i [2022-02-20 17:19:29,413 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31d7373d/e7159b8f374d416e8288fe3999730032/FLAG11e181639 [2022-02-20 17:19:29,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31d7373d/e7159b8f374d416e8288fe3999730032 [2022-02-20 17:19:29,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:19:29,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:19:29,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:19:29,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:19:29,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:19:29,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:19:29" (1/1) ... [2022-02-20 17:19:29,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a0bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:29, skipping insertion in model container [2022-02-20 17:19:29,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:19:29" (1/1) ... [2022-02-20 17:19:29,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:19:29,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:19:29,594 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_valuebound100.i[950,963] [2022-02-20 17:19:29,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:19:29,624 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:19:29,636 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_valuebound100.i[950,963] [2022-02-20 17:19:29,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:19:29,650 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:19:29,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:29 WrapperNode [2022-02-20 17:19:29,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:19:29,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:19:29,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:19:29,652 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:19:29,656 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:19:29" (1/1) ... [2022-02-20 17:19:29,662 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:19:29" (1/1) ... [2022-02-20 17:19:29,686 INFO L137 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-02-20 17:19:29,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:19:29,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:19:29,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:19:29,688 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:19:29,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:29" (1/1) ... [2022-02-20 17:19:29,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:29" (1/1) ... [2022-02-20 17:19:29,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:29" (1/1) ... [2022-02-20 17:19:29,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:29" (1/1) ... [2022-02-20 17:19:29,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:29" (1/1) ... [2022-02-20 17:19:29,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:29" (1/1) ... [2022-02-20 17:19:29,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:29" (1/1) ... [2022-02-20 17:19:29,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:19:29,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:19:29,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:19:29,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:19:29,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:29" (1/1) ... [2022-02-20 17:19:29,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:19:29,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:29,785 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:19:29,802 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:19:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:19:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:19:29,816 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:19:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:19:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:19:29,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:19:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:19:29,818 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:19:29,861 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:19:29,863 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:19:29,959 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:19:29,965 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:19:29,965 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:19:29,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:19:29 BoogieIcfgContainer [2022-02-20 17:19:29,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:19:29,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:19:29,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:19:29,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:19:29,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:19:29" (1/3) ... [2022-02-20 17:19:29,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0efbe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:19:29, skipping insertion in model container [2022-02-20 17:19:29,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:19:29" (2/3) ... [2022-02-20 17:19:29,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0efbe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:19:29, skipping insertion in model container [2022-02-20 17:19:29,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:19:29" (3/3) ... [2022-02-20 17:19:29,973 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_valuebound100.i [2022-02-20 17:19:29,977 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:19:29,977 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:19:30,009 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:19:30,014 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:19:30,014 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:19:30,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:30,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:19:30,032 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:30,033 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:30,033 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:30,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:30,037 INFO L85 PathProgramCache]: Analyzing trace with hash 913242413, now seen corresponding path program 1 times [2022-02-20 17:19:30,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:30,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652140025] [2022-02-20 17:19:30,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:30,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:30,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:19:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:30,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:19:30,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:19:30,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:19:30,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #74#return; {33#false} is VALID [2022-02-20 17:19:30,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:19:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:30,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:19:30,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:19:30,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:19:30,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #76#return; {33#false} is VALID [2022-02-20 17:19:30,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 17:19:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:30,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:19:30,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:19:30,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:19:30,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #78#return; {33#false} is VALID [2022-02-20 17:19:30,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 17:19:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:30,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:19:30,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:19:30,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:19:30,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #80#return; {33#false} is VALID [2022-02-20 17:19:30,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#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); {32#true} is VALID [2022-02-20 17:19:30,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#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_~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; {32#true} is VALID [2022-02-20 17:19:30,191 INFO L272 TraceCheckUtils]: 2: Hoare triple {32#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 100 then 1 else 0)); {32#true} is VALID [2022-02-20 17:19:30,192 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:19:30,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:19:30,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:19:30,193 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {33#false} {32#true} #74#return; {33#false} is VALID [2022-02-20 17:19:30,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#false} main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {33#false} is VALID [2022-02-20 17:19:30,193 INFO L272 TraceCheckUtils]: 8: Hoare triple {33#false} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 100 then 1 else 0)); {32#true} is VALID [2022-02-20 17:19:30,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:19:30,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:19:30,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:19:30,194 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {33#false} {33#false} #76#return; {33#false} is VALID [2022-02-20 17:19:30,194 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {32#true} is VALID [2022-02-20 17:19:30,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:19:30,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:19:30,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:19:30,196 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {33#false} {33#false} #78#return; {33#false} is VALID [2022-02-20 17:19:30,196 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {32#true} is VALID [2022-02-20 17:19:30,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:19:30,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:19:30,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:19:30,197 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {33#false} {33#false} #80#return; {33#false} is VALID [2022-02-20 17:19:30,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {33#false} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {33#false} is VALID [2022-02-20 17:19:30,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-02-20 17:19:30,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-02-20 17:19:30,198 INFO L272 TraceCheckUtils]: 26: Hoare triple {33#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)); {33#false} is VALID [2022-02-20 17:19:30,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-02-20 17:19:30,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-02-20 17:19:30,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-02-20 17:19:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:19:30,205 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:30,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652140025] [2022-02-20 17:19:30,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652140025] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:19:30,206 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:19:30,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:19:30,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902679989] [2022-02-20 17:19:30,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:19:30,227 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-02-20 17:19:30,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:30,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:30,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:30,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:19:30,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:30,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:19:30,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:19:30,301 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:30,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:30,379 INFO L93 Difference]: Finished difference Result 55 states and 84 transitions. [2022-02-20 17:19:30,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:19:30,380 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-02-20 17:19:30,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:30,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2022-02-20 17:19:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2022-02-20 17:19:30,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 84 transitions. [2022-02-20 17:19:30,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:30,465 INFO L225 Difference]: With dead ends: 55 [2022-02-20 17:19:30,465 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 17:19:30,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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:19:30,470 INFO L933 BasicCegarLoop]: 35 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, 35 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:19:30,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:19:30,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 17:19:30,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 17:19:30,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:30,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:19:30,506 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:19:30,507 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:19:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:30,512 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-02-20 17:19:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 17:19:30,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:30,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:30,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 25 states. [2022-02-20 17:19:30,514 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 25 states. [2022-02-20 17:19:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:30,516 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-02-20 17:19:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 17:19:30,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:30,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:30,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:30,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:19:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-02-20 17:19:30,519 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 30 [2022-02-20 17:19:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:30,519 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-20 17:19:30,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:19:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 17:19:30,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 17:19:30,520 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:30,521 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:30,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:19:30,521 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:30,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:30,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2061833476, now seen corresponding path program 1 times [2022-02-20 17:19:30,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:30,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111946291] [2022-02-20 17:19:30,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:30,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:30,549 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:30,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [367089785] [2022-02-20 17:19:30,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:30,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:30,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:30,552 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:19:30,554 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:19:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:30,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:19:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:30,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:19:31,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#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); {210#true} is VALID [2022-02-20 17:19:31,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#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_~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; {210#true} is VALID [2022-02-20 17:19:31,131 INFO L272 TraceCheckUtils]: 2: Hoare triple {210#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 100 then 1 else 0)); {210#true} is VALID [2022-02-20 17:19:31,134 INFO L290 TraceCheckUtils]: 3: Hoare triple {210#true} ~cond := #in~cond; {224#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:19:31,135 INFO L290 TraceCheckUtils]: 4: Hoare triple {224#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {228#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:19:31,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {228#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:19:31,136 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {228#(not (= |assume_abort_if_not_#in~cond| 0))} {210#true} #74#return; {235#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} is VALID [2022-02-20 17:19:31,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {235#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} is VALID [2022-02-20 17:19:31,136 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 100 then 1 else 0)); {210#true} is VALID [2022-02-20 17:19:31,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2022-02-20 17:19:31,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2022-02-20 17:19:31,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#true} assume true; {210#true} is VALID [2022-02-20 17:19:31,138 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {210#true} {235#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} #76#return; {235#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} is VALID [2022-02-20 17:19:31,138 INFO L272 TraceCheckUtils]: 13: Hoare triple {235#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {210#true} is VALID [2022-02-20 17:19:31,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2022-02-20 17:19:31,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2022-02-20 17:19:31,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {210#true} assume true; {210#true} is VALID [2022-02-20 17:19:31,139 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {210#true} {235#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} #78#return; {235#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} is VALID [2022-02-20 17:19:31,140 INFO L272 TraceCheckUtils]: 18: Hoare triple {235#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {210#true} is VALID [2022-02-20 17:19:31,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2022-02-20 17:19:31,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2022-02-20 17:19:31,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {210#true} assume true; {210#true} is VALID [2022-02-20 17:19:31,142 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {210#true} {235#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} #80#return; {235#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} is VALID [2022-02-20 17:19:31,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {235#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {287#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:19:31,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {287#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {287#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:19:31,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {287#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {287#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:19:31,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {287#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {287#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:19:31,145 INFO L272 TraceCheckUtils]: 27: Hoare triple {287#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (= |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)); {300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:19:31,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:19:31,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {211#false} is VALID [2022-02-20 17:19:31,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {211#false} assume !false; {211#false} is VALID [2022-02-20 17:19:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 17:19:31,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:19:31,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {211#false} assume !false; {211#false} is VALID [2022-02-20 17:19:31,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {211#false} is VALID [2022-02-20 17:19:31,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:19:31,534 INFO L272 TraceCheckUtils]: 27: Hoare triple {320#(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)); {300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:19:31,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {320#(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 !false; {320#(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:31,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {320#(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); {320#(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:31,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {320#(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 !false; {320#(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:31,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {210#true} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {320#(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:31,537 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {210#true} {210#true} #80#return; {210#true} is VALID [2022-02-20 17:19:31,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {210#true} assume true; {210#true} is VALID [2022-02-20 17:19:31,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2022-02-20 17:19:31,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2022-02-20 17:19:31,537 INFO L272 TraceCheckUtils]: 18: Hoare triple {210#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {210#true} is VALID [2022-02-20 17:19:31,537 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {210#true} {210#true} #78#return; {210#true} is VALID [2022-02-20 17:19:31,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {210#true} assume true; {210#true} is VALID [2022-02-20 17:19:31,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2022-02-20 17:19:31,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2022-02-20 17:19:31,538 INFO L272 TraceCheckUtils]: 13: Hoare triple {210#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {210#true} is VALID [2022-02-20 17:19:31,538 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {210#true} {210#true} #76#return; {210#true} is VALID [2022-02-20 17:19:31,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#true} assume true; {210#true} is VALID [2022-02-20 17:19:31,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2022-02-20 17:19:31,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2022-02-20 17:19:31,539 INFO L272 TraceCheckUtils]: 8: Hoare triple {210#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 100 then 1 else 0)); {210#true} is VALID [2022-02-20 17:19:31,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {210#true} main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {210#true} is VALID [2022-02-20 17:19:31,539 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {210#true} {210#true} #74#return; {210#true} is VALID [2022-02-20 17:19:31,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#true} assume true; {210#true} is VALID [2022-02-20 17:19:31,540 INFO L290 TraceCheckUtils]: 4: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2022-02-20 17:19:31,540 INFO L290 TraceCheckUtils]: 3: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2022-02-20 17:19:31,540 INFO L272 TraceCheckUtils]: 2: Hoare triple {210#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 100 then 1 else 0)); {210#true} is VALID [2022-02-20 17:19:31,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#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_~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; {210#true} is VALID [2022-02-20 17:19:31,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#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); {210#true} is VALID [2022-02-20 17:19:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:19:31,541 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:31,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111946291] [2022-02-20 17:19:31,541 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:19:31,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367089785] [2022-02-20 17:19:31,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367089785] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:19:31,542 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:19:31,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-02-20 17:19:31,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67226223] [2022-02-20 17:19:31,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:19:31,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-02-20 17:19:31,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:31,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:19:33,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:33,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:19:33,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:33,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:19:33,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:19:33,134 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:19:33,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:33,250 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-02-20 17:19:33,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:19:33,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-02-20 17:19:33,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:19:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 17:19:33,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:19:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 17:19:33,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-02-20 17:19:33,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:33,457 INFO L225 Difference]: With dead ends: 35 [2022-02-20 17:19:33,457 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 17:19:33,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:19:33,458 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:19:33,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 101 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-02-20 17:19:33,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 17:19:33,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 17:19:33,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:33,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:33,463 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:33,463 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:33,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:33,465 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-02-20 17:19:33,465 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-02-20 17:19:33,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:33,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:33,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-02-20 17:19:33,467 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-02-20 17:19:33,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:33,468 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-02-20 17:19:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-02-20 17:19:33,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:33,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:33,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:33,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-02-20 17:19:33,471 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 31 [2022-02-20 17:19:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:33,471 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-02-20 17:19:33,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:19:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-02-20 17:19:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 17:19:33,472 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:33,473 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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:33,493 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:19:33,683 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:19:33,684 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:33,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:33,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1044269705, now seen corresponding path program 1 times [2022-02-20 17:19:33,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:33,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056959819] [2022-02-20 17:19:33,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:33,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:33,701 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:33,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1732198081] [2022-02-20 17:19:33,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:33,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:33,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:33,703 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:19:33,713 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:19:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:33,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 17:19:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:33,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:19:34,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {561#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); {561#true} is VALID [2022-02-20 17:19:34,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {561#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_~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; {561#true} is VALID [2022-02-20 17:19:34,630 INFO L272 TraceCheckUtils]: 2: Hoare triple {561#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 100 then 1 else 0)); {561#true} is VALID [2022-02-20 17:19:34,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {561#true} ~cond := #in~cond; {575#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:19:34,630 INFO L290 TraceCheckUtils]: 4: Hoare triple {575#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {579#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:19:34,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {579#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {579#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:19:34,631 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {579#(not (= |assume_abort_if_not_#in~cond| 0))} {561#true} #74#return; {586#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} is VALID [2022-02-20 17:19:34,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {586#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {586#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} is VALID [2022-02-20 17:19:34,633 INFO L272 TraceCheckUtils]: 8: Hoare triple {586#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 100 then 1 else 0)); {561#true} is VALID [2022-02-20 17:19:34,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {561#true} ~cond := #in~cond; {561#true} is VALID [2022-02-20 17:19:34,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {561#true} assume !(0 == ~cond); {561#true} is VALID [2022-02-20 17:19:34,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {561#true} assume true; {561#true} is VALID [2022-02-20 17:19:34,643 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {561#true} {586#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} #76#return; {586#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} is VALID [2022-02-20 17:19:34,644 INFO L272 TraceCheckUtils]: 13: Hoare triple {586#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {561#true} is VALID [2022-02-20 17:19:34,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {561#true} ~cond := #in~cond; {561#true} is VALID [2022-02-20 17:19:34,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {561#true} assume !(0 == ~cond); {561#true} is VALID [2022-02-20 17:19:34,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {561#true} assume true; {561#true} is VALID [2022-02-20 17:19:34,645 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {561#true} {586#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} #78#return; {586#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} is VALID [2022-02-20 17:19:34,645 INFO L272 TraceCheckUtils]: 18: Hoare triple {586#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {561#true} is VALID [2022-02-20 17:19:34,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {561#true} ~cond := #in~cond; {575#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:19:34,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {575#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {579#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:19:34,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {579#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {579#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:19:34,647 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {579#(not (= |assume_abort_if_not_#in~cond| 0))} {586#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} #80#return; {635#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100))} is VALID [2022-02-20 17:19:34,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {635#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100))} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {639#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (<= 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:34,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {639#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 4294967296)) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {639#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (<= 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:34,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {639#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (<= 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; {646#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (= |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:34,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {646#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (= |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 !false; {646#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (= |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:34,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {646#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (= |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); {646#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (= |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:34,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {646#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (= |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 !false; {646#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (= |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:34,651 INFO L272 TraceCheckUtils]: 29: Hoare triple {646#(and (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100) (= |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)); {659#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:19:34,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {659#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {663#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:19:34,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {663#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {562#false} is VALID [2022-02-20 17:19:34,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {562#false} assume !false; {562#false} is VALID [2022-02-20 17:19:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:19:34,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:19:35,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {562#false} assume !false; {562#false} is VALID [2022-02-20 17:19:35,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {663#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {562#false} is VALID [2022-02-20 17:19:35,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {659#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {663#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:19:35,209 INFO L272 TraceCheckUtils]: 29: Hoare triple {679#(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)); {659#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:19:35,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {679#(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 !false; {679#(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:35,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {679#(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); {679#(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:35,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {679#(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 !false; {679#(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:35,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {692#(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; {679#(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:35,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {692#(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 !false; {692#(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:35,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {561#true} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {692#(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:35,212 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {561#true} {561#true} #80#return; {561#true} is VALID [2022-02-20 17:19:35,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {561#true} assume true; {561#true} is VALID [2022-02-20 17:19:35,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {561#true} assume !(0 == ~cond); {561#true} is VALID [2022-02-20 17:19:35,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {561#true} ~cond := #in~cond; {561#true} is VALID [2022-02-20 17:19:35,212 INFO L272 TraceCheckUtils]: 18: Hoare triple {561#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {561#true} is VALID [2022-02-20 17:19:35,212 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {561#true} {561#true} #78#return; {561#true} is VALID [2022-02-20 17:19:35,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {561#true} assume true; {561#true} is VALID [2022-02-20 17:19:35,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {561#true} assume !(0 == ~cond); {561#true} is VALID [2022-02-20 17:19:35,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {561#true} ~cond := #in~cond; {561#true} is VALID [2022-02-20 17:19:35,213 INFO L272 TraceCheckUtils]: 13: Hoare triple {561#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {561#true} is VALID [2022-02-20 17:19:35,213 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {561#true} {561#true} #76#return; {561#true} is VALID [2022-02-20 17:19:35,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {561#true} assume true; {561#true} is VALID [2022-02-20 17:19:35,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {561#true} assume !(0 == ~cond); {561#true} is VALID [2022-02-20 17:19:35,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {561#true} ~cond := #in~cond; {561#true} is VALID [2022-02-20 17:19:35,214 INFO L272 TraceCheckUtils]: 8: Hoare triple {561#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 100 then 1 else 0)); {561#true} is VALID [2022-02-20 17:19:35,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {561#true} main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {561#true} is VALID [2022-02-20 17:19:35,214 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {561#true} {561#true} #74#return; {561#true} is VALID [2022-02-20 17:19:35,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {561#true} assume true; {561#true} is VALID [2022-02-20 17:19:35,214 INFO L290 TraceCheckUtils]: 4: Hoare triple {561#true} assume !(0 == ~cond); {561#true} is VALID [2022-02-20 17:19:35,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {561#true} ~cond := #in~cond; {561#true} is VALID [2022-02-20 17:19:35,215 INFO L272 TraceCheckUtils]: 2: Hoare triple {561#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 100 then 1 else 0)); {561#true} is VALID [2022-02-20 17:19:35,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {561#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_~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; {561#true} is VALID [2022-02-20 17:19:35,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {561#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); {561#true} is VALID [2022-02-20 17:19:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:19:35,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:35,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056959819] [2022-02-20 17:19:35,216 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:19:35,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732198081] [2022-02-20 17:19:35,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732198081] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:19:35,216 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:19:35,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-02-20 17:19:35,216 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094653747] [2022-02-20 17:19:35,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:19:35,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2022-02-20 17:19:35,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:35,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:19:37,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:37,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:19:37,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:37,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:19:37,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:19:37,289 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:19:37,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:37,463 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-02-20 17:19:37,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:19:37,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2022-02-20 17:19:37,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:19:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-02-20 17:19:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:19:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-02-20 17:19:37,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-02-20 17:19:38,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:38,063 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:19:38,064 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 17:19:38,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:19:38,067 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:19:38,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 140 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 17 Unchecked, 0.0s Time] [2022-02-20 17:19:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 17:19:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2022-02-20 17:19:38,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:38,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:38,080 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:38,080 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:38,087 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-02-20 17:19:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-02-20 17:19:38,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:38,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:38,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 39 states. [2022-02-20 17:19:38,089 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 39 states. [2022-02-20 17:19:38,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:38,096 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-02-20 17:19:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-02-20 17:19:38,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:38,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:38,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:38,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:38,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-02-20 17:19:38,104 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 33 [2022-02-20 17:19:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:38,104 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-02-20 17:19:38,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:19:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 17:19:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 17:19:38,106 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:38,106 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:38,123 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:38,319 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:38,319 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:38,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:38,320 INFO L85 PathProgramCache]: Analyzing trace with hash -328713508, now seen corresponding path program 1 times [2022-02-20 17:19:38,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:38,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194521393] [2022-02-20 17:19:38,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:38,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:38,343 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:38,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [437281658] [2022-02-20 17:19:38,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:38,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:38,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:38,345 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:38,346 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:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:38,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:19:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:38,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:19:38,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {944#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); {944#true} is VALID [2022-02-20 17:19:38,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {944#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_~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; {944#true} is VALID [2022-02-20 17:19:38,547 INFO L272 TraceCheckUtils]: 2: Hoare triple {944#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 100 then 1 else 0)); {944#true} is VALID [2022-02-20 17:19:38,547 INFO L290 TraceCheckUtils]: 3: Hoare triple {944#true} ~cond := #in~cond; {944#true} is VALID [2022-02-20 17:19:38,547 INFO L290 TraceCheckUtils]: 4: Hoare triple {944#true} assume !(0 == ~cond); {944#true} is VALID [2022-02-20 17:19:38,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {944#true} assume true; {944#true} is VALID [2022-02-20 17:19:38,547 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {944#true} {944#true} #74#return; {944#true} is VALID [2022-02-20 17:19:38,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {944#true} main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {944#true} is VALID [2022-02-20 17:19:38,547 INFO L272 TraceCheckUtils]: 8: Hoare triple {944#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 100 then 1 else 0)); {944#true} is VALID [2022-02-20 17:19:38,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {944#true} ~cond := #in~cond; {944#true} is VALID [2022-02-20 17:19:38,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {944#true} assume !(0 == ~cond); {944#true} is VALID [2022-02-20 17:19:38,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {944#true} assume true; {944#true} is VALID [2022-02-20 17:19:38,547 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {944#true} {944#true} #76#return; {944#true} is VALID [2022-02-20 17:19:38,547 INFO L272 TraceCheckUtils]: 13: Hoare triple {944#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {944#true} is VALID [2022-02-20 17:19:38,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {944#true} ~cond := #in~cond; {944#true} is VALID [2022-02-20 17:19:38,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {944#true} assume !(0 == ~cond); {944#true} is VALID [2022-02-20 17:19:38,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {944#true} assume true; {944#true} is VALID [2022-02-20 17:19:38,548 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {944#true} {944#true} #78#return; {944#true} is VALID [2022-02-20 17:19:38,548 INFO L272 TraceCheckUtils]: 18: Hoare triple {944#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {944#true} is VALID [2022-02-20 17:19:38,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {944#true} ~cond := #in~cond; {944#true} is VALID [2022-02-20 17:19:38,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {944#true} assume !(0 == ~cond); {944#true} is VALID [2022-02-20 17:19:38,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {944#true} assume true; {944#true} is VALID [2022-02-20 17:19:38,548 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {944#true} {944#true} #80#return; {944#true} is VALID [2022-02-20 17:19:38,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {944#true} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {944#true} is VALID [2022-02-20 17:19:38,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {944#true} assume !false; {944#true} is VALID [2022-02-20 17:19:38,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {944#true} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {944#true} is VALID [2022-02-20 17:19:38,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {944#true} assume !false; {944#true} is VALID [2022-02-20 17:19:38,548 INFO L272 TraceCheckUtils]: 27: Hoare triple {944#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)); {944#true} is VALID [2022-02-20 17:19:38,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {944#true} ~cond := #in~cond; {1033#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:19:38,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {1033#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1037#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:19:38,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {1037#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1037#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:19:38,555 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1037#(not (= |__VERIFIER_assert_#in~cond| 0))} {944#true} #82#return; {1044#(= (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:38,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {1044#(= (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); {1044#(= (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:38,556 INFO L272 TraceCheckUtils]: 33: Hoare triple {1044#(= (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)); {1051#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-02-20 17:19:38,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {1051#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1055#(= __VERIFIER_assert_~cond 1)} is VALID [2022-02-20 17:19:38,557 INFO L290 TraceCheckUtils]: 35: Hoare triple {1055#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {945#false} is VALID [2022-02-20 17:19:38,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {945#false} assume !false; {945#false} is VALID [2022-02-20 17:19:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:19:38,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:19:39,384 INFO L290 TraceCheckUtils]: 36: Hoare triple {945#false} assume !false; {945#false} is VALID [2022-02-20 17:19:39,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {1065#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {945#false} is VALID [2022-02-20 17:19:39,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {1037#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1065#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:19:39,386 INFO L272 TraceCheckUtils]: 33: Hoare triple {1044#(= (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)); {1037#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:19:39,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {1044#(= (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); {1044#(= (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:39,387 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1037#(not (= |__VERIFIER_assert_#in~cond| 0))} {944#true} #82#return; {1044#(= (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:39,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {1037#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1037#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:19:39,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {1087#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1037#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:19:39,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {944#true} ~cond := #in~cond; {1087#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:19:39,388 INFO L272 TraceCheckUtils]: 27: Hoare triple {944#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)); {944#true} is VALID [2022-02-20 17:19:39,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {944#true} assume !false; {944#true} is VALID [2022-02-20 17:19:39,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {944#true} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {944#true} is VALID [2022-02-20 17:19:39,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {944#true} assume !false; {944#true} is VALID [2022-02-20 17:19:39,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {944#true} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {944#true} is VALID [2022-02-20 17:19:39,392 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {944#true} {944#true} #80#return; {944#true} is VALID [2022-02-20 17:19:39,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {944#true} assume true; {944#true} is VALID [2022-02-20 17:19:39,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {944#true} assume !(0 == ~cond); {944#true} is VALID [2022-02-20 17:19:39,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {944#true} ~cond := #in~cond; {944#true} is VALID [2022-02-20 17:19:39,393 INFO L272 TraceCheckUtils]: 18: Hoare triple {944#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {944#true} is VALID [2022-02-20 17:19:39,393 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {944#true} {944#true} #78#return; {944#true} is VALID [2022-02-20 17:19:39,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {944#true} assume true; {944#true} is VALID [2022-02-20 17:19:39,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {944#true} assume !(0 == ~cond); {944#true} is VALID [2022-02-20 17:19:39,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {944#true} ~cond := #in~cond; {944#true} is VALID [2022-02-20 17:19:39,393 INFO L272 TraceCheckUtils]: 13: Hoare triple {944#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {944#true} is VALID [2022-02-20 17:19:39,393 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {944#true} {944#true} #76#return; {944#true} is VALID [2022-02-20 17:19:39,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {944#true} assume true; {944#true} is VALID [2022-02-20 17:19:39,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {944#true} assume !(0 == ~cond); {944#true} is VALID [2022-02-20 17:19:39,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {944#true} ~cond := #in~cond; {944#true} is VALID [2022-02-20 17:19:39,393 INFO L272 TraceCheckUtils]: 8: Hoare triple {944#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 100 then 1 else 0)); {944#true} is VALID [2022-02-20 17:19:39,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {944#true} main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {944#true} is VALID [2022-02-20 17:19:39,393 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {944#true} {944#true} #74#return; {944#true} is VALID [2022-02-20 17:19:39,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {944#true} assume true; {944#true} is VALID [2022-02-20 17:19:39,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {944#true} assume !(0 == ~cond); {944#true} is VALID [2022-02-20 17:19:39,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {944#true} ~cond := #in~cond; {944#true} is VALID [2022-02-20 17:19:39,394 INFO L272 TraceCheckUtils]: 2: Hoare triple {944#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 100 then 1 else 0)); {944#true} is VALID [2022-02-20 17:19:39,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {944#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_~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; {944#true} is VALID [2022-02-20 17:19:39,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {944#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); {944#true} is VALID [2022-02-20 17:19:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:19:39,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:39,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194521393] [2022-02-20 17:19:39,395 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:19:39,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437281658] [2022-02-20 17:19:39,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437281658] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:19:39,395 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:19:39,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-02-20 17:19:39,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103367898] [2022-02-20 17:19:39,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:19:39,396 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2022-02-20 17:19:39,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:39,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:19:39,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:39,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:19:39,427 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:39,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:19:39,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:19:39,428 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:19:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:42,089 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-02-20 17:19:42,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:19:42,090 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2022-02-20 17:19:42,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:42,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:19:42,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-02-20 17:19:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:19:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-02-20 17:19:42,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-02-20 17:19:42,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:42,132 INFO L225 Difference]: With dead ends: 45 [2022-02-20 17:19:42,132 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 17:19:42,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:19:42,132 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:19:42,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 146 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:19:42,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 17:19:42,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-02-20 17:19:42,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:42,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:42,139 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:42,139 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:42,141 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-02-20 17:19:42,141 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 17:19:42,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:42,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:42,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-02-20 17:19:42,143 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-02-20 17:19:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:42,152 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-02-20 17:19:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 17:19:42,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:42,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:42,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:42,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-02-20 17:19:42,157 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 37 [2022-02-20 17:19:42,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:42,157 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-02-20 17:19:42,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:19:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-02-20 17:19:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 17:19:42,158 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:42,158 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:42,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 17:19:42,363 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:42,363 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:42,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:42,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1786164585, now seen corresponding path program 1 times [2022-02-20 17:19:42,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:42,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411943457] [2022-02-20 17:19:42,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:42,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:42,376 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:42,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1882361465] [2022-02-20 17:19:42,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:42,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:42,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:42,378 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:42,379 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:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:42,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:19:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:19:42,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:19:42,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {1351#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); {1351#true} is VALID [2022-02-20 17:19:42,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {1351#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_~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; {1351#true} is VALID [2022-02-20 17:19:42,502 INFO L272 TraceCheckUtils]: 2: Hoare triple {1351#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 100 then 1 else 0)); {1351#true} is VALID [2022-02-20 17:19:42,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {1351#true} ~cond := #in~cond; {1351#true} is VALID [2022-02-20 17:19:42,502 INFO L290 TraceCheckUtils]: 4: Hoare triple {1351#true} assume !(0 == ~cond); {1351#true} is VALID [2022-02-20 17:19:42,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {1351#true} assume true; {1351#true} is VALID [2022-02-20 17:19:42,502 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1351#true} {1351#true} #74#return; {1351#true} is VALID [2022-02-20 17:19:42,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {1351#true} main_~B~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1351#true} is VALID [2022-02-20 17:19:42,503 INFO L272 TraceCheckUtils]: 8: Hoare triple {1351#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 100 then 1 else 0)); {1351#true} is VALID [2022-02-20 17:19:42,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {1351#true} ~cond := #in~cond; {1351#true} is VALID [2022-02-20 17:19:42,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {1351#true} assume !(0 == ~cond); {1351#true} is VALID [2022-02-20 17:19:42,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {1351#true} assume true; {1351#true} is VALID [2022-02-20 17:19:42,503 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1351#true} {1351#true} #76#return; {1351#true} is VALID [2022-02-20 17:19:42,503 INFO L272 TraceCheckUtils]: 13: Hoare triple {1351#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 < 2147483647 then 1 else 0)); {1351#true} is VALID [2022-02-20 17:19:42,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {1351#true} ~cond := #in~cond; {1351#true} is VALID [2022-02-20 17:19:42,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {1351#true} assume !(0 == ~cond); {1351#true} is VALID [2022-02-20 17:19:42,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {1351#true} assume true; {1351#true} is VALID [2022-02-20 17:19:42,503 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1351#true} {1351#true} #78#return; {1351#true} is VALID [2022-02-20 17:19:42,503 INFO L272 TraceCheckUtils]: 18: Hoare triple {1351#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {1351#true} is VALID [2022-02-20 17:19:42,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {1351#true} ~cond := #in~cond; {1351#true} is VALID [2022-02-20 17:19:42,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {1351#true} assume !(0 == ~cond); {1351#true} is VALID [2022-02-20 17:19:42,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {1351#true} assume true; {1351#true} is VALID [2022-02-20 17:19:42,503 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1351#true} {1351#true} #80#return; {1351#true} is VALID [2022-02-20 17:19:42,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {1351#true} main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {1425#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:42,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {1425#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} assume !false; {1425#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:42,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {1425#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {1425#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:42,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {1425#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} assume !false; {1425#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:42,513 INFO L272 TraceCheckUtils]: 27: Hoare triple {1425#(= |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)); {1351#true} is VALID [2022-02-20 17:19:42,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {1351#true} ~cond := #in~cond; {1351#true} is VALID [2022-02-20 17:19:42,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {1351#true} assume !(0 == ~cond); {1351#true} is VALID [2022-02-20 17:19:42,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {1351#true} assume true; {1351#true} is VALID [2022-02-20 17:19:42,513 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1351#true} {1425#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} #82#return; {1425#(= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:19:42,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {1425#(= |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); {1352#false} is VALID [2022-02-20 17:19:42,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {1352#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; {1352#false} is VALID [2022-02-20 17:19:42,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {1352#false} assume !false; {1352#false} is VALID [2022-02-20 17:19:42,515 INFO L272 TraceCheckUtils]: 35: Hoare triple {1352#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)); {1352#false} is VALID [2022-02-20 17:19:42,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {1352#false} ~cond := #in~cond; {1352#false} is VALID [2022-02-20 17:19:42,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {1352#false} assume 0 == ~cond; {1352#false} is VALID [2022-02-20 17:19:42,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {1352#false} assume !false; {1352#false} is VALID [2022-02-20 17:19:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:19:42,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:19:42,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:19:42,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411943457] [2022-02-20 17:19:42,515 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:19:42,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882361465] [2022-02-20 17:19:42,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882361465] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:19:42,516 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:19:42,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:19:42,516 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672131217] [2022-02-20 17:19:42,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:19:42,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-02-20 17:19:42,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:19:42,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:19:42,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:19:42,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:19:42,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:19:42,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:19:42,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:19:42,548 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:19:42,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:42,590 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-02-20 17:19:42,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:19:42,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-02-20 17:19:42,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:19:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:19:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-20 17:19:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:19:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-20 17:19:42,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-02-20 17:19:42,626 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:42,627 INFO L225 Difference]: With dead ends: 45 [2022-02-20 17:19:42,627 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 17:19:42,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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:42,628 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 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:42,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 49 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:42,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 17:19:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 17:19:42,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:19:42,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:42,636 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:42,636 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:42,637 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-02-20 17:19:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-20 17:19:42,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:42,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:42,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-02-20 17:19:42,638 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-02-20 17:19:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:19:42,639 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-02-20 17:19:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-20 17:19:42,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:19:42,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:19:42,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:19:42,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:19:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:19:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-02-20 17:19:42,641 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 39 [2022-02-20 17:19:42,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:19:42,641 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-02-20 17:19:42,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:19:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-20 17:19:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 17:19:42,642 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:19:42,642 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:19:42,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:19:42,858 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:42,858 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:19:42,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:19:42,858 INFO L85 PathProgramCache]: Analyzing trace with hash 145189394, now seen corresponding path program 1 times [2022-02-20 17:19:42,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:19:42,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946610508] [2022-02-20 17:19:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:42,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:19:42,870 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:19:42,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1936135757] [2022-02-20 17:19:42,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:19:42,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:19:42,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:19:42,871 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:42,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process