/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:34:33,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:34:33,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:34:33,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:34:33,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:34:33,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:34:33,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:34:33,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:34:33,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:34:33,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:34:33,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:34:33,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:34:33,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:34:33,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:34:33,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:34:33,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:34:33,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:34:33,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:34:33,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:34:33,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:34:33,655 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:34:33,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:34:33,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:34:33,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:34:33,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:34:33,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:34:33,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:34:33,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:34:33,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:34:33,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:34:33,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:34:33,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:34:33,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:34:33,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:34:33,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:34:33,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:34:33,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:34:33,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:34:33,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:34:33,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:34:33,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:34:33,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:34:33,674 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:34:33,719 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:34:33,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:34:33,720 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:34:33,720 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:34:33,721 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:34:33,721 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:34:33,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:34:33,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:34:33,722 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:34:33,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:34:33,723 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:34:33,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:34:33,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:34:33,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:34:33,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:34:33,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:34:33,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:34:33,724 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:34:33,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:34:33,725 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:34:33,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:34:33,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:34:33,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:34:33,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:34:33,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:34:33,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:34:33,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:34:33,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:34:33,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:34:33,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:34:33,726 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:34:33,726 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:34:33,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:34:33,726 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:34:33,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:34:33,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:34:33,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:34:33,969 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:34:33,969 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:34:33,970 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound2.i [2022-04-27 12:34:34,021 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc36931f/88f130459a1548c6b73d0ecd35a3e529/FLAGc775b155e [2022-04-27 12:34:34,399 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:34:34,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound2.i [2022-04-27 12:34:34,412 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc36931f/88f130459a1548c6b73d0ecd35a3e529/FLAGc775b155e [2022-04-27 12:34:34,827 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc36931f/88f130459a1548c6b73d0ecd35a3e529 [2022-04-27 12:34:34,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:34:34,831 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:34:34,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:34:34,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:34:34,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:34:34,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:34:34" (1/1) ... [2022-04-27 12:34:34,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a936376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:34:34, skipping insertion in model container [2022-04-27 12:34:34,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:34:34" (1/1) ... [2022-04-27 12:34:34,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:34:34,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:34:35,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound2.i[950,963] [2022-04-27 12:34:35,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:34:35,050 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:34:35,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound2.i[950,963] [2022-04-27 12:34:35,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:34:35,101 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:34:35,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:34:35 WrapperNode [2022-04-27 12:34:35,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:34:35,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:34:35,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:34:35,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:34:35,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:34:35" (1/1) ... [2022-04-27 12:34:35,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:34:35" (1/1) ... [2022-04-27 12:34:35,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:34:35" (1/1) ... [2022-04-27 12:34:35,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:34:35" (1/1) ... [2022-04-27 12:34:35,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:34:35" (1/1) ... [2022-04-27 12:34:35,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:34:35" (1/1) ... [2022-04-27 12:34:35,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:34:35" (1/1) ... [2022-04-27 12:34:35,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:34:35,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:34:35,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:34:35,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:34:35,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:34:35" (1/1) ... [2022-04-27 12:34:35,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:34:35,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:34:35,176 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-04-27 12:34:35,185 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-04-27 12:34:35,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:34:35,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:34:35,220 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:34:35,221 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:34:35,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:34:35,222 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:34:35,222 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:34:35,222 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:34:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 12:34:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 12:34:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:34:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:34:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:34:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:34:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:34:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:34:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:34:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:34:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:34:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:34:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:34:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:34:35,299 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:34:35,300 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:34:35,443 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:34:35,448 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:34:35,448 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:34:35,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:34:35 BoogieIcfgContainer [2022-04-27 12:34:35,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:34:35,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:34:35,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:34:35,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:34:35,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:34:34" (1/3) ... [2022-04-27 12:34:35,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6a63b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:34:35, skipping insertion in model container [2022-04-27 12:34:35,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:34:35" (2/3) ... [2022-04-27 12:34:35,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6a63b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:34:35, skipping insertion in model container [2022-04-27 12:34:35,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:34:35" (3/3) ... [2022-04-27 12:34:35,470 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound2.i [2022-04-27 12:34:35,481 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:34:35,481 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:34:35,514 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:34:35,519 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e9dd649, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d26c9f1 [2022-04-27 12:34:35,519 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:34:35,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:34:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:34:35,532 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:34:35,532 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:34:35,532 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:34:35,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:34:35,536 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-27 12:34:35,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:34:35,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734711628] [2022-04-27 12:34:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:35,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:34:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:35,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:34:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:35,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-27 12:34:35,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 12:34:35,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-27 12:34:35,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:34:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:35,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:34:35,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:34:35,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:34:35,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-27 12:34:35,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:34:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:35,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:34:35,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:34:35,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:34:35,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-27 12:34:35,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:34:35,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-27 12:34:35,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 12:34:35,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-27 12:34:35,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-27 12:34:35,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2022-04-27 12:34:35,757 INFO L272 TraceCheckUtils]: 6: Hoare triple {36#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {36#true} is VALID [2022-04-27 12:34:35,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:34:35,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:34:35,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:34:35,758 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-27 12:34:35,758 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {36#true} is VALID [2022-04-27 12:34:35,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:34:35,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:34:35,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:34:35,760 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-27 12:34:35,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {37#false} is VALID [2022-04-27 12:34:35,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-27 12:34:35,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-27 12:34:35,762 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {37#false} is VALID [2022-04-27 12:34:35,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-27 12:34:35,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-27 12:34:35,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-27 12:34:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:34:35,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:34:35,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734711628] [2022-04-27 12:34:35,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734711628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:34:35,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:34:35,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:34:35,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244854715] [2022-04-27 12:34:35,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:34:35,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:34:35,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:34:35,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:35,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:35,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:34:35,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:34:35,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:34:35,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:34:35,830 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:35,960 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-27 12:34:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:34:35,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:34:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:34:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-27 12:34:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-27 12:34:35,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-27 12:34:36,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:36,075 INFO L225 Difference]: With dead ends: 60 [2022-04-27 12:34:36,076 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 12:34:36,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-04-27 12:34:36,080 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:34:36,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:34:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 12:34:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-27 12:34:36,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:34:36,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:34:36,116 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:34:36,116 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:34:36,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:36,119 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 12:34:36,119 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:34:36,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:36,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:36,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-27 12:34:36,120 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-27 12:34:36,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:36,124 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 12:34:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:34:36,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:36,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:36,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:34:36,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:34:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:34:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-27 12:34:36,128 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-27 12:34:36,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:34:36,129 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-27 12:34:36,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:36,129 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-27 12:34:36,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 12:34:36,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:34:36,130 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:34:36,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:34:36,131 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:34:36,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:34:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-27 12:34:36,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:34:36,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128190884] [2022-04-27 12:34:36,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:36,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:34:36,163 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:34:36,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1873089920] [2022-04-27 12:34:36,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:36,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:34:36,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:34:36,165 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-04-27 12:34:36,166 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-04-27 12:34:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:36,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:34:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:36,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:34:36,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-27 12:34:36,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:36,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:36,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {235#(<= ~counter~0 0)} {227#true} #89#return; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:36,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {235#(<= ~counter~0 0)} call #t~ret5 := main(); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:36,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {235#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:36,452 INFO L272 TraceCheckUtils]: 6: Hoare triple {235#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:36,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#(<= ~counter~0 0)} ~cond := #in~cond; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:36,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#(<= ~counter~0 0)} assume !(0 == ~cond); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:36,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:36,455 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {235#(<= ~counter~0 0)} {235#(<= ~counter~0 0)} #81#return; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:36,456 INFO L272 TraceCheckUtils]: 11: Hoare triple {235#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:36,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {235#(<= ~counter~0 0)} ~cond := #in~cond; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:36,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {235#(<= ~counter~0 0)} assume !(0 == ~cond); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:36,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:36,462 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {235#(<= ~counter~0 0)} {235#(<= ~counter~0 0)} #83#return; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:36,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {235#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:36,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {235#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {284#(<= |main_#t~post3| 0)} is VALID [2022-04-27 12:34:36,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {284#(<= |main_#t~post3| 0)} assume !(#t~post3 < 2);havoc #t~post3; {228#false} is VALID [2022-04-27 12:34:36,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {228#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {228#false} is VALID [2022-04-27 12:34:36,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {228#false} assume !(#t~post4 < 2);havoc #t~post4; {228#false} is VALID [2022-04-27 12:34:36,465 INFO L272 TraceCheckUtils]: 21: Hoare triple {228#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {228#false} is VALID [2022-04-27 12:34:36,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-27 12:34:36,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-27 12:34:36,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-27 12:34:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:34:36,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:34:36,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:34:36,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128190884] [2022-04-27 12:34:36,468 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:34:36,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873089920] [2022-04-27 12:34:36,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873089920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:34:36,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:34:36,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:34:36,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041751146] [2022-04-27 12:34:36,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:34:36,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-27 12:34:36,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:34:36,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:36,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:36,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:34:36,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:34:36,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:34:36,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:34:36,497 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:36,575 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-27 12:34:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:34:36,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-27 12:34:36,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:34:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-27 12:34:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:36,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-27 12:34:36,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-27 12:34:36,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:36,628 INFO L225 Difference]: With dead ends: 42 [2022-04-27 12:34:36,628 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 12:34:36,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:34:36,629 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:34:36,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:34:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 12:34:36,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 12:34:36,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:34:36,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:34:36,641 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:34:36,641 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:34:36,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:36,644 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-27 12:34:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:34:36,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:36,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:36,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-27 12:34:36,645 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-27 12:34:36,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:36,647 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-27 12:34:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:34:36,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:36,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:36,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:34:36,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:34:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:34:36,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-27 12:34:36,650 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-27 12:34:36,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:34:36,650 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-27 12:34:36,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:34:36,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 12:34:36,651 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:34:36,652 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:34:36,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 12:34:36,867 WARN L477 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-04-27 12:34:36,868 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:34:36,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:34:36,868 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-27 12:34:36,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:34:36,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403151908] [2022-04-27 12:34:36,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:36,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:34:36,894 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:34:36,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478472185] [2022-04-27 12:34:36,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:36,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:34:36,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:34:36,896 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-04-27 12:34:36,924 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-04-27 12:34:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:36,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:34:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:36,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:34:37,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {464#true} call ULTIMATE.init(); {464#true} is VALID [2022-04-27 12:34:37,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:37,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:37,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {472#(<= ~counter~0 0)} {464#true} #89#return; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:37,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {472#(<= ~counter~0 0)} call #t~ret5 := main(); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:37,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {472#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:37,173 INFO L272 TraceCheckUtils]: 6: Hoare triple {472#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:37,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {472#(<= ~counter~0 0)} ~cond := #in~cond; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:37,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {472#(<= ~counter~0 0)} assume !(0 == ~cond); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:37,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:37,175 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {472#(<= ~counter~0 0)} {472#(<= ~counter~0 0)} #81#return; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:37,176 INFO L272 TraceCheckUtils]: 11: Hoare triple {472#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:37,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#(<= ~counter~0 0)} ~cond := #in~cond; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:37,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {472#(<= ~counter~0 0)} assume !(0 == ~cond); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:37,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:37,178 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {472#(<= ~counter~0 0)} {472#(<= ~counter~0 0)} #83#return; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:37,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {472#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:37,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {521#(<= ~counter~0 1)} is VALID [2022-04-27 12:34:37,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {521#(<= ~counter~0 1)} assume !!(#t~post3 < 2);havoc #t~post3; {521#(<= ~counter~0 1)} is VALID [2022-04-27 12:34:37,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {521#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {521#(<= ~counter~0 1)} is VALID [2022-04-27 12:34:37,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {521#(<= ~counter~0 1)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {531#(<= |main_#t~post4| 1)} is VALID [2022-04-27 12:34:37,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {531#(<= |main_#t~post4| 1)} assume !(#t~post4 < 2);havoc #t~post4; {465#false} is VALID [2022-04-27 12:34:37,181 INFO L272 TraceCheckUtils]: 22: Hoare triple {465#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {465#false} is VALID [2022-04-27 12:34:37,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {465#false} ~cond := #in~cond; {465#false} is VALID [2022-04-27 12:34:37,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {465#false} assume 0 == ~cond; {465#false} is VALID [2022-04-27 12:34:37,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {465#false} assume !false; {465#false} is VALID [2022-04-27 12:34:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:34:37,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:34:37,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:34:37,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403151908] [2022-04-27 12:34:37,183 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:34:37,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478472185] [2022-04-27 12:34:37,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478472185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:34:37,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:34:37,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:34:37,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109150696] [2022-04-27 12:34:37,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:34:37,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 12:34:37,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:34:37,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:37,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:37,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:34:37,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:34:37,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:34:37,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:34:37,205 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:39,405 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 12:34:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:34:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 12:34:39,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:34:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-27 12:34:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-27 12:34:39,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-27 12:34:39,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:39,471 INFO L225 Difference]: With dead ends: 41 [2022-04-27 12:34:39,471 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 12:34:39,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:34:39,473 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:34:39,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 97 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:34:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 12:34:39,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-27 12:34:39,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:34:39,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:34:39,497 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:34:39,498 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:34:39,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:39,500 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-27 12:34:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-27 12:34:39,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:39,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:39,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 12:34:39,501 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 12:34:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:39,504 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-27 12:34:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-27 12:34:39,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:39,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:39,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:34:39,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:34:39,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:34:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-27 12:34:39,507 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-27 12:34:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:34:39,508 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-27 12:34:39,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-27 12:34:39,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 12:34:39,524 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:34:39,524 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:34:39,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:34:39,725 WARN L477 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-04-27 12:34:39,725 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:34:39,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:34:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-27 12:34:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:34:39,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096699231] [2022-04-27 12:34:39,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:39,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:34:39,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:34:39,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [762909451] [2022-04-27 12:34:39,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:39,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:34:39,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:34:39,748 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-04-27 12:34:39,755 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-04-27 12:34:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:39,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 12:34:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:39,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:34:40,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {715#true} call ULTIMATE.init(); {715#true} is VALID [2022-04-27 12:34:40,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {715#true} is VALID [2022-04-27 12:34:40,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:34:40,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715#true} {715#true} #89#return; {715#true} is VALID [2022-04-27 12:34:40,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {715#true} call #t~ret5 := main(); {715#true} is VALID [2022-04-27 12:34:40,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {715#true} is VALID [2022-04-27 12:34:40,826 INFO L272 TraceCheckUtils]: 6: Hoare triple {715#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {715#true} is VALID [2022-04-27 12:34:40,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} ~cond := #in~cond; {741#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:34:40,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {741#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {745#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:34:40,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {745#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {745#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:34:40,829 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {745#(not (= |assume_abort_if_not_#in~cond| 0))} {715#true} #81#return; {752#(< (mod main_~B~0 4294967296) 2147483647)} is VALID [2022-04-27 12:34:40,830 INFO L272 TraceCheckUtils]: 11: Hoare triple {752#(< (mod main_~B~0 4294967296) 2147483647)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {715#true} is VALID [2022-04-27 12:34:40,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-27 12:34:40,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-27 12:34:40,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:34:40,830 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {715#true} {752#(< (mod main_~B~0 4294967296) 2147483647)} #83#return; {752#(< (mod main_~B~0 4294967296) 2147483647)} is VALID [2022-04-27 12:34:40,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {752#(< (mod main_~B~0 4294967296) 2147483647)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:34:40,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:34:40,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !!(#t~post3 < 2);havoc #t~post3; {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:34:40,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:34:40,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:34:40,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !!(#t~post4 < 2);havoc #t~post4; {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:34:40,838 INFO L272 TraceCheckUtils]: 22: Hoare triple {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:34:40,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:34:40,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {716#false} is VALID [2022-04-27 12:34:40,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-04-27 12:34:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 12:34:40,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:34:41,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-04-27 12:34:41,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {716#false} is VALID [2022-04-27 12:34:41,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:34:41,302 INFO L272 TraceCheckUtils]: 22: Hoare triple {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:34:41,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !!(#t~post4 < 2);havoc #t~post4; {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:34:41,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:34:41,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:34:41,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !!(#t~post3 < 2);havoc #t~post3; {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:34:41,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:34:41,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {715#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:34:41,310 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {715#true} {715#true} #83#return; {715#true} is VALID [2022-04-27 12:34:41,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:34:41,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-27 12:34:41,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-27 12:34:41,310 INFO L272 TraceCheckUtils]: 11: Hoare triple {715#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {715#true} is VALID [2022-04-27 12:34:41,310 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {715#true} {715#true} #81#return; {715#true} is VALID [2022-04-27 12:34:41,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:34:41,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-27 12:34:41,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-27 12:34:41,311 INFO L272 TraceCheckUtils]: 6: Hoare triple {715#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {715#true} is VALID [2022-04-27 12:34:41,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {715#true} is VALID [2022-04-27 12:34:41,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {715#true} call #t~ret5 := main(); {715#true} is VALID [2022-04-27 12:34:41,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715#true} {715#true} #89#return; {715#true} is VALID [2022-04-27 12:34:41,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:34:41,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {715#true} is VALID [2022-04-27 12:34:41,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {715#true} call ULTIMATE.init(); {715#true} is VALID [2022-04-27 12:34:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:34:41,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:34:41,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096699231] [2022-04-27 12:34:41,313 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:34:41,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762909451] [2022-04-27 12:34:41,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762909451] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:34:41,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:34:41,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 12:34:41,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693409879] [2022-04-27 12:34:41,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:34:41,314 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, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 12:34:41,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:34:41,314 INFO L86 InductivityCheck]: Starting inductivity 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, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:34:41,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:41,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:34:41,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:34:41,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:34:41,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:34:41,336 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, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:34:43,619 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:34:45,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:34:47,764 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:34:49,885 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:34:49,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:49,887 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-04-27 12:34:49,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:34:49,960 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, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 12:34:49,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:34:49,960 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, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:34:49,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:34:49,962 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, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:34:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:34:49,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 12:34:50,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:50,020 INFO L225 Difference]: With dead ends: 42 [2022-04-27 12:34:50,020 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 12:34:50,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:34:50,022 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:34:50,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 127 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 4 Unknown, 0 Unchecked, 8.2s Time] [2022-04-27 12:34:50,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 12:34:50,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-27 12:34:50,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:34:50,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:34:50,031 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:34:50,031 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:34:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:50,033 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 12:34:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 12:34:50,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:50,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:50,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-27 12:34:50,034 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-27 12:34:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:50,036 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 12:34:50,037 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 12:34:50,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:50,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:50,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:34:50,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:34:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:34:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-27 12:34:50,039 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-27 12:34:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:34:50,040 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-27 12:34:50,040 INFO L496 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, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:34:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 12:34:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 12:34:50,041 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:34:50,041 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:34:50,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 12:34:50,258 WARN L477 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-04-27 12:34:50,259 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:34:50,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:34:50,260 INFO L85 PathProgramCache]: Analyzing trace with hash -193375877, now seen corresponding path program 1 times [2022-04-27 12:34:50,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:34:50,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780427619] [2022-04-27 12:34:50,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:34:50,283 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:34:50,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1852330307] [2022-04-27 12:34:50,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:50,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:34:50,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:34:50,285 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-04-27 12:34:50,319 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-04-27 12:34:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:50,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:34:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:50,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:34:50,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {1071#true} call ULTIMATE.init(); {1071#true} is VALID [2022-04-27 12:34:50,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {1071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1079#(<= ~counter~0 0)} {1071#true} #89#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {1079#(<= ~counter~0 0)} call #t~ret5 := main(); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {1079#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,507 INFO L272 TraceCheckUtils]: 6: Hoare triple {1079#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {1079#(<= ~counter~0 0)} ~cond := #in~cond; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {1079#(<= ~counter~0 0)} assume !(0 == ~cond); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,508 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1079#(<= ~counter~0 0)} {1079#(<= ~counter~0 0)} #81#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,509 INFO L272 TraceCheckUtils]: 11: Hoare triple {1079#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {1079#(<= ~counter~0 0)} ~cond := #in~cond; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {1079#(<= ~counter~0 0)} assume !(0 == ~cond); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,511 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1079#(<= ~counter~0 0)} {1079#(<= ~counter~0 0)} #83#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {1079#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {1079#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1128#(<= ~counter~0 1)} is VALID [2022-04-27 12:34:50,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {1128#(<= ~counter~0 1)} assume !!(#t~post3 < 2);havoc #t~post3; {1128#(<= ~counter~0 1)} is VALID [2022-04-27 12:34:50,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {1128#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1128#(<= ~counter~0 1)} is VALID [2022-04-27 12:34:50,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {1128#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1138#(<= |main_#t~post3| 1)} is VALID [2022-04-27 12:34:50,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#(<= |main_#t~post3| 1)} assume !(#t~post3 < 2);havoc #t~post3; {1072#false} is VALID [2022-04-27 12:34:50,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {1072#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1072#false} is VALID [2022-04-27 12:34:50,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {1072#false} assume !(#t~post4 < 2);havoc #t~post4; {1072#false} is VALID [2022-04-27 12:34:50,516 INFO L272 TraceCheckUtils]: 24: Hoare triple {1072#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1072#false} is VALID [2022-04-27 12:34:50,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {1072#false} ~cond := #in~cond; {1072#false} is VALID [2022-04-27 12:34:50,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {1072#false} assume 0 == ~cond; {1072#false} is VALID [2022-04-27 12:34:50,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {1072#false} assume !false; {1072#false} is VALID [2022-04-27 12:34:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:34:50,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:34:50,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {1072#false} assume !false; {1072#false} is VALID [2022-04-27 12:34:50,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {1072#false} assume 0 == ~cond; {1072#false} is VALID [2022-04-27 12:34:50,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {1072#false} ~cond := #in~cond; {1072#false} is VALID [2022-04-27 12:34:50,656 INFO L272 TraceCheckUtils]: 24: Hoare triple {1072#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1072#false} is VALID [2022-04-27 12:34:50,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {1072#false} assume !(#t~post4 < 2);havoc #t~post4; {1072#false} is VALID [2022-04-27 12:34:50,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {1072#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1072#false} is VALID [2022-04-27 12:34:50,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#(<= |main_#t~post3| 1)} assume !(#t~post3 < 2);havoc #t~post3; {1072#false} is VALID [2022-04-27 12:34:50,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {1128#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1138#(<= |main_#t~post3| 1)} is VALID [2022-04-27 12:34:50,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {1128#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1128#(<= ~counter~0 1)} is VALID [2022-04-27 12:34:50,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {1128#(<= ~counter~0 1)} assume !!(#t~post3 < 2);havoc #t~post3; {1128#(<= ~counter~0 1)} is VALID [2022-04-27 12:34:50,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {1079#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1128#(<= ~counter~0 1)} is VALID [2022-04-27 12:34:50,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {1079#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,659 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1071#true} {1079#(<= ~counter~0 0)} #83#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {1071#true} assume true; {1071#true} is VALID [2022-04-27 12:34:50,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {1071#true} assume !(0 == ~cond); {1071#true} is VALID [2022-04-27 12:34:50,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {1071#true} ~cond := #in~cond; {1071#true} is VALID [2022-04-27 12:34:50,660 INFO L272 TraceCheckUtils]: 11: Hoare triple {1079#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1071#true} is VALID [2022-04-27 12:34:50,661 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1071#true} {1079#(<= ~counter~0 0)} #81#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {1071#true} assume true; {1071#true} is VALID [2022-04-27 12:34:50,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {1071#true} assume !(0 == ~cond); {1071#true} is VALID [2022-04-27 12:34:50,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {1071#true} ~cond := #in~cond; {1071#true} is VALID [2022-04-27 12:34:50,661 INFO L272 TraceCheckUtils]: 6: Hoare triple {1079#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1071#true} is VALID [2022-04-27 12:34:50,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {1079#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {1079#(<= ~counter~0 0)} call #t~ret5 := main(); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1079#(<= ~counter~0 0)} {1071#true} #89#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {1071#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:34:50,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {1071#true} call ULTIMATE.init(); {1071#true} is VALID [2022-04-27 12:34:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:34:50,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:34:50,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780427619] [2022-04-27 12:34:50,692 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:34:50,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852330307] [2022-04-27 12:34:50,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852330307] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:34:50,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:34:50,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-27 12:34:50,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947133425] [2022-04-27 12:34:50,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:34:50,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 28 [2022-04-27 12:34:50,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:34:50,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:34:50,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:50,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:34:50,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:34:50,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:34:50,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:34:50,725 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:34:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:50,835 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-27 12:34:50,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:34:50,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 28 [2022-04-27 12:34:50,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:34:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:34:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-27 12:34:50,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:34:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-27 12:34:50,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-27 12:34:50,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:50,906 INFO L225 Difference]: With dead ends: 53 [2022-04-27 12:34:50,906 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 12:34:50,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:34:50,907 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:34:50,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 81 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:34:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 12:34:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-27 12:34:50,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:34:50,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:34:50,923 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:34:50,923 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:34:50,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:50,925 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 12:34:50,925 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-27 12:34:50,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:50,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:50,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 41 states. [2022-04-27 12:34:50,926 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 41 states. [2022-04-27 12:34:50,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:50,927 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 12:34:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-27 12:34:50,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:50,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:50,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:34:50,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:34:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:34:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-04-27 12:34:50,930 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 28 [2022-04-27 12:34:50,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:34:50,930 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-04-27 12:34:50,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:34:50,930 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-27 12:34:50,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 12:34:50,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:34:50,931 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:34:50,955 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-04-27 12:34:51,132 WARN L477 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-04-27 12:34:51,132 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:34:51,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:34:51,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2031725334, now seen corresponding path program 1 times [2022-04-27 12:34:51,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:34:51,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709378173] [2022-04-27 12:34:51,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:51,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:34:51,154 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:34:51,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1069688659] [2022-04-27 12:34:51,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:51,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:34:51,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:34:51,156 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-04-27 12:34:51,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:34:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:51,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 12:34:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:51,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:34:51,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {1454#true} call ULTIMATE.init(); {1454#true} is VALID [2022-04-27 12:34:51,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {1454#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1454#true} is VALID [2022-04-27 12:34:51,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {1454#true} assume true; {1454#true} is VALID [2022-04-27 12:34:51,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1454#true} {1454#true} #89#return; {1454#true} is VALID [2022-04-27 12:34:51,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {1454#true} call #t~ret5 := main(); {1454#true} is VALID [2022-04-27 12:34:51,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {1454#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1454#true} is VALID [2022-04-27 12:34:51,874 INFO L272 TraceCheckUtils]: 6: Hoare triple {1454#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1454#true} is VALID [2022-04-27 12:34:51,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {1454#true} ~cond := #in~cond; {1454#true} is VALID [2022-04-27 12:34:51,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {1454#true} assume !(0 == ~cond); {1454#true} is VALID [2022-04-27 12:34:51,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {1454#true} assume true; {1454#true} is VALID [2022-04-27 12:34:51,874 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1454#true} {1454#true} #81#return; {1454#true} is VALID [2022-04-27 12:34:51,874 INFO L272 TraceCheckUtils]: 11: Hoare triple {1454#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1454#true} is VALID [2022-04-27 12:34:51,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {1454#true} ~cond := #in~cond; {1495#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:34:51,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {1495#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1499#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:34:51,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {1499#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1499#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:34:51,881 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1499#(not (= |assume_abort_if_not_#in~cond| 0))} {1454#true} #83#return; {1506#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 12:34:51,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {1506#(<= 1 (mod main_~B~0 4294967296))} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1510#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:34:51,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {1510#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1510#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:34:51,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {1510#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post3 < 2);havoc #t~post3; {1510#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:34:51,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {1510#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1520#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:34:51,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {1520#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1520#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:34:51,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {1520#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 2);havoc #t~post3; {1520#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:34:51,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {1520#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1520#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:34:51,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {1520#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1520#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:34:51,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {1520#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post4 < 2);havoc #t~post4; {1520#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:34:51,886 INFO L272 TraceCheckUtils]: 25: Hoare triple {1520#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1539#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:34:51,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {1539#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1543#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:34:51,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {1543#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1455#false} is VALID [2022-04-27 12:34:51,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {1455#false} assume !false; {1455#false} is VALID [2022-04-27 12:34:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 12:34:51,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:34:52,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {1455#false} assume !false; {1455#false} is VALID [2022-04-27 12:34:52,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {1543#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1455#false} is VALID [2022-04-27 12:34:52,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {1539#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1543#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:34:52,505 INFO L272 TraceCheckUtils]: 25: Hoare triple {1559#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1539#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:34:52,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {1559#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !(#t~post4 < 2);havoc #t~post4; {1559#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:34:52,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {1559#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1559#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:34:52,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {1559#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1559#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:34:52,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {1559#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !!(#t~post3 < 2);havoc #t~post3; {1559#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:34:52,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {1559#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1559#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:34:52,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {1578#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1559#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:34:52,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {1578#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(#t~post3 < 2);havoc #t~post3; {1578#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 12:34:52,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {1578#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1578#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 12:34:52,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {1454#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1578#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 12:34:52,511 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1454#true} {1454#true} #83#return; {1454#true} is VALID [2022-04-27 12:34:52,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {1454#true} assume true; {1454#true} is VALID [2022-04-27 12:34:52,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {1454#true} assume !(0 == ~cond); {1454#true} is VALID [2022-04-27 12:34:52,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {1454#true} ~cond := #in~cond; {1454#true} is VALID [2022-04-27 12:34:52,511 INFO L272 TraceCheckUtils]: 11: Hoare triple {1454#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1454#true} is VALID [2022-04-27 12:34:52,511 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1454#true} {1454#true} #81#return; {1454#true} is VALID [2022-04-27 12:34:52,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {1454#true} assume true; {1454#true} is VALID [2022-04-27 12:34:52,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {1454#true} assume !(0 == ~cond); {1454#true} is VALID [2022-04-27 12:34:52,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {1454#true} ~cond := #in~cond; {1454#true} is VALID [2022-04-27 12:34:52,512 INFO L272 TraceCheckUtils]: 6: Hoare triple {1454#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1454#true} is VALID [2022-04-27 12:34:52,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {1454#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1454#true} is VALID [2022-04-27 12:34:52,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {1454#true} call #t~ret5 := main(); {1454#true} is VALID [2022-04-27 12:34:52,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1454#true} {1454#true} #89#return; {1454#true} is VALID [2022-04-27 12:34:52,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {1454#true} assume true; {1454#true} is VALID [2022-04-27 12:34:52,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {1454#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1454#true} is VALID [2022-04-27 12:34:52,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {1454#true} call ULTIMATE.init(); {1454#true} is VALID [2022-04-27 12:34:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:34:52,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:34:52,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709378173] [2022-04-27 12:34:52,513 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:34:52,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069688659] [2022-04-27 12:34:52,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069688659] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:34:52,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:34:52,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 12:34:52,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122547248] [2022-04-27 12:34:52,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:34:52,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-27 12:34:52,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:34:52,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:34:54,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:54,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:34:54,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:34:54,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:34:54,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:34:54,554 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:34:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:54,713 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-27 12:34:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:34:54,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-27 12:34:54,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:34:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:34:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-27 12:34:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:34:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-27 12:34:54,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-27 12:34:56,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:56,785 INFO L225 Difference]: With dead ends: 51 [2022-04-27 12:34:56,785 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 12:34:56,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:34:56,786 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 130 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-04-27 12:34:56,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 130 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 17 Unchecked, 0.0s Time] [2022-04-27 12:34:56,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 12:34:56,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-27 12:34:56,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:34:56,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:34:56,796 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:34:56,796 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:34:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:56,798 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-27 12:34:56,798 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-27 12:34:56,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:56,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:56,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 44 states. [2022-04-27 12:34:56,799 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 44 states. [2022-04-27 12:34:56,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:56,801 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-27 12:34:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-27 12:34:56,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:56,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:56,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:34:56,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:34:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:34:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-04-27 12:34:56,804 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 29 [2022-04-27 12:34:56,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:34:56,804 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-04-27 12:34:56,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:34:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-04-27 12:34:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 12:34:56,805 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:34:56,805 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:34:56,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:34:57,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:34:57,026 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:34:57,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:34:57,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2029937874, now seen corresponding path program 1 times [2022-04-27 12:34:57,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:34:57,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996435182] [2022-04-27 12:34:57,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:57,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:34:57,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:34:57,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1684921815] [2022-04-27 12:34:57,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:57,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:34:57,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:34:57,044 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:34:57,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 12:34:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:57,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:34:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:57,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:34:57,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {1855#true} call ULTIMATE.init(); {1855#true} is VALID [2022-04-27 12:34:57,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {1855#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1863#(<= 0 ~counter~0)} is VALID [2022-04-27 12:34:57,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {1863#(<= 0 ~counter~0)} assume true; {1863#(<= 0 ~counter~0)} is VALID [2022-04-27 12:34:57,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1863#(<= 0 ~counter~0)} {1855#true} #89#return; {1863#(<= 0 ~counter~0)} is VALID [2022-04-27 12:34:57,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {1863#(<= 0 ~counter~0)} call #t~ret5 := main(); {1863#(<= 0 ~counter~0)} is VALID [2022-04-27 12:34:57,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {1863#(<= 0 ~counter~0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1863#(<= 0 ~counter~0)} is VALID [2022-04-27 12:34:57,279 INFO L272 TraceCheckUtils]: 6: Hoare triple {1863#(<= 0 ~counter~0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1863#(<= 0 ~counter~0)} is VALID [2022-04-27 12:34:57,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {1863#(<= 0 ~counter~0)} ~cond := #in~cond; {1863#(<= 0 ~counter~0)} is VALID [2022-04-27 12:34:57,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {1863#(<= 0 ~counter~0)} assume !(0 == ~cond); {1863#(<= 0 ~counter~0)} is VALID [2022-04-27 12:34:57,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {1863#(<= 0 ~counter~0)} assume true; {1863#(<= 0 ~counter~0)} is VALID [2022-04-27 12:34:57,280 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1863#(<= 0 ~counter~0)} {1863#(<= 0 ~counter~0)} #81#return; {1863#(<= 0 ~counter~0)} is VALID [2022-04-27 12:34:57,282 INFO L272 TraceCheckUtils]: 11: Hoare triple {1863#(<= 0 ~counter~0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1863#(<= 0 ~counter~0)} is VALID [2022-04-27 12:34:57,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {1863#(<= 0 ~counter~0)} ~cond := #in~cond; {1863#(<= 0 ~counter~0)} is VALID [2022-04-27 12:34:57,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {1863#(<= 0 ~counter~0)} assume !(0 == ~cond); {1863#(<= 0 ~counter~0)} is VALID [2022-04-27 12:34:57,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {1863#(<= 0 ~counter~0)} assume true; {1863#(<= 0 ~counter~0)} is VALID [2022-04-27 12:34:57,283 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1863#(<= 0 ~counter~0)} {1863#(<= 0 ~counter~0)} #83#return; {1863#(<= 0 ~counter~0)} is VALID [2022-04-27 12:34:57,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {1863#(<= 0 ~counter~0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1863#(<= 0 ~counter~0)} is VALID [2022-04-27 12:34:57,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {1863#(<= 0 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1912#(<= 1 ~counter~0)} is VALID [2022-04-27 12:34:57,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {1912#(<= 1 ~counter~0)} assume !!(#t~post3 < 2);havoc #t~post3; {1912#(<= 1 ~counter~0)} is VALID [2022-04-27 12:34:57,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {1912#(<= 1 ~counter~0)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1912#(<= 1 ~counter~0)} is VALID [2022-04-27 12:34:57,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {1912#(<= 1 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1922#(<= 2 ~counter~0)} is VALID [2022-04-27 12:34:57,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {1922#(<= 2 ~counter~0)} assume !!(#t~post3 < 2);havoc #t~post3; {1922#(<= 2 ~counter~0)} is VALID [2022-04-27 12:34:57,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {1922#(<= 2 ~counter~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1922#(<= 2 ~counter~0)} is VALID [2022-04-27 12:34:57,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {1922#(<= 2 ~counter~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1932#(<= 2 |main_#t~post4|)} is VALID [2022-04-27 12:34:57,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {1932#(<= 2 |main_#t~post4|)} assume !!(#t~post4 < 2);havoc #t~post4; {1856#false} is VALID [2022-04-27 12:34:57,287 INFO L272 TraceCheckUtils]: 25: Hoare triple {1856#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1856#false} is VALID [2022-04-27 12:34:57,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {1856#false} ~cond := #in~cond; {1856#false} is VALID [2022-04-27 12:34:57,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {1856#false} assume 0 == ~cond; {1856#false} is VALID [2022-04-27 12:34:57,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {1856#false} assume !false; {1856#false} is VALID [2022-04-27 12:34:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:34:57,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:34:57,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:34:57,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996435182] [2022-04-27 12:34:57,288 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:34:57,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684921815] [2022-04-27 12:34:57,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684921815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:34:57,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:34:57,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:34:57,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170767273] [2022-04-27 12:34:57,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:34:57,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-27 12:34:57,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:34:57,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:57,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:57,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:34:57,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:34:57,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:34:57,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:34:57,310 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:57,456 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-27 12:34:57,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:34:57,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-27 12:34:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:34:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-27 12:34:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:57,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-27 12:34:57,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-27 12:34:57,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:57,508 INFO L225 Difference]: With dead ends: 53 [2022-04-27 12:34:57,508 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 12:34:57,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:34:57,509 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:34:57,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 81 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:34:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 12:34:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 12:34:57,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:34:57,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:34:57,531 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:34:57,531 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:34:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:57,532 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-27 12:34:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-27 12:34:57,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:57,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:57,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 32 states. [2022-04-27 12:34:57,533 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 32 states. [2022-04-27 12:34:57,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:57,535 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-27 12:34:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-27 12:34:57,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:57,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:57,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:34:57,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:34:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:34:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-04-27 12:34:57,536 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2022-04-27 12:34:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:34:57,537 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-04-27 12:34:57,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:34:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-27 12:34:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 12:34:57,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:34:57,538 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2022-04-27 12:34:57,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:34:57,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:34:57,752 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:34:57,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:34:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 1 times [2022-04-27 12:34:57,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:34:57,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125812819] [2022-04-27 12:34:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:57,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:34:57,764 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:34:57,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1537853281] [2022-04-27 12:34:57,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:34:57,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:34:57,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:34:57,765 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:34:57,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:34:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:57,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 12:34:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:34:57,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:34:57,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {2127#true} call ULTIMATE.init(); {2127#true} is VALID [2022-04-27 12:34:57,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {2127#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2127#true} is VALID [2022-04-27 12:34:57,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {2127#true} assume true; {2127#true} is VALID [2022-04-27 12:34:57,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2127#true} {2127#true} #89#return; {2127#true} is VALID [2022-04-27 12:34:57,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {2127#true} call #t~ret5 := main(); {2127#true} is VALID [2022-04-27 12:34:57,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {2127#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2127#true} is VALID [2022-04-27 12:34:57,884 INFO L272 TraceCheckUtils]: 6: Hoare triple {2127#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2127#true} is VALID [2022-04-27 12:34:57,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {2127#true} ~cond := #in~cond; {2127#true} is VALID [2022-04-27 12:34:57,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {2127#true} assume !(0 == ~cond); {2127#true} is VALID [2022-04-27 12:34:57,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {2127#true} assume true; {2127#true} is VALID [2022-04-27 12:34:57,885 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2127#true} {2127#true} #81#return; {2127#true} is VALID [2022-04-27 12:34:57,885 INFO L272 TraceCheckUtils]: 11: Hoare triple {2127#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2127#true} is VALID [2022-04-27 12:34:57,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {2127#true} ~cond := #in~cond; {2127#true} is VALID [2022-04-27 12:34:57,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {2127#true} assume !(0 == ~cond); {2127#true} is VALID [2022-04-27 12:34:57,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {2127#true} assume true; {2127#true} is VALID [2022-04-27 12:34:57,885 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2127#true} {2127#true} #83#return; {2127#true} is VALID [2022-04-27 12:34:57,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {2127#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2180#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:34:57,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {2180#(= main_~B~0 main_~b~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2180#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:34:57,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {2180#(= main_~B~0 main_~b~0)} assume !!(#t~post3 < 2);havoc #t~post3; {2180#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:34:57,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {2180#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2180#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:34:57,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {2180#(= main_~B~0 main_~b~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2180#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:34:57,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {2180#(= main_~B~0 main_~b~0)} assume !!(#t~post4 < 2);havoc #t~post4; {2180#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:34:57,888 INFO L272 TraceCheckUtils]: 22: Hoare triple {2180#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2127#true} is VALID [2022-04-27 12:34:57,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {2127#true} ~cond := #in~cond; {2127#true} is VALID [2022-04-27 12:34:57,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {2127#true} assume !(0 == ~cond); {2127#true} is VALID [2022-04-27 12:34:57,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {2127#true} assume true; {2127#true} is VALID [2022-04-27 12:34:57,890 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2127#true} {2180#(= main_~B~0 main_~b~0)} #85#return; {2180#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:34:57,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {2180#(= main_~B~0 main_~b~0)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2128#false} is VALID [2022-04-27 12:34:57,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {2128#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2128#false} is VALID [2022-04-27 12:34:57,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {2128#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2128#false} is VALID [2022-04-27 12:34:57,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {2128#false} assume !(#t~post4 < 2);havoc #t~post4; {2128#false} is VALID [2022-04-27 12:34:57,890 INFO L272 TraceCheckUtils]: 31: Hoare triple {2128#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2128#false} is VALID [2022-04-27 12:34:57,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {2128#false} ~cond := #in~cond; {2128#false} is VALID [2022-04-27 12:34:57,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {2128#false} assume 0 == ~cond; {2128#false} is VALID [2022-04-27 12:34:57,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {2128#false} assume !false; {2128#false} is VALID [2022-04-27 12:34:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:34:57,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:34:57,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:34:57,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125812819] [2022-04-27 12:34:57,891 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:34:57,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537853281] [2022-04-27 12:34:57,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537853281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:34:57,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:34:57,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:34:57,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735024293] [2022-04-27 12:34:57,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:34:57,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-27 12:34:57,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:34:57,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:34:57,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:57,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:34:57,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:34:57,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:34:57,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:34:57,921 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:34:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:57,962 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-27 12:34:57,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:34:57,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-27 12:34:57,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:34:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:34:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-27 12:34:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:34:57,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-27 12:34:57,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-04-27 12:34:57,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:34:57,992 INFO L225 Difference]: With dead ends: 32 [2022-04-27 12:34:57,992 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 12:34:57,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-04-27 12:34:57,993 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:34:57,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:34:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 12:34:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 12:34:57,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:34:57,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:34:57,994 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:34:57,994 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:34:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:57,994 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:34:57,994 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:34:57,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:57,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:57,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 12:34:57,995 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 12:34:57,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:34:57,995 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:34:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:34:57,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:57,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:34:57,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:34:57,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:34:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:34:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 12:34:57,995 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-04-27 12:34:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:34:57,995 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 12:34:57,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:34:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:34:57,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:34:57,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 12:34:58,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-27 12:34:58,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:34:58,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 12:35:02,757 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 12:35:02,757 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 12:35:02,757 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 12:35:02,757 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 12:35:02,757 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2022-04-27 12:35:02,757 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2022-04-27 12:35:02,758 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2022-04-27 12:35:02,758 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:35:02,758 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:35:02,758 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 26 52) no Hoare annotation was computed. [2022-04-27 12:35:02,758 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-04-27 12:35:02,758 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 26 52) no Hoare annotation was computed. [2022-04-27 12:35:02,758 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 49) no Hoare annotation was computed. [2022-04-27 12:35:02,758 INFO L895 garLoopResultBuilder]: At program point L40-2(lines 40 49) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:35:02,758 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 36 39) no Hoare annotation was computed. [2022-04-27 12:35:02,758 INFO L895 garLoopResultBuilder]: At program point L36-3(lines 36 39) the Hoare annotation is: (let ((.cse0 (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))) (or (and (<= 2 ~counter~0) .cse0) (not (<= |old(~counter~0)| 0)) (and (<= ~counter~0 1) .cse0 (<= 1 ~counter~0)) (and (or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) .cse0) (<= 0 ~counter~0) (<= ~counter~0 0) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (= main_~B~0 main_~b~0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-27 12:35:02,758 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-04-27 12:35:02,758 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 26 52) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:35:02,758 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 48) no Hoare annotation was computed. [2022-04-27 12:35:02,758 INFO L899 garLoopResultBuilder]: For program point L45-2(lines 26 52) no Hoare annotation was computed. [2022-04-27 12:35:02,758 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (or (and (<= 2 ~counter~0) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (= main_~B~0 main_~b~0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:35:02,759 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 40 49) no Hoare annotation was computed. [2022-04-27 12:35:02,759 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-04-27 12:35:02,759 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:35:02,759 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 12:35:02,759 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:35:02,759 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:35:02,759 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-27 12:35:02,759 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 12:35:02,759 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:35:02,759 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 24) no Hoare annotation was computed. [2022-04-27 12:35:02,759 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 24) the Hoare annotation is: true [2022-04-27 12:35:02,759 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 24) no Hoare annotation was computed. [2022-04-27 12:35:02,759 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 21) no Hoare annotation was computed. [2022-04-27 12:35:02,759 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 22) no Hoare annotation was computed. [2022-04-27 12:35:02,759 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2022-04-27 12:35:02,762 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:35:02,764 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 12:35:02,766 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:35:02,766 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:35:02,767 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:35:02,767 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:35:02,769 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 12:35:02,769 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 12:35:02,769 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:35:02,769 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:35:02,770 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:35:02,770 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:35:02,770 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 12:35:02,770 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 12:35:02,770 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 12:35:02,770 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:35:02,770 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 12:35:02,770 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 12:35:02,770 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 12:35:02,770 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 12:35:02,770 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-27 12:35:02,770 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:35:02,770 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:35:02,770 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 12:35:02,771 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 12:35:02,772 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 12:35:02,772 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 12:35:02,772 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-27 12:35:02,772 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 12:35:02,776 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:35:02,776 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:35:02,776 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:35:02,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:35:02,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:35:02,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:35:02,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 12:35:02 BoogieIcfgContainer [2022-04-27 12:35:02,782 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 12:35:02,782 INFO L158 Benchmark]: Toolchain (without parser) took 27951.30ms. Allocated memory was 187.7MB in the beginning and 273.7MB in the end (delta: 86.0MB). Free memory was 130.8MB in the beginning and 184.9MB in the end (delta: -54.1MB). Peak memory consumption was 32.7MB. Max. memory is 8.0GB. [2022-04-27 12:35:02,783 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 187.7MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:35:02,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.77ms. Allocated memory is still 187.7MB. Free memory was 130.5MB in the beginning and 156.1MB in the end (delta: -25.6MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-27 12:35:02,783 INFO L158 Benchmark]: Boogie Preprocessor took 44.32ms. Allocated memory is still 187.7MB. Free memory was 156.1MB in the beginning and 154.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 12:35:02,783 INFO L158 Benchmark]: RCFGBuilder took 301.07ms. Allocated memory is still 187.7MB. Free memory was 154.5MB in the beginning and 142.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 12:35:02,784 INFO L158 Benchmark]: TraceAbstraction took 27330.67ms. Allocated memory was 187.7MB in the beginning and 273.7MB in the end (delta: 86.0MB). Free memory was 141.9MB in the beginning and 184.9MB in the end (delta: -43.0MB). Peak memory consumption was 44.6MB. Max. memory is 8.0GB. [2022-04-27 12:35:02,785 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 187.7MB. Free memory is still 147.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 267.77ms. Allocated memory is still 187.7MB. Free memory was 130.5MB in the beginning and 156.1MB in the end (delta: -25.6MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.32ms. Allocated memory is still 187.7MB. Free memory was 156.1MB in the beginning and 154.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 301.07ms. Allocated memory is still 187.7MB. Free memory was 154.5MB in the beginning and 142.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 27330.67ms. Allocated memory was 187.7MB in the beginning and 273.7MB in the end (delta: 86.0MB). Free memory was 141.9MB in the beginning and 184.9MB in the end (delta: -43.0MB). Peak memory consumption was 44.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 673 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 17 IncrementalHoareTripleChecker+Unchecked, 419 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 254 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 249 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=6, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 25 PreInvPairs, 32 NumberOfFragments, 201 HoareAnnotationTreeSize, 25 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 51 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 293 ConstructedInterpolants, 9 QuantifiedInterpolants, 979 SizeOfPredicates, 15 NumberOfNonLiveVariables, 683 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 51/61 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant [2022-04-27 12:35:02,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:35:02,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:35:02,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:35:02,791 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:35:02,791 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:35:02,791 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] Derived loop invariant: ((((2 <= counter && (forall main_~b~0 : int :: A % 4294967296 == (r + main_~b~0 * q) % 4294967296)) || !(\old(counter) <= 0)) || ((counter <= 1 && (forall main_~b~0 : int :: A % 4294967296 == (r + main_~b~0 * q) % 4294967296)) && 1 <= counter)) || (((((!(b % 4294967296 <= r % 4294967296) || (forall main_~b~0 : int :: A % 4294967296 == (r + main_~b~0 * q) % 4294967296)) && 0 <= counter) && counter <= 0) && A % 4294967296 == (r + b * q) % 4294967296) && B == b)) || !(0 <= \old(counter)) RESULT: Ultimate proved your program to be correct! [2022-04-27 12:35:02,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...