/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_unwindbound20.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:35:05,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:35:05,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:35:05,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:35:05,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:35:05,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:35:05,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:35:05,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:35:05,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:35:05,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:35:05,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:35:05,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:35:05,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:35:05,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:35:05,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:35:05,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:35:05,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:35:05,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:35:05,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:35:05,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:35:05,595 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:35:05,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:35:05,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:35:05,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:35:05,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:35:05,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:35:05,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:35:05,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:35:05,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:35:05,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:35:05,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:35:05,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:35:05,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:35:05,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:35:05,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:35:05,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:35:05,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:35:05,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:35:05,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:35:05,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:35:05,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:35:05,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:35:05,620 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:35:05,646 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:35:05,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:35:05,647 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:35:05,647 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:35:05,647 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:35:05,647 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:35:05,648 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:35:05,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:35:05,648 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:35:05,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:35:05,648 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:35:05,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:35:05,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:35:05,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:35:05,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:35:05,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:35:05,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:35:05,649 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:35:05,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:35:05,649 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:35:05,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:35:05,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:35:05,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:35:05,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:35:05,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:35:05,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:35:05,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:35:05,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:35:05,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:35:05,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:35:05,651 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:35:05,651 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:35:05,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:35:05,651 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:35:05,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:35:05,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:35:05,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:35:05,869 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:35:05,869 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:35:05,871 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound20.i [2022-04-27 12:35:05,923 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26901676f/0ee5cf99b31f4689af0587d60deb6a3b/FLAG9a7f17755 [2022-04-27 12:35:06,338 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:35:06,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound20.i [2022-04-27 12:35:06,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26901676f/0ee5cf99b31f4689af0587d60deb6a3b/FLAG9a7f17755 [2022-04-27 12:35:06,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26901676f/0ee5cf99b31f4689af0587d60deb6a3b [2022-04-27 12:35:06,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:35:06,760 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:35:06,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:35:06,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:35:06,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:35:06,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:35:06" (1/1) ... [2022-04-27 12:35:06,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d57a6c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:35:06, skipping insertion in model container [2022-04-27 12:35:06,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:35:06" (1/1) ... [2022-04-27 12:35:06,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:35:06,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:35:06,929 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_unwindbound20.i[950,963] [2022-04-27 12:35:06,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:35:06,959 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:35:06,969 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_unwindbound20.i[950,963] [2022-04-27 12:35:06,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:35:06,986 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:35:06,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:35:06 WrapperNode [2022-04-27 12:35:06,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:35:06,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:35:06,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:35:06,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:35:06,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:35:06" (1/1) ... [2022-04-27 12:35:06,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:35:06" (1/1) ... [2022-04-27 12:35:07,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:35:06" (1/1) ... [2022-04-27 12:35:07,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:35:06" (1/1) ... [2022-04-27 12:35:07,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:35:06" (1/1) ... [2022-04-27 12:35:07,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:35:06" (1/1) ... [2022-04-27 12:35:07,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:35:06" (1/1) ... [2022-04-27 12:35:07,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:35:07,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:35:07,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:35:07,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:35:07,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:35:06" (1/1) ... [2022-04-27 12:35:07,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:35:07,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:35:07,052 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:35:07,078 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:35:07,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:35:07,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:35:07,101 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:35:07,102 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:35:07,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:35:07,104 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:35:07,104 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:35:07,104 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:35:07,104 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 12:35:07,104 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 12:35:07,104 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:35:07,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:35:07,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:35:07,105 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:35:07,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:35:07,105 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:35:07,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:35:07,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:35:07,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:35:07,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:35:07,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:35:07,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:35:07,162 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:35:07,164 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:35:07,279 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:35:07,285 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:35:07,286 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:35:07,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:35:07 BoogieIcfgContainer [2022-04-27 12:35:07,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:35:07,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:35:07,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:35:07,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:35:07,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:35:06" (1/3) ... [2022-04-27 12:35:07,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c4d0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:35:07, skipping insertion in model container [2022-04-27 12:35:07,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:35:06" (2/3) ... [2022-04-27 12:35:07,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c4d0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:35:07, skipping insertion in model container [2022-04-27 12:35:07,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:35:07" (3/3) ... [2022-04-27 12:35:07,294 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound20.i [2022-04-27 12:35:07,306 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:35:07,306 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:35:07,359 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:35:07,365 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@2179194a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@d1ef47f [2022-04-27 12:35:07,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:35:07,377 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:35:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:35:07,387 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:35:07,387 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:35:07,388 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:35:07,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:35:07,396 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-27 12:35:07,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:35:07,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640837917] [2022-04-27 12:35:07,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:07,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:35:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:07,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:35:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:07,589 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:35:07,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 12:35:07,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-27 12:35:07,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:35:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:07,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:35:07,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:35:07,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:35:07,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-27 12:35:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:35:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:07,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:35:07,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:35:07,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:35:07,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-27 12:35:07,610 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:35:07,610 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:35:07,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 12:35:07,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-27 12:35:07,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-27 12:35:07,611 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:35:07,611 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:35:07,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:35:07,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:35:07,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:35:07,613 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-27 12:35:07,613 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:35:07,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:35:07,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:35:07,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:35:07,615 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-27 12:35:07,615 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:35:07,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-27 12:35:07,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-27 12:35:07,616 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:35:07,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-27 12:35:07,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-27 12:35:07,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-27 12:35:07,617 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:35:07,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:35:07,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640837917] [2022-04-27 12:35:07,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640837917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:35:07,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:35:07,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:35:07,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967075209] [2022-04-27 12:35:07,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:35:07,625 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:35:07,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:35:07,632 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:35:07,656 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:35:07,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:35:07,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:35:07,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:35:07,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:35:07,690 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:35:07,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:07,851 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-27 12:35:07,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:35:07,851 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:35:07,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:35:07,853 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:35:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-27 12:35:07,862 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:35:07,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-27 12:35:07,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-27 12:35:07,952 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:35:07,960 INFO L225 Difference]: With dead ends: 60 [2022-04-27 12:35:07,961 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 12:35:07,963 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:35:07,966 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:35:07,967 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:35:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 12:35:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-27 12:35:07,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:35:07,993 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:35:07,994 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:35:07,994 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:35:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:07,998 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 12:35:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:35:07,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:07,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:08,000 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:35:08,000 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:35:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:08,003 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 12:35:08,003 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:35:08,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:08,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:08,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:35:08,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:35:08,005 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:35:08,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-27 12:35:08,008 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-27 12:35:08,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:35:08,009 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-27 12:35:08,009 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:35:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-27 12:35:08,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 12:35:08,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:35:08,010 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:35:08,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:35:08,011 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:35:08,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:35:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-27 12:35:08,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:35:08,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829544662] [2022-04-27 12:35:08,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:08,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:35:08,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:35:08,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [461756816] [2022-04-27 12:35:08,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:08,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:35:08,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:35:08,040 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:35:08,052 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:35:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:08,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:35:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:08,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:35:08,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-27 12:35:08,344 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:35:08,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:08,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {235#(<= ~counter~0 0)} {227#true} #89#return; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:08,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {235#(<= ~counter~0 0)} call #t~ret5 := main(); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:08,345 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:35:08,346 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:35:08,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#(<= ~counter~0 0)} ~cond := #in~cond; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:08,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#(<= ~counter~0 0)} assume !(0 == ~cond); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:08,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:08,349 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:35:08,350 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:35:08,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {235#(<= ~counter~0 0)} ~cond := #in~cond; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:08,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {235#(<= ~counter~0 0)} assume !(0 == ~cond); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:08,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:08,355 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:35:08,356 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:35:08,356 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:35:08,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {284#(<= |main_#t~post3| 0)} assume !(#t~post3 < 20);havoc #t~post3; {228#false} is VALID [2022-04-27 12:35:08,357 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:35:08,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {228#false} assume !(#t~post4 < 20);havoc #t~post4; {228#false} is VALID [2022-04-27 12:35:08,359 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:35:08,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-27 12:35:08,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-27 12:35:08,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-27 12:35:08,361 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:35:08,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:35:08,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:35:08,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829544662] [2022-04-27 12:35:08,362 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:35:08,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461756816] [2022-04-27 12:35:08,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461756816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:35:08,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:35:08,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:35:08,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645674466] [2022-04-27 12:35:08,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:35:08,369 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:35:08,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:35:08,370 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:35:08,387 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:35:08,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:35:08,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:35:08,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:35:08,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:35:08,390 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:35:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:08,471 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-27 12:35:08,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:35:08,472 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:35:08,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:35:08,472 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:35:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-27 12:35:08,475 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:35:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-27 12:35:08,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-27 12:35:08,521 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:35:08,523 INFO L225 Difference]: With dead ends: 42 [2022-04-27 12:35:08,523 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 12:35:08,523 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:35:08,524 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:35:08,525 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:35:08,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 12:35:08,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 12:35:08,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:35:08,536 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:35:08,537 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:35:08,537 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:35:08,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:08,539 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-27 12:35:08,540 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:35:08,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:08,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:08,541 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:35:08,541 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:35:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:08,543 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-27 12:35:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:35:08,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:08,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:08,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:35:08,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:35:08,544 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:35:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-27 12:35:08,546 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-27 12:35:08,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:35:08,547 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-27 12:35:08,547 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:35:08,547 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:35:08,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 12:35:08,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:35:08,548 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:35:08,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 12:35:08,772 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:35:08,773 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:35:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:35:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-27 12:35:08,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:35:08,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369939565] [2022-04-27 12:35:08,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:08,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:35:08,812 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:35:08,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1287732275] [2022-04-27 12:35:08,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:08,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:35:08,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:35:08,821 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:35:08,823 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:35:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:08,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:35:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:08,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:35:09,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {464#true} call ULTIMATE.init(); {464#true} is VALID [2022-04-27 12:35:09,078 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:35:09,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:09,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {472#(<= ~counter~0 0)} {464#true} #89#return; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:09,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {472#(<= ~counter~0 0)} call #t~ret5 := main(); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:09,080 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:35:09,080 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:35:09,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {472#(<= ~counter~0 0)} ~cond := #in~cond; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:09,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {472#(<= ~counter~0 0)} assume !(0 == ~cond); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:09,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:09,082 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:35:09,083 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:35:09,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#(<= ~counter~0 0)} ~cond := #in~cond; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:09,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {472#(<= ~counter~0 0)} assume !(0 == ~cond); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:09,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:09,084 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:35:09,086 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:35:09,086 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:35:09,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {521#(<= ~counter~0 1)} assume !!(#t~post3 < 20);havoc #t~post3; {521#(<= ~counter~0 1)} is VALID [2022-04-27 12:35:09,087 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:35:09,088 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:35:09,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {531#(<= |main_#t~post4| 1)} assume !(#t~post4 < 20);havoc #t~post4; {465#false} is VALID [2022-04-27 12:35:09,089 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:35:09,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {465#false} ~cond := #in~cond; {465#false} is VALID [2022-04-27 12:35:09,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {465#false} assume 0 == ~cond; {465#false} is VALID [2022-04-27 12:35:09,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {465#false} assume !false; {465#false} is VALID [2022-04-27 12:35:09,089 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:35:09,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:35:09,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:35:09,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369939565] [2022-04-27 12:35:09,092 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:35:09,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287732275] [2022-04-27 12:35:09,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287732275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:35:09,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:35:09,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:35:09,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928223162] [2022-04-27 12:35:09,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:35:09,093 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:35:09,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:35:09,094 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:35:09,118 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:35:09,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:35:09,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:35:09,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:35:09,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:35:09,120 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:35:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:09,234 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 12:35:09,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:35:09,234 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:35:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:35:09,236 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:35:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-27 12:35:09,239 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:35:09,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-27 12:35:09,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-27 12:35:09,291 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:35:09,293 INFO L225 Difference]: With dead ends: 41 [2022-04-27 12:35:09,293 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 12:35:09,294 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:35:09,296 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:35:09,297 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:35:09,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 12:35:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-27 12:35:09,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:35:09,310 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:35:09,313 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:35:09,314 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:35:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:09,318 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-27 12:35:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-27 12:35:09,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:09,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:09,320 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:35:09,321 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:35:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:09,330 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-27 12:35:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-27 12:35:09,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:09,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:09,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:35:09,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:35:09,331 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:35:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-27 12:35:09,332 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-27 12:35:09,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:35:09,333 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-27 12:35:09,333 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:35:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-27 12:35:09,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 12:35:09,334 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:35:09,334 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:35:09,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 12:35:09,534 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:35:09,535 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:35:09,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:35:09,535 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-27 12:35:09,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:35:09,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808391389] [2022-04-27 12:35:09,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:09,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:35:09,563 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:35:09,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153806891] [2022-04-27 12:35:09,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:09,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:35:09,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:35:09,568 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:35:09,573 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:35:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:09,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 12:35:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:09,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:35:10,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {715#true} call ULTIMATE.init(); {715#true} is VALID [2022-04-27 12:35:10,446 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:35:10,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:35:10,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715#true} {715#true} #89#return; {715#true} is VALID [2022-04-27 12:35:10,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {715#true} call #t~ret5 := main(); {715#true} is VALID [2022-04-27 12:35:10,447 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:35:10,447 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:35:10,448 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:35:10,449 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:35:10,449 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:35:10,450 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:35:10,450 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:35:10,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-27 12:35:10,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-27 12:35:10,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:35:10,455 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:35:10,458 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:35:10,458 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:35:10,459 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 < 20);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:35:10,459 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:35:10,460 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:35:10,461 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 < 20);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:35:10,462 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:35:10,462 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:35:10,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {716#false} is VALID [2022-04-27 12:35:10,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-04-27 12:35:10,463 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:35:10,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:35:10,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-04-27 12:35:10,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {716#false} is VALID [2022-04-27 12:35:10,848 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:35:10,849 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:35:10,850 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 < 20);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:35:10,850 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:35:10,855 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:35:10,859 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 < 20);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:35:10,860 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:35:10,871 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:35:10,872 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {715#true} {715#true} #83#return; {715#true} is VALID [2022-04-27 12:35:10,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:35:10,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-27 12:35:10,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-27 12:35:10,872 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:35:10,872 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {715#true} {715#true} #81#return; {715#true} is VALID [2022-04-27 12:35:10,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:35:10,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-27 12:35:10,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-27 12:35:10,873 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:35:10,884 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:35:10,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {715#true} call #t~ret5 := main(); {715#true} is VALID [2022-04-27 12:35:10,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715#true} {715#true} #89#return; {715#true} is VALID [2022-04-27 12:35:10,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:35:10,885 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:35:10,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {715#true} call ULTIMATE.init(); {715#true} is VALID [2022-04-27 12:35:10,885 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:35:10,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:35:10,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808391389] [2022-04-27 12:35:10,886 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:35:10,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153806891] [2022-04-27 12:35:10,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153806891] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:35:10,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:35:10,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 12:35:10,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935930236] [2022-04-27 12:35:10,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:35:10,887 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:35:10,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:35:10,888 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:35:10,907 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:35:10,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:35:10,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:35:10,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:35:10,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:35:10,909 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:35:16,024 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:35:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:18,672 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-04-27 12:35:18,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:35:18,673 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:35:18,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:35:18,674 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:35:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:35:18,684 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:35:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:35:18,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 12:35:18,737 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:35:18,738 INFO L225 Difference]: With dead ends: 42 [2022-04-27 12:35:18,738 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 12:35:18,738 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:35:18,739 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-27 12:35:18,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 126 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-04-27 12:35:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 12:35:18,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-27 12:35:18,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:35:18,748 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:35:18,748 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:35:18,748 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:35:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:18,750 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 12:35:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 12:35:18,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:18,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:18,751 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:35:18,751 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:35:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:18,753 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 12:35:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 12:35:18,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:18,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:18,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:35:18,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:35:18,754 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:35:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-27 12:35:18,755 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-27 12:35:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:35:18,756 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-27 12:35:18,756 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:35:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 12:35:18,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 12:35:18,757 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:35:18,757 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:35:18,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:35:18,975 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:35:18,976 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:35:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:35:18,976 INFO L85 PathProgramCache]: Analyzing trace with hash -193375877, now seen corresponding path program 1 times [2022-04-27 12:35:18,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:35:18,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556887791] [2022-04-27 12:35:18,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:18,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:35:18,997 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:35:18,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1576906546] [2022-04-27 12:35:18,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:18,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:35:18,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:35:19,010 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:35:19,011 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:35:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:19,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:35:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:19,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:35:19,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {1071#true} call ULTIMATE.init(); {1071#true} is VALID [2022-04-27 12:35:19,222 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:35:19,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:19,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1079#(<= ~counter~0 0)} {1071#true} #89#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:19,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {1079#(<= ~counter~0 0)} call #t~ret5 := main(); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:19,224 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:35:19,225 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:35:19,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {1079#(<= ~counter~0 0)} ~cond := #in~cond; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:19,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {1079#(<= ~counter~0 0)} assume !(0 == ~cond); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:19,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:19,227 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:35:19,227 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:35:19,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {1079#(<= ~counter~0 0)} ~cond := #in~cond; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:19,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {1079#(<= ~counter~0 0)} assume !(0 == ~cond); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:19,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:19,229 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:35:19,230 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:35:19,230 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:35:19,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {1128#(<= ~counter~0 1)} assume !!(#t~post3 < 20);havoc #t~post3; {1128#(<= ~counter~0 1)} is VALID [2022-04-27 12:35:19,231 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:35:19,232 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:35:19,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#(<= |main_#t~post3| 1)} assume !(#t~post3 < 20);havoc #t~post3; {1072#false} is VALID [2022-04-27 12:35:19,232 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:35:19,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {1072#false} assume !(#t~post4 < 20);havoc #t~post4; {1072#false} is VALID [2022-04-27 12:35:19,233 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:35:19,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {1072#false} ~cond := #in~cond; {1072#false} is VALID [2022-04-27 12:35:19,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {1072#false} assume 0 == ~cond; {1072#false} is VALID [2022-04-27 12:35:19,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {1072#false} assume !false; {1072#false} is VALID [2022-04-27 12:35:19,233 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:35:19,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:35:19,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {1072#false} assume !false; {1072#false} is VALID [2022-04-27 12:35:19,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {1072#false} assume 0 == ~cond; {1072#false} is VALID [2022-04-27 12:35:19,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {1072#false} ~cond := #in~cond; {1072#false} is VALID [2022-04-27 12:35:19,426 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:35:19,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {1072#false} assume !(#t~post4 < 20);havoc #t~post4; {1072#false} is VALID [2022-04-27 12:35:19,427 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:35:19,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(< |main_#t~post3| 20)} assume !(#t~post3 < 20);havoc #t~post3; {1072#false} is VALID [2022-04-27 12:35:19,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {1182#(< ~counter~0 20)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1178#(< |main_#t~post3| 20)} is VALID [2022-04-27 12:35:19,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {1182#(< ~counter~0 20)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1182#(< ~counter~0 20)} is VALID [2022-04-27 12:35:19,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {1182#(< ~counter~0 20)} assume !!(#t~post3 < 20);havoc #t~post3; {1182#(< ~counter~0 20)} is VALID [2022-04-27 12:35:19,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {1192#(< ~counter~0 19)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1182#(< ~counter~0 20)} is VALID [2022-04-27 12:35:19,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#(< ~counter~0 19)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1192#(< ~counter~0 19)} is VALID [2022-04-27 12:35:19,430 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1071#true} {1192#(< ~counter~0 19)} #83#return; {1192#(< ~counter~0 19)} is VALID [2022-04-27 12:35:19,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {1071#true} assume true; {1071#true} is VALID [2022-04-27 12:35:19,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {1071#true} assume !(0 == ~cond); {1071#true} is VALID [2022-04-27 12:35:19,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {1071#true} ~cond := #in~cond; {1071#true} is VALID [2022-04-27 12:35:19,431 INFO L272 TraceCheckUtils]: 11: Hoare triple {1192#(< ~counter~0 19)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1071#true} is VALID [2022-04-27 12:35:19,431 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1071#true} {1192#(< ~counter~0 19)} #81#return; {1192#(< ~counter~0 19)} is VALID [2022-04-27 12:35:19,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {1071#true} assume true; {1071#true} is VALID [2022-04-27 12:35:19,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {1071#true} assume !(0 == ~cond); {1071#true} is VALID [2022-04-27 12:35:19,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {1071#true} ~cond := #in~cond; {1071#true} is VALID [2022-04-27 12:35:19,432 INFO L272 TraceCheckUtils]: 6: Hoare triple {1192#(< ~counter~0 19)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1071#true} is VALID [2022-04-27 12:35:19,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {1192#(< ~counter~0 19)} 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; {1192#(< ~counter~0 19)} is VALID [2022-04-27 12:35:19,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {1192#(< ~counter~0 19)} call #t~ret5 := main(); {1192#(< ~counter~0 19)} is VALID [2022-04-27 12:35:19,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1192#(< ~counter~0 19)} {1071#true} #89#return; {1192#(< ~counter~0 19)} is VALID [2022-04-27 12:35:19,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {1192#(< ~counter~0 19)} assume true; {1192#(< ~counter~0 19)} is VALID [2022-04-27 12:35:19,434 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; {1192#(< ~counter~0 19)} is VALID [2022-04-27 12:35:19,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {1071#true} call ULTIMATE.init(); {1071#true} is VALID [2022-04-27 12:35:19,434 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:35:19,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:35:19,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556887791] [2022-04-27 12:35:19,435 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:35:19,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576906546] [2022-04-27 12:35:19,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576906546] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:35:19,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:35:19,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 12:35:19,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352919384] [2022-04-27 12:35:19,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:35:19,436 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2022-04-27 12:35:19,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:35:19,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:35:19,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:35:19,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:35:19,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:35:19,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:35:19,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:35:19,474 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:35:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:19,691 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-27 12:35:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:35:19,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2022-04-27 12:35:19,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:35:19,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:35:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-27 12:35:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:35:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-27 12:35:19,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 92 transitions. [2022-04-27 12:35:19,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:35:19,771 INFO L225 Difference]: With dead ends: 73 [2022-04-27 12:35:19,771 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 12:35:19,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:35:19,773 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 34 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:35:19,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 149 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:35:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 12:35:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2022-04-27 12:35:19,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:35:19,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 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:35:19,785 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 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:35:19,785 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 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:35:19,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:19,787 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-27 12:35:19,787 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-04-27 12:35:19,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:19,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:19,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 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 61 states. [2022-04-27 12:35:19,788 INFO L87 Difference]: Start difference. First operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 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 61 states. [2022-04-27 12:35:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:19,790 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-27 12:35:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-04-27 12:35:19,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:19,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:19,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:35:19,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:35:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 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:35:19,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-27 12:35:19,793 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 28 [2022-04-27 12:35:19,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:35:19,793 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-27 12:35:19,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:35:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-27 12:35:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 12:35:19,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:35:19,795 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:35:19,819 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:35:20,017 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:35:20,017 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:35:20,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:35:20,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2031725334, now seen corresponding path program 1 times [2022-04-27 12:35:20,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:35:20,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490980818] [2022-04-27 12:35:20,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:20,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:35:20,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:35:20,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1822610112] [2022-04-27 12:35:20,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:20,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:35:20,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:35:20,056 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:35:20,057 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:35:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:20,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:35:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:20,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:35:20,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {1534#true} call ULTIMATE.init(); {1534#true} is VALID [2022-04-27 12:35:20,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#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; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:20,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {1542#(<= ~counter~0 0)} assume true; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:20,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1542#(<= ~counter~0 0)} {1534#true} #89#return; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:20,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {1542#(<= ~counter~0 0)} call #t~ret5 := main(); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:20,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {1542#(<= ~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; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:20,276 INFO L272 TraceCheckUtils]: 6: Hoare triple {1542#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:20,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {1542#(<= ~counter~0 0)} ~cond := #in~cond; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:20,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {1542#(<= ~counter~0 0)} assume !(0 == ~cond); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:20,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {1542#(<= ~counter~0 0)} assume true; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:20,278 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1542#(<= ~counter~0 0)} {1542#(<= ~counter~0 0)} #81#return; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:20,279 INFO L272 TraceCheckUtils]: 11: Hoare triple {1542#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:20,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(<= ~counter~0 0)} ~cond := #in~cond; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:20,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(<= ~counter~0 0)} assume !(0 == ~cond); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:20,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {1542#(<= ~counter~0 0)} assume true; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:20,280 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1542#(<= ~counter~0 0)} {1542#(<= ~counter~0 0)} #83#return; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:20,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {1542#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:35:20,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {1542#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1591#(<= ~counter~0 1)} is VALID [2022-04-27 12:35:20,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {1591#(<= ~counter~0 1)} assume !!(#t~post3 < 20);havoc #t~post3; {1591#(<= ~counter~0 1)} is VALID [2022-04-27 12:35:20,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {1591#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1591#(<= ~counter~0 1)} is VALID [2022-04-27 12:35:20,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {1591#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:35:20,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {1601#(<= ~counter~0 2)} assume !!(#t~post3 < 20);havoc #t~post3; {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:35:20,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {1601#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:35:20,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {1601#(<= ~counter~0 2)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1611#(<= |main_#t~post4| 2)} is VALID [2022-04-27 12:35:20,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {1611#(<= |main_#t~post4| 2)} assume !(#t~post4 < 20);havoc #t~post4; {1535#false} is VALID [2022-04-27 12:35:20,285 INFO L272 TraceCheckUtils]: 25: Hoare triple {1535#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1535#false} is VALID [2022-04-27 12:35:20,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {1535#false} ~cond := #in~cond; {1535#false} is VALID [2022-04-27 12:35:20,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {1535#false} assume 0 == ~cond; {1535#false} is VALID [2022-04-27 12:35:20,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {1535#false} assume !false; {1535#false} is VALID [2022-04-27 12:35:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:35:20,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:35:20,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {1535#false} assume !false; {1535#false} is VALID [2022-04-27 12:35:20,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {1535#false} assume 0 == ~cond; {1535#false} is VALID [2022-04-27 12:35:20,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {1535#false} ~cond := #in~cond; {1535#false} is VALID [2022-04-27 12:35:20,495 INFO L272 TraceCheckUtils]: 25: Hoare triple {1535#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1535#false} is VALID [2022-04-27 12:35:20,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {1639#(< |main_#t~post4| 20)} assume !(#t~post4 < 20);havoc #t~post4; {1535#false} is VALID [2022-04-27 12:35:20,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {1643#(< ~counter~0 20)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1639#(< |main_#t~post4| 20)} is VALID [2022-04-27 12:35:20,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {1643#(< ~counter~0 20)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1643#(< ~counter~0 20)} is VALID [2022-04-27 12:35:20,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {1643#(< ~counter~0 20)} assume !!(#t~post3 < 20);havoc #t~post3; {1643#(< ~counter~0 20)} is VALID [2022-04-27 12:35:20,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {1653#(< ~counter~0 19)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1643#(< ~counter~0 20)} is VALID [2022-04-27 12:35:20,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {1653#(< ~counter~0 19)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1653#(< ~counter~0 19)} is VALID [2022-04-27 12:35:20,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {1653#(< ~counter~0 19)} assume !!(#t~post3 < 20);havoc #t~post3; {1653#(< ~counter~0 19)} is VALID [2022-04-27 12:35:20,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {1663#(< ~counter~0 18)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1653#(< ~counter~0 19)} is VALID [2022-04-27 12:35:20,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {1663#(< ~counter~0 18)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1663#(< ~counter~0 18)} is VALID [2022-04-27 12:35:20,500 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1534#true} {1663#(< ~counter~0 18)} #83#return; {1663#(< ~counter~0 18)} is VALID [2022-04-27 12:35:20,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {1534#true} assume true; {1534#true} is VALID [2022-04-27 12:35:20,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {1534#true} assume !(0 == ~cond); {1534#true} is VALID [2022-04-27 12:35:20,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {1534#true} ~cond := #in~cond; {1534#true} is VALID [2022-04-27 12:35:20,501 INFO L272 TraceCheckUtils]: 11: Hoare triple {1663#(< ~counter~0 18)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1534#true} is VALID [2022-04-27 12:35:20,501 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1534#true} {1663#(< ~counter~0 18)} #81#return; {1663#(< ~counter~0 18)} is VALID [2022-04-27 12:35:20,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {1534#true} assume true; {1534#true} is VALID [2022-04-27 12:35:20,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {1534#true} assume !(0 == ~cond); {1534#true} is VALID [2022-04-27 12:35:20,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {1534#true} ~cond := #in~cond; {1534#true} is VALID [2022-04-27 12:35:20,511 INFO L272 TraceCheckUtils]: 6: Hoare triple {1663#(< ~counter~0 18)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1534#true} is VALID [2022-04-27 12:35:20,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {1663#(< ~counter~0 18)} 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; {1663#(< ~counter~0 18)} is VALID [2022-04-27 12:35:20,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {1663#(< ~counter~0 18)} call #t~ret5 := main(); {1663#(< ~counter~0 18)} is VALID [2022-04-27 12:35:20,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1663#(< ~counter~0 18)} {1534#true} #89#return; {1663#(< ~counter~0 18)} is VALID [2022-04-27 12:35:20,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {1663#(< ~counter~0 18)} assume true; {1663#(< ~counter~0 18)} is VALID [2022-04-27 12:35:20,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#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; {1663#(< ~counter~0 18)} is VALID [2022-04-27 12:35:20,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {1534#true} call ULTIMATE.init(); {1534#true} is VALID [2022-04-27 12:35:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:35:20,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:35:20,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490980818] [2022-04-27 12:35:20,514 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:35:20,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822610112] [2022-04-27 12:35:20,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822610112] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:35:20,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:35:20,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 12:35:20,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394613289] [2022-04-27 12:35:20,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:35:20,516 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2022-04-27 12:35:20,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:35:20,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:35:20,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:35:20,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:35:20,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:35:20,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:35:20,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:35:20,559 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:35:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:20,893 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2022-04-27 12:35:20,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:35:20,894 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2022-04-27 12:35:20,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:35:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:35:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 120 transitions. [2022-04-27 12:35:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:35:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 120 transitions. [2022-04-27 12:35:20,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 120 transitions. [2022-04-27 12:35:21,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:35:21,002 INFO L225 Difference]: With dead ends: 98 [2022-04-27 12:35:21,003 INFO L226 Difference]: Without dead ends: 91 [2022-04-27 12:35:21,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:35:21,004 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 89 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:35:21,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 181 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:35:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-27 12:35:21,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2022-04-27 12:35:21,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:35:21,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:35:21,026 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:35:21,027 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:35:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:21,030 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2022-04-27 12:35:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2022-04-27 12:35:21,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:21,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:21,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 91 states. [2022-04-27 12:35:21,031 INFO L87 Difference]: Start difference. First operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 91 states. [2022-04-27 12:35:21,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:21,034 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2022-04-27 12:35:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2022-04-27 12:35:21,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:21,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:21,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:35:21,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:35:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:35:21,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2022-04-27 12:35:21,038 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 29 [2022-04-27 12:35:21,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:35:21,038 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2022-04-27 12:35:21,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:35:21,038 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2022-04-27 12:35:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 12:35:21,039 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:35:21,039 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:35:21,067 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:35:21,255 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:35:21,256 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:35:21,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:35:21,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2029937874, now seen corresponding path program 1 times [2022-04-27 12:35:21,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:35:21,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551009255] [2022-04-27 12:35:21,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:21,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:35:21,270 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:35:21,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1253407332] [2022-04-27 12:35:21,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:21,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:35:21,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:35:21,271 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:35:21,300 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:35:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:21,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 12:35:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:21,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:35:21,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {2146#true} call ULTIMATE.init(); {2146#true} is VALID [2022-04-27 12:35:21,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#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; {2146#true} is VALID [2022-04-27 12:35:21,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-04-27 12:35:21,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2146#true} {2146#true} #89#return; {2146#true} is VALID [2022-04-27 12:35:21,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {2146#true} call #t~ret5 := main(); {2146#true} is VALID [2022-04-27 12:35:21,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {2146#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; {2146#true} is VALID [2022-04-27 12:35:21,901 INFO L272 TraceCheckUtils]: 6: Hoare triple {2146#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2146#true} is VALID [2022-04-27 12:35:21,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-04-27 12:35:21,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {2146#true} assume !(0 == ~cond); {2146#true} is VALID [2022-04-27 12:35:21,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-04-27 12:35:21,901 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2146#true} {2146#true} #81#return; {2146#true} is VALID [2022-04-27 12:35:21,901 INFO L272 TraceCheckUtils]: 11: Hoare triple {2146#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2146#true} is VALID [2022-04-27 12:35:21,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {2146#true} ~cond := #in~cond; {2187#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:35:21,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {2187#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2191#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:35:21,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {2191#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2191#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:35:21,903 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2191#(not (= |assume_abort_if_not_#in~cond| 0))} {2146#true} #83#return; {2198#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 12:35:21,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {2198#(<= 1 (mod main_~B~0 4294967296))} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2202#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:35:21,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {2202#(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; {2202#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:35:21,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {2202#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post3 < 20);havoc #t~post3; {2202#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:35:21,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {2202#(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; {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:35:21,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:35:21,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} assume !!(#t~post3 < 20);havoc #t~post3; {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:35:21,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:35:21,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:35:21,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} assume !!(#t~post4 < 20);havoc #t~post4; {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:35:21,909 INFO L272 TraceCheckUtils]: 25: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:35:21,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {2231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:35:21,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {2235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2147#false} is VALID [2022-04-27 12:35:21,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {2147#false} assume !false; {2147#false} is VALID [2022-04-27 12:35:21,910 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:35:21,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:35:22,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {2147#false} assume !false; {2147#false} is VALID [2022-04-27 12:35:22,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {2235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2147#false} is VALID [2022-04-27 12:35:22,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {2231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:35:22,978 INFO L272 TraceCheckUtils]: 25: Hoare triple {2251#(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)); {2231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:35:22,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !!(#t~post4 < 20);havoc #t~post4; {2251#(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:35:22,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {2251#(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; {2251#(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:35:22,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {2251#(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); {2251#(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:35:22,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !!(#t~post3 < 20);havoc #t~post3; {2251#(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:35:22,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {2251#(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; {2251#(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:35:22,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {2270#(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; {2251#(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:35:22,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {2270#(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 < 20);havoc #t~post3; {2270#(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:35:22,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {2270#(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; {2270#(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:35:22,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {2146#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2270#(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:35:22,983 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2146#true} {2146#true} #83#return; {2146#true} is VALID [2022-04-27 12:35:22,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-04-27 12:35:22,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {2146#true} assume !(0 == ~cond); {2146#true} is VALID [2022-04-27 12:35:22,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-04-27 12:35:22,984 INFO L272 TraceCheckUtils]: 11: Hoare triple {2146#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2146#true} is VALID [2022-04-27 12:35:22,984 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2146#true} {2146#true} #81#return; {2146#true} is VALID [2022-04-27 12:35:22,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-04-27 12:35:22,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {2146#true} assume !(0 == ~cond); {2146#true} is VALID [2022-04-27 12:35:22,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-04-27 12:35:22,984 INFO L272 TraceCheckUtils]: 6: Hoare triple {2146#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2146#true} is VALID [2022-04-27 12:35:22,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {2146#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; {2146#true} is VALID [2022-04-27 12:35:22,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {2146#true} call #t~ret5 := main(); {2146#true} is VALID [2022-04-27 12:35:22,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2146#true} {2146#true} #89#return; {2146#true} is VALID [2022-04-27 12:35:22,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-04-27 12:35:22,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#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; {2146#true} is VALID [2022-04-27 12:35:22,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {2146#true} call ULTIMATE.init(); {2146#true} is VALID [2022-04-27 12:35:22,985 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:35:22,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:35:22,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551009255] [2022-04-27 12:35:22,986 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:35:22,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253407332] [2022-04-27 12:35:22,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253407332] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:35:22,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:35:22,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 12:35:22,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826390447] [2022-04-27 12:35:22,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:35:22,987 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:35:22,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:35:22,987 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:35:25,034 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:35:25,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:35:25,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:35:25,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:35:25,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:35:25,035 INFO L87 Difference]: Start difference. First operand 84 states and 106 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:35:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:26,091 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2022-04-27 12:35:26,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:35:26,092 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:35:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:35:26,092 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:35:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-27 12:35:26,093 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:35:26,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-27 12:35:26,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-27 12:35:27,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:35:27,230 INFO L225 Difference]: With dead ends: 117 [2022-04-27 12:35:27,230 INFO L226 Difference]: Without dead ends: 115 [2022-04-27 12:35:27,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:35:27,231 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:35:27,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 152 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2022-04-27 12:35:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-27 12:35:27,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2022-04-27 12:35:27,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:35:27,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:35:27,263 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:35:27,264 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:35:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:27,267 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2022-04-27 12:35:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2022-04-27 12:35:27,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:27,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:27,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) Second operand 115 states. [2022-04-27 12:35:27,269 INFO L87 Difference]: Start difference. First operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) Second operand 115 states. [2022-04-27 12:35:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:27,272 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2022-04-27 12:35:27,272 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2022-04-27 12:35:27,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:27,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:27,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:35:27,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:35:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:35:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2022-04-27 12:35:27,277 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 29 [2022-04-27 12:35:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:35:27,277 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2022-04-27 12:35:27,277 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:35:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2022-04-27 12:35:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 12:35:27,278 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:35:27,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:35:27,299 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:35:27,499 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:35:27,499 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:35:27,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:35:27,500 INFO L85 PathProgramCache]: Analyzing trace with hash 223058363, now seen corresponding path program 1 times [2022-04-27 12:35:27,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:35:27,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653390209] [2022-04-27 12:35:27,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:27,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:35:27,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:35:27,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [763236251] [2022-04-27 12:35:27,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:27,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:35:27,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:35:27,515 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:35:27,551 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:35:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:27,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 12:35:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:27,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:35:28,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {2864#true} call ULTIMATE.init(); {2864#true} is VALID [2022-04-27 12:35:28,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {2864#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; {2864#true} is VALID [2022-04-27 12:35:28,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:35:28,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2864#true} {2864#true} #89#return; {2864#true} is VALID [2022-04-27 12:35:28,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {2864#true} call #t~ret5 := main(); {2864#true} is VALID [2022-04-27 12:35:28,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {2864#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; {2864#true} is VALID [2022-04-27 12:35:28,021 INFO L272 TraceCheckUtils]: 6: Hoare triple {2864#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:35:28,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {2864#true} ~cond := #in~cond; {2864#true} is VALID [2022-04-27 12:35:28,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {2864#true} assume !(0 == ~cond); {2864#true} is VALID [2022-04-27 12:35:28,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:35:28,022 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2864#true} {2864#true} #81#return; {2864#true} is VALID [2022-04-27 12:35:28,022 INFO L272 TraceCheckUtils]: 11: Hoare triple {2864#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:35:28,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {2864#true} ~cond := #in~cond; {2864#true} is VALID [2022-04-27 12:35:28,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {2864#true} assume !(0 == ~cond); {2864#true} is VALID [2022-04-27 12:35:28,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:35:28,022 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2864#true} {2864#true} #83#return; {2864#true} is VALID [2022-04-27 12:35:28,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {2864#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2864#true} is VALID [2022-04-27 12:35:28,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {2864#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2864#true} is VALID [2022-04-27 12:35:28,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {2864#true} assume !!(#t~post3 < 20);havoc #t~post3; {2864#true} is VALID [2022-04-27 12:35:28,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {2864#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2864#true} is VALID [2022-04-27 12:35:28,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {2864#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2864#true} is VALID [2022-04-27 12:35:28,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {2864#true} assume !!(#t~post3 < 20);havoc #t~post3; {2864#true} is VALID [2022-04-27 12:35:28,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {2864#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2864#true} is VALID [2022-04-27 12:35:28,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {2864#true} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2864#true} is VALID [2022-04-27 12:35:28,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {2864#true} assume !!(#t~post4 < 20);havoc #t~post4; {2864#true} is VALID [2022-04-27 12:35:28,024 INFO L272 TraceCheckUtils]: 25: Hoare triple {2864#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:35:28,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {2864#true} ~cond := #in~cond; {2947#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:35:28,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {2947#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:35:28,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:35:28,026 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} {2864#true} #85#return; {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:35:28,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:35:28,027 INFO L272 TraceCheckUtils]: 31: Hoare triple {2958#(= (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)); {2965#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 12:35:28,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {2965#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2969#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-27 12:35:28,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {2969#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {2865#false} is VALID [2022-04-27 12:35:28,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {2865#false} assume !false; {2865#false} is VALID [2022-04-27 12:35:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 12:35:28,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:35:29,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {2865#false} assume !false; {2865#false} is VALID [2022-04-27 12:35:29,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {2979#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2865#false} is VALID [2022-04-27 12:35:29,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2979#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:35:29,219 INFO L272 TraceCheckUtils]: 31: Hoare triple {2958#(= (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)); {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:35:29,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:35:29,220 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} {2864#true} #85#return; {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:35:29,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:35:29,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {3001#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:35:29,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {2864#true} ~cond := #in~cond; {3001#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:35:29,221 INFO L272 TraceCheckUtils]: 25: Hoare triple {2864#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:35:29,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {2864#true} assume !!(#t~post4 < 20);havoc #t~post4; {2864#true} is VALID [2022-04-27 12:35:29,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {2864#true} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2864#true} is VALID [2022-04-27 12:35:29,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {2864#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2864#true} is VALID [2022-04-27 12:35:29,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {2864#true} assume !!(#t~post3 < 20);havoc #t~post3; {2864#true} is VALID [2022-04-27 12:35:29,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {2864#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2864#true} is VALID [2022-04-27 12:35:29,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {2864#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2864#true} is VALID [2022-04-27 12:35:29,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {2864#true} assume !!(#t~post3 < 20);havoc #t~post3; {2864#true} is VALID [2022-04-27 12:35:29,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {2864#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2864#true} is VALID [2022-04-27 12:35:29,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {2864#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2864#true} is VALID [2022-04-27 12:35:29,222 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2864#true} {2864#true} #83#return; {2864#true} is VALID [2022-04-27 12:35:29,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:35:29,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {2864#true} assume !(0 == ~cond); {2864#true} is VALID [2022-04-27 12:35:29,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {2864#true} ~cond := #in~cond; {2864#true} is VALID [2022-04-27 12:35:29,223 INFO L272 TraceCheckUtils]: 11: Hoare triple {2864#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:35:29,223 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2864#true} {2864#true} #81#return; {2864#true} is VALID [2022-04-27 12:35:29,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:35:29,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {2864#true} assume !(0 == ~cond); {2864#true} is VALID [2022-04-27 12:35:29,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {2864#true} ~cond := #in~cond; {2864#true} is VALID [2022-04-27 12:35:29,223 INFO L272 TraceCheckUtils]: 6: Hoare triple {2864#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:35:29,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {2864#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; {2864#true} is VALID [2022-04-27 12:35:29,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {2864#true} call #t~ret5 := main(); {2864#true} is VALID [2022-04-27 12:35:29,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2864#true} {2864#true} #89#return; {2864#true} is VALID [2022-04-27 12:35:29,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:35:29,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {2864#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; {2864#true} is VALID [2022-04-27 12:35:29,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {2864#true} call ULTIMATE.init(); {2864#true} is VALID [2022-04-27 12:35:29,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 12:35:29,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:35:29,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653390209] [2022-04-27 12:35:29,225 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:35:29,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763236251] [2022-04-27 12:35:29,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763236251] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:35:29,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:35:29,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-27 12:35:29,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082115661] [2022-04-27 12:35:29,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:35:29,226 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-27 12:35:29,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:35:29,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:35:29,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:35:29,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:35:29,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:35:29,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:35:29,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:35:29,254 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:35:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:30,942 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2022-04-27 12:35:30,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:35:30,942 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-27 12:35:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:35:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:35:30,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-27 12:35:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:35:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-27 12:35:30,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2022-04-27 12:35:30,993 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:35:30,995 INFO L225 Difference]: With dead ends: 133 [2022-04-27 12:35:30,995 INFO L226 Difference]: Without dead ends: 111 [2022-04-27 12:35:30,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:35:30,996 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:35:30,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 12:35:30,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-27 12:35:31,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-27 12:35:31,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:35:31,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:35:31,047 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:35:31,050 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:35:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:31,053 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-04-27 12:35:31,054 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-04-27 12:35:31,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:31,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:31,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) Second operand 111 states. [2022-04-27 12:35:31,054 INFO L87 Difference]: Start difference. First operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) Second operand 111 states. [2022-04-27 12:35:31,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:31,058 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-04-27 12:35:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-04-27 12:35:31,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:31,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:31,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:35:31,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:35:31,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:35:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2022-04-27 12:35:31,063 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 35 [2022-04-27 12:35:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:35:31,063 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2022-04-27 12:35:31,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:35:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-04-27 12:35:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 12:35:31,064 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:35:31,064 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:35:31,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 12:35:31,275 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:35:31,275 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:35:31,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:35:31,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 1 times [2022-04-27 12:35:31,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:35:31,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46419365] [2022-04-27 12:35:31,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:31,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:35:31,289 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:35:31,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [614836447] [2022-04-27 12:35:31,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:31,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:35:31,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:35:31,294 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:35:31,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 12:35:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:31,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 12:35:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:35:31,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:35:31,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {3624#true} call ULTIMATE.init(); {3624#true} is VALID [2022-04-27 12:35:31,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {3624#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; {3624#true} is VALID [2022-04-27 12:35:31,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {3624#true} assume true; {3624#true} is VALID [2022-04-27 12:35:31,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3624#true} {3624#true} #89#return; {3624#true} is VALID [2022-04-27 12:35:31,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {3624#true} call #t~ret5 := main(); {3624#true} is VALID [2022-04-27 12:35:31,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {3624#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; {3624#true} is VALID [2022-04-27 12:35:31,411 INFO L272 TraceCheckUtils]: 6: Hoare triple {3624#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {3624#true} is VALID [2022-04-27 12:35:31,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {3624#true} ~cond := #in~cond; {3624#true} is VALID [2022-04-27 12:35:31,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {3624#true} assume !(0 == ~cond); {3624#true} is VALID [2022-04-27 12:35:31,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {3624#true} assume true; {3624#true} is VALID [2022-04-27 12:35:31,411 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3624#true} {3624#true} #81#return; {3624#true} is VALID [2022-04-27 12:35:31,411 INFO L272 TraceCheckUtils]: 11: Hoare triple {3624#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3624#true} is VALID [2022-04-27 12:35:31,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {3624#true} ~cond := #in~cond; {3624#true} is VALID [2022-04-27 12:35:31,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {3624#true} assume !(0 == ~cond); {3624#true} is VALID [2022-04-27 12:35:31,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {3624#true} assume true; {3624#true} is VALID [2022-04-27 12:35:31,412 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3624#true} {3624#true} #83#return; {3624#true} is VALID [2022-04-27 12:35:31,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {3624#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:35:31,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {3677#(= main_~B~0 main_~b~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:35:31,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {3677#(= main_~B~0 main_~b~0)} assume !!(#t~post3 < 20);havoc #t~post3; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:35:31,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {3677#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:35:31,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {3677#(= main_~B~0 main_~b~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:35:31,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {3677#(= main_~B~0 main_~b~0)} assume !!(#t~post4 < 20);havoc #t~post4; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:35:31,414 INFO L272 TraceCheckUtils]: 22: Hoare triple {3677#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3624#true} is VALID [2022-04-27 12:35:31,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {3624#true} ~cond := #in~cond; {3624#true} is VALID [2022-04-27 12:35:31,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {3624#true} assume !(0 == ~cond); {3624#true} is VALID [2022-04-27 12:35:31,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {3624#true} assume true; {3624#true} is VALID [2022-04-27 12:35:31,415 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3624#true} {3677#(= main_~B~0 main_~b~0)} #85#return; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:35:31,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {3677#(= 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); {3625#false} is VALID [2022-04-27 12:35:31,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {3625#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {3625#false} is VALID [2022-04-27 12:35:31,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {3625#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {3625#false} is VALID [2022-04-27 12:35:31,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {3625#false} assume !!(#t~post4 < 20);havoc #t~post4; {3625#false} is VALID [2022-04-27 12:35:31,416 INFO L272 TraceCheckUtils]: 31: Hoare triple {3625#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3625#false} is VALID [2022-04-27 12:35:31,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {3625#false} ~cond := #in~cond; {3625#false} is VALID [2022-04-27 12:35:31,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {3625#false} assume 0 == ~cond; {3625#false} is VALID [2022-04-27 12:35:31,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {3625#false} assume !false; {3625#false} is VALID [2022-04-27 12:35:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:35:31,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:35:31,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:35:31,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46419365] [2022-04-27 12:35:31,417 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:35:31,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614836447] [2022-04-27 12:35:31,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614836447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:35:31,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:35:31,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:35:31,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891756404] [2022-04-27 12:35:31,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:35:31,418 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:35:31,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:35:31,418 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:35:31,444 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:35:31,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:35:31,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:35:31,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:35:31,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:35:31,445 INFO L87 Difference]: Start difference. First operand 111 states and 130 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:35:31,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:31,518 INFO L93 Difference]: Finished difference Result 145 states and 171 transitions. [2022-04-27 12:35:31,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:35:31,519 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:35:31,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:35:31,519 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:35:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-27 12:35:31,520 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:35:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-27 12:35:31,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2022-04-27 12:35:31,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:35:31,572 INFO L225 Difference]: With dead ends: 145 [2022-04-27 12:35:31,572 INFO L226 Difference]: Without dead ends: 95 [2022-04-27 12:35:31,572 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:35:31,573 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:35:31,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:35:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-27 12:35:31,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-27 12:35:31,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:35:31,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:35:31,603 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:35:31,604 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:35:31,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:31,606 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2022-04-27 12:35:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2022-04-27 12:35:31,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:31,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:31,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 95 states. [2022-04-27 12:35:31,607 INFO L87 Difference]: Start difference. First operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 95 states. [2022-04-27 12:35:31,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:35:31,610 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2022-04-27 12:35:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2022-04-27 12:35:31,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:35:31,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:35:31,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:35:31,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:35:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:35:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2022-04-27 12:35:31,622 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 35 [2022-04-27 12:35:31,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:35:31,622 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2022-04-27 12:35:31,622 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:35:31,622 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2022-04-27 12:35:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 12:35:31,623 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:35:31,623 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:35:31,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 12:35:31,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 12:35:31,839 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:35:31,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:35:31,840 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 1 times [2022-04-27 12:35:31,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:35:31,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292053270] [2022-04-27 12:35:31,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:31,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:35:31,853 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:35:31,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [742811017] [2022-04-27 12:35:31,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:35:31,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:35:31,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:35:31,854 INFO L229 MonitoredProcess]: Starting monitored process 10 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:35:31,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process