/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_unwindbound1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:33:25,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:33:25,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:33:25,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:33:25,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:33:25,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:33:25,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:33:25,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:33:25,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:33:25,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:33:25,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:33:25,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:33:25,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:33:25,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:33:25,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:33:25,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:33:25,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:33:25,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:33:25,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:33:25,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:33:25,674 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:33:25,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:33:25,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:33:25,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:33:25,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:33:25,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:33:25,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:33:25,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:33:25,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:33:25,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:33:25,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:33:25,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:33:25,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:33:25,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:33:25,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:33:25,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:33:25,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:33:25,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:33:25,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:33:25,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:33:25,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:33:25,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:33:25,698 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:33:25,729 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:33:25,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:33:25,729 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:33:25,729 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:33:25,730 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:33:25,730 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:33:25,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:33:25,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:33:25,731 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:33:25,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:33:25,732 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:33:25,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:33:25,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:33:25,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:33:25,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:33:25,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:33:25,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:33:25,732 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:33:25,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:33:25,733 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:33:25,733 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:33:25,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:33:25,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:33:25,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:33:25,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:33:25,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:33:25,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:33:25,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:33:25,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:33:25,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:33:25,734 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:33:25,734 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:33:25,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:33:25,735 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:33:25,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:33:25,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:33:25,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:33:25,974 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:33:25,974 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:33:25,975 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound1.i [2022-04-27 12:33:26,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca4a601a/47b37bc38e624de9b695fac6b3a4f3c5/FLAGf02c6db00 [2022-04-27 12:33:26,413 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:33:26,414 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound1.i [2022-04-27 12:33:26,419 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca4a601a/47b37bc38e624de9b695fac6b3a4f3c5/FLAGf02c6db00 [2022-04-27 12:33:26,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca4a601a/47b37bc38e624de9b695fac6b3a4f3c5 [2022-04-27 12:33:26,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:33:26,440 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:33:26,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:33:26,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:33:26,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:33:26,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:33:26" (1/1) ... [2022-04-27 12:33:26,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7833a5c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:26, skipping insertion in model container [2022-04-27 12:33:26,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:33:26" (1/1) ... [2022-04-27 12:33:26,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:33:26,470 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:33:26,605 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_unwindbound1.i[950,963] [2022-04-27 12:33:26,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:33:26,626 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:33:26,637 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_unwindbound1.i[950,963] [2022-04-27 12:33:26,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:33:26,653 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:33:26,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:26 WrapperNode [2022-04-27 12:33:26,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:33:26,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:33:26,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:33:26,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:33:26,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:26" (1/1) ... [2022-04-27 12:33:26,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:26" (1/1) ... [2022-04-27 12:33:26,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:26" (1/1) ... [2022-04-27 12:33:26,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:26" (1/1) ... [2022-04-27 12:33:26,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:26" (1/1) ... [2022-04-27 12:33:26,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:26" (1/1) ... [2022-04-27 12:33:26,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:26" (1/1) ... [2022-04-27 12:33:26,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:33:26,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:33:26,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:33:26,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:33:26,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:26" (1/1) ... [2022-04-27 12:33:26,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:33:26,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:26,710 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:33:26,712 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:33:26,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:33:26,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:33:26,736 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:33:26,736 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:33:26,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:33:26,736 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:33:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:33:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:33:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 12:33:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 12:33:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:33:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:33:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:33:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:33:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:33:26,738 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:33:26,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:33:26,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:33:26,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:33:26,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:33:26,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:33:26,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:33:26,787 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:33:26,789 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:33:26,933 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:33:26,939 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:33:26,939 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:33:26,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:33:26 BoogieIcfgContainer [2022-04-27 12:33:26,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:33:26,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:33:26,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:33:26,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:33:26,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:33:26" (1/3) ... [2022-04-27 12:33:26,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7475cf64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:33:26, skipping insertion in model container [2022-04-27 12:33:26,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:33:26" (2/3) ... [2022-04-27 12:33:26,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7475cf64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:33:26, skipping insertion in model container [2022-04-27 12:33:26,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:33:26" (3/3) ... [2022-04-27 12:33:26,947 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound1.i [2022-04-27 12:33:26,959 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:33:26,959 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:33:26,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:33:27,026 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@76ecdb20, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1f849c24 [2022-04-27 12:33:27,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:33:27,042 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:33:27,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:33:27,048 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:27,049 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:33:27,049 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:27,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:27,054 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-27 12:33:27,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:27,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111484368] [2022-04-27 12:33:27,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:27,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:33:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:27,297 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:33:27,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 12:33:27,298 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-27 12:33:27,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:33:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:27,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:33:27,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:33:27,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:33:27,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-27 12:33:27,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:33:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:27,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:33:27,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:33:27,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:33:27,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-27 12:33:27,332 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:33:27,332 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:33:27,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 12:33:27,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-27 12:33:27,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-27 12:33:27,333 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:33:27,333 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:33:27,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:33:27,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:33:27,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:33:27,334 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-27 12:33:27,335 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:33:27,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:33:27,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:33:27,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:33:27,337 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-27 12:33:27,337 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:33:27,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-27 12:33:27,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-27 12:33:27,338 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:33:27,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-27 12:33:27,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-27 12:33:27,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-27 12:33:27,340 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:33:27,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:27,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111484368] [2022-04-27 12:33:27,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111484368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:33:27,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:33:27,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:33:27,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369798083] [2022-04-27 12:33:27,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:27,351 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:33:27,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:27,356 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:33:27,395 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:33:27,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:33:27,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:27,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:33:27,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:33:27,426 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:33:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:27,614 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-27 12:33:27,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:33:27,614 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:33:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:27,616 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:33:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-27 12:33:27,627 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:33:27,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-27 12:33:27,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-27 12:33:27,727 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:33:27,736 INFO L225 Difference]: With dead ends: 60 [2022-04-27 12:33:27,736 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 12:33:27,739 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:33:27,743 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:33:27,743 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:33:27,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 12:33:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-27 12:33:27,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:27,778 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:33:27,783 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:33:27,784 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:33:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:27,787 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 12:33:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:33:27,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:27,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:27,789 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:33:27,789 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:33:27,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:27,792 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 12:33:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:33:27,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:27,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:27,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:27,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:27,793 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:33:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-27 12:33:27,796 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-27 12:33:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:27,797 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-27 12:33:27,797 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:33:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-27 12:33:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 12:33:27,798 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:27,798 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:33:27,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:33:27,799 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:27,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-27 12:33:27,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:27,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189228806] [2022-04-27 12:33:27,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:27,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:27,824 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:27,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [844181408] [2022-04-27 12:33:27,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:27,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:27,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:27,827 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:33:27,832 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:33:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:27,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:33:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:27,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:28,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-27 12:33:28,110 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:33:28,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:28,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {235#(<= ~counter~0 0)} {227#true} #89#return; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:28,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {235#(<= ~counter~0 0)} call #t~ret5 := main(); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:28,113 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:33:28,113 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:33:28,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#(<= ~counter~0 0)} ~cond := #in~cond; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:28,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#(<= ~counter~0 0)} assume !(0 == ~cond); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:28,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:28,116 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:33:28,117 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:33:28,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {235#(<= ~counter~0 0)} ~cond := #in~cond; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:28,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {235#(<= ~counter~0 0)} assume !(0 == ~cond); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:28,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:33:28,121 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:33:28,122 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:33:28,123 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:33:28,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {284#(<= |main_#t~post3| 0)} assume !(#t~post3 < 1);havoc #t~post3; {228#false} is VALID [2022-04-27 12:33:28,125 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:33:28,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {228#false} assume !(#t~post4 < 1);havoc #t~post4; {228#false} is VALID [2022-04-27 12:33:28,126 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:33:28,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-27 12:33:28,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-27 12:33:28,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-27 12:33:28,127 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:33:28,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:33:28,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:28,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189228806] [2022-04-27 12:33:28,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:28,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844181408] [2022-04-27 12:33:28,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844181408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:33:28,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:33:28,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:33:28,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14635511] [2022-04-27 12:33:28,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:28,135 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:33:28,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:28,135 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:33:28,153 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:33:28,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:33:28,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:28,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:33:28,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:33:28,155 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:33:28,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:28,224 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-27 12:33:28,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:33:28,225 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:33:28,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:28,226 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:33:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-27 12:33:28,229 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:33:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-27 12:33:28,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-27 12:33:28,272 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:33:28,274 INFO L225 Difference]: With dead ends: 42 [2022-04-27 12:33:28,274 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 12:33:28,275 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:33:28,277 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:33:28,277 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:33:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 12:33:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 12:33:28,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:28,293 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:33:28,294 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:33:28,295 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:33:28,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:28,299 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-27 12:33:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:33:28,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:28,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:28,301 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:33:28,301 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:33:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:28,303 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-27 12:33:28,303 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:33:28,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:28,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:28,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:28,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:28,304 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:33:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-27 12:33:28,306 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-27 12:33:28,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:28,306 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-27 12:33:28,306 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:33:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:33:28,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 12:33:28,307 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:28,307 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:33:28,333 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:33:28,527 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:33:28,528 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:28,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:28,528 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-27 12:33:28,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:28,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425037003] [2022-04-27 12:33:28,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:28,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:28,555 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:28,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [594195434] [2022-04-27 12:33:28,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:28,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:28,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:28,556 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:33:28,559 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:33:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:28,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 12:33:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:28,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:29,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {464#true} call ULTIMATE.init(); {464#true} is VALID [2022-04-27 12:33:29,108 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; {464#true} is VALID [2022-04-27 12:33:29,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {464#true} assume true; {464#true} is VALID [2022-04-27 12:33:29,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {464#true} {464#true} #89#return; {464#true} is VALID [2022-04-27 12:33:29,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {464#true} call #t~ret5 := main(); {464#true} is VALID [2022-04-27 12:33:29,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {464#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; {464#true} is VALID [2022-04-27 12:33:29,109 INFO L272 TraceCheckUtils]: 6: Hoare triple {464#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {464#true} is VALID [2022-04-27 12:33:29,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {464#true} ~cond := #in~cond; {464#true} is VALID [2022-04-27 12:33:29,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {464#true} assume !(0 == ~cond); {464#true} is VALID [2022-04-27 12:33:29,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {464#true} assume true; {464#true} is VALID [2022-04-27 12:33:29,110 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {464#true} {464#true} #81#return; {464#true} is VALID [2022-04-27 12:33:29,110 INFO L272 TraceCheckUtils]: 11: Hoare triple {464#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {464#true} is VALID [2022-04-27 12:33:29,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {464#true} ~cond := #in~cond; {464#true} is VALID [2022-04-27 12:33:29,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {464#true} assume !(0 == ~cond); {464#true} is VALID [2022-04-27 12:33:29,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {464#true} assume true; {464#true} is VALID [2022-04-27 12:33:29,110 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {464#true} {464#true} #83#return; {464#true} is VALID [2022-04-27 12:33:29,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {464#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {517#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:33:29,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {517#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {517#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:33:29,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {517#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 1);havoc #t~post3; {517#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:33:29,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {517#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {527#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:33:29,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {527#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {527#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:33:29,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {527#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post4 < 1);havoc #t~post4; {527#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:33:29,115 INFO L272 TraceCheckUtils]: 22: Hoare triple {527#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {537#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:33:29,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {537#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {541#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:33:29,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {541#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {465#false} is VALID [2022-04-27 12:33:29,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {465#false} assume !false; {465#false} is VALID [2022-04-27 12:33:29,116 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:33:29,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:33:29,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:29,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425037003] [2022-04-27 12:33:29,117 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:29,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594195434] [2022-04-27 12:33:29,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594195434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:33:29,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:33:29,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:33:29,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217527094] [2022-04-27 12:33:29,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:29,118 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:33:29,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:29,118 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:33:29,139 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:33:29,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:33:29,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:29,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:33:29,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:33:29,140 INFO L87 Difference]: Start difference. First operand 30 states and 36 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:33:29,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:29,416 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-04-27 12:33:29,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:33:29,416 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:33:29,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:29,417 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:33:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-27 12:33:29,419 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:33:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-27 12:33:29,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-27 12:33:29,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:29,476 INFO L225 Difference]: With dead ends: 47 [2022-04-27 12:33:29,476 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 12:33:29,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:33:29,477 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:33:29,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 116 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:33:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 12:33:29,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-04-27 12:33:29,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:29,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 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:33:29,489 INFO L74 IsIncluded]: Start isIncluded. First operand 43 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:33:29,489 INFO L87 Difference]: Start difference. First operand 43 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:33:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:29,491 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-27 12:33:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-27 12:33:29,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:29,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:29,492 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 43 states. [2022-04-27 12:33:29,493 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 43 states. [2022-04-27 12:33:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:29,495 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-27 12:33:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-27 12:33:29,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:29,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:29,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:29,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:29,496 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:33:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-27 12:33:29,498 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-27 12:33:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:29,498 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-27 12:33:29,498 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:33:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 12:33:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 12:33:29,499 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:33:29,500 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:33:29,522 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:33:29,713 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:33:29,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:33:29,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:33:29,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 1 times [2022-04-27 12:33:29,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:33:29,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662271526] [2022-04-27 12:33:29,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:29,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:33:29,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:33:29,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1933871051] [2022-04-27 12:33:29,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:33:29,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:33:29,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:33:29,748 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:33:29,787 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:33:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:29,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:33:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:33:29,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:33:29,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {752#true} call ULTIMATE.init(); {752#true} is VALID [2022-04-27 12:33:29,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {752#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; {760#(<= 0 ~counter~0)} is VALID [2022-04-27 12:33:29,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#(<= 0 ~counter~0)} assume true; {760#(<= 0 ~counter~0)} is VALID [2022-04-27 12:33:29,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#(<= 0 ~counter~0)} {752#true} #89#return; {760#(<= 0 ~counter~0)} is VALID [2022-04-27 12:33:29,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {760#(<= 0 ~counter~0)} call #t~ret5 := main(); {760#(<= 0 ~counter~0)} is VALID [2022-04-27 12:33:29,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {760#(<= 0 ~counter~0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {760#(<= 0 ~counter~0)} is VALID [2022-04-27 12:33:29,961 INFO L272 TraceCheckUtils]: 6: Hoare triple {760#(<= 0 ~counter~0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {760#(<= 0 ~counter~0)} is VALID [2022-04-27 12:33:29,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {760#(<= 0 ~counter~0)} ~cond := #in~cond; {760#(<= 0 ~counter~0)} is VALID [2022-04-27 12:33:29,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {760#(<= 0 ~counter~0)} assume !(0 == ~cond); {760#(<= 0 ~counter~0)} is VALID [2022-04-27 12:33:29,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {760#(<= 0 ~counter~0)} assume true; {760#(<= 0 ~counter~0)} is VALID [2022-04-27 12:33:29,963 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {760#(<= 0 ~counter~0)} {760#(<= 0 ~counter~0)} #81#return; {760#(<= 0 ~counter~0)} is VALID [2022-04-27 12:33:29,963 INFO L272 TraceCheckUtils]: 11: Hoare triple {760#(<= 0 ~counter~0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {760#(<= 0 ~counter~0)} is VALID [2022-04-27 12:33:29,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {760#(<= 0 ~counter~0)} ~cond := #in~cond; {760#(<= 0 ~counter~0)} is VALID [2022-04-27 12:33:29,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {760#(<= 0 ~counter~0)} assume !(0 == ~cond); {760#(<= 0 ~counter~0)} is VALID [2022-04-27 12:33:29,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {760#(<= 0 ~counter~0)} assume true; {760#(<= 0 ~counter~0)} is VALID [2022-04-27 12:33:29,965 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {760#(<= 0 ~counter~0)} {760#(<= 0 ~counter~0)} #83#return; {760#(<= 0 ~counter~0)} is VALID [2022-04-27 12:33:29,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {760#(<= 0 ~counter~0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {760#(<= 0 ~counter~0)} is VALID [2022-04-27 12:33:29,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {760#(<= 0 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {809#(<= 1 ~counter~0)} is VALID [2022-04-27 12:33:29,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {809#(<= 1 ~counter~0)} assume !!(#t~post3 < 1);havoc #t~post3; {809#(<= 1 ~counter~0)} is VALID [2022-04-27 12:33:29,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {809#(<= 1 ~counter~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {809#(<= 1 ~counter~0)} is VALID [2022-04-27 12:33:29,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {809#(<= 1 ~counter~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {819#(<= 1 |main_#t~post4|)} is VALID [2022-04-27 12:33:29,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {819#(<= 1 |main_#t~post4|)} assume !!(#t~post4 < 1);havoc #t~post4; {753#false} is VALID [2022-04-27 12:33:29,973 INFO L272 TraceCheckUtils]: 22: Hoare triple {753#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {753#false} is VALID [2022-04-27 12:33:29,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {753#false} ~cond := #in~cond; {753#false} is VALID [2022-04-27 12:33:29,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {753#false} assume !(0 == ~cond); {753#false} is VALID [2022-04-27 12:33:29,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {753#false} assume true; {753#false} is VALID [2022-04-27 12:33:29,975 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {753#false} {753#false} #85#return; {753#false} is VALID [2022-04-27 12:33:29,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {753#false} 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); {753#false} is VALID [2022-04-27 12:33:29,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {753#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {753#false} is VALID [2022-04-27 12:33:29,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {753#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {753#false} is VALID [2022-04-27 12:33:29,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {753#false} assume !(#t~post4 < 1);havoc #t~post4; {753#false} is VALID [2022-04-27 12:33:29,988 INFO L272 TraceCheckUtils]: 31: Hoare triple {753#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {753#false} is VALID [2022-04-27 12:33:29,988 INFO L290 TraceCheckUtils]: 32: Hoare triple {753#false} ~cond := #in~cond; {753#false} is VALID [2022-04-27 12:33:29,989 INFO L290 TraceCheckUtils]: 33: Hoare triple {753#false} assume 0 == ~cond; {753#false} is VALID [2022-04-27 12:33:29,989 INFO L290 TraceCheckUtils]: 34: Hoare triple {753#false} assume !false; {753#false} is VALID [2022-04-27 12:33:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 12:33:29,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:33:29,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:33:29,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662271526] [2022-04-27 12:33:29,990 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:33:29,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933871051] [2022-04-27 12:33:29,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933871051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:33:29,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:33:29,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:33:29,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225817428] [2022-04-27 12:33:29,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:33:29,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-27 12:33:29,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:33:29,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:33:30,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:30,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:33:30,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:33:30,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:33:30,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:33:30,023 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:33:30,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:30,076 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 12:33:30,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:33:30,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-27 12:33:30,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:33:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:33:30,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-27 12:33:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:33:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-27 12:33:30,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-27 12:33:30,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:33:30,107 INFO L225 Difference]: With dead ends: 41 [2022-04-27 12:33:30,107 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 12:33:30,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:33:30,108 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:33:30,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 44 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:33:30,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 12:33:30,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 12:33:30,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:33:30,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:33:30,110 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:33:30,110 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:33:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:30,110 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:33:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:33:30,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:30,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:30,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 12:33:30,110 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 12:33:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:33:30,111 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:33:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:33:30,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:30,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:33:30,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:33:30,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:33:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:33:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 12:33:30,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-04-27 12:33:30,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:33:30,124 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 12:33:30,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:33:30,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:33:30,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:33:30,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 12:33:30,153 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:33:30,350 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:33:30,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 12:33:30,466 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 12:33:30,466 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 12:33:30,466 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 12:33:30,467 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 12:33:30,467 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2022-04-27 12:33:30,467 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2022-04-27 12:33:30,467 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2022-04-27 12:33:30,467 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:33:30,467 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:33:30,467 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 26 52) no Hoare annotation was computed. [2022-04-27 12:33:30,467 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-04-27 12:33:30,467 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 26 52) no Hoare annotation was computed. [2022-04-27 12:33:30,467 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 49) no Hoare annotation was computed. [2022-04-27 12:33:30,467 INFO L895 garLoopResultBuilder]: At program point L40-2(lines 40 49) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:33:30,468 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 36 39) no Hoare annotation was computed. [2022-04-27 12:33:30,468 INFO L895 garLoopResultBuilder]: At program point L36-3(lines 36 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (<= 0 ~counter~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:33:30,468 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-04-27 12:33:30,468 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 26 52) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:33:30,468 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 48) no Hoare annotation was computed. [2022-04-27 12:33:30,468 INFO L899 garLoopResultBuilder]: For program point L45-2(lines 26 52) no Hoare annotation was computed. [2022-04-27 12:33:30,468 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:33:30,468 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 40 49) no Hoare annotation was computed. [2022-04-27 12:33:30,468 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-04-27 12:33:30,468 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:33:30,469 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 12:33:30,469 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:33:30,469 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:33:30,469 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-27 12:33:30,469 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 12:33:30,469 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:33:30,469 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 24) no Hoare annotation was computed. [2022-04-27 12:33:30,469 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 24) the Hoare annotation is: true [2022-04-27 12:33:30,469 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 24) no Hoare annotation was computed. [2022-04-27 12:33:30,469 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 21) no Hoare annotation was computed. [2022-04-27 12:33:30,469 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 22) no Hoare annotation was computed. [2022-04-27 12:33:30,470 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2022-04-27 12:33:30,472 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 12:33:30,474 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 12:33:30,477 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:33:30,477 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:33:30,477 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:33:30,479 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:33:30,481 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 12:33:30,481 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 12:33:30,481 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:33:30,481 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:33:30,482 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:33:30,482 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:33:30,482 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 12:33:30,482 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 12:33:30,482 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 12:33:30,482 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:33:30,482 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 12:33:30,482 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 12:33:30,482 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 12:33:30,482 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 12:33:30,482 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-27 12:33:30,482 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:33:30,482 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 12:33:30,483 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 12:33:30,484 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 12:33:30,484 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 12:33:30,484 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 12:33:30,484 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 12:33:30,484 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-27 12:33:30,484 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 12:33:30,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 12:33:30 BoogieIcfgContainer [2022-04-27 12:33:30,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 12:33:30,492 INFO L158 Benchmark]: Toolchain (without parser) took 4051.47ms. Allocated memory was 183.5MB in the beginning and 265.3MB in the end (delta: 81.8MB). Free memory was 129.1MB in the beginning and 226.4MB in the end (delta: -97.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:33:30,492 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:33:30,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.16ms. Allocated memory was 183.5MB in the beginning and 265.3MB in the end (delta: 81.8MB). Free memory was 128.8MB in the beginning and 239.6MB in the end (delta: -110.8MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-04-27 12:33:30,493 INFO L158 Benchmark]: Boogie Preprocessor took 25.79ms. Allocated memory is still 265.3MB. Free memory was 239.2MB in the beginning and 237.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 12:33:30,493 INFO L158 Benchmark]: RCFGBuilder took 259.82ms. Allocated memory is still 265.3MB. Free memory was 237.8MB in the beginning and 226.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 12:33:30,493 INFO L158 Benchmark]: TraceAbstraction took 3548.92ms. Allocated memory is still 265.3MB. Free memory was 225.6MB in the beginning and 226.4MB in the end (delta: -863.6kB). Peak memory consumption was 42.4kB. Max. memory is 8.0GB. [2022-04-27 12:33:30,495 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.16ms. Allocated memory was 183.5MB in the beginning and 265.3MB in the end (delta: 81.8MB). Free memory was 128.8MB in the beginning and 239.6MB in the end (delta: -110.8MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.79ms. Allocated memory is still 265.3MB. Free memory was 239.2MB in the beginning and 237.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 259.82ms. Allocated memory is still 265.3MB. Free memory was 237.8MB in the beginning and 226.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3548.92ms. Allocated memory is still 265.3MB. Free memory was 225.6MB in the beginning and 226.4MB in the end (delta: -863.6kB). Peak memory consumption was 42.4kB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 281 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 112 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=3, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 21 PreInvPairs, 26 NumberOfFragments, 112 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 52 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 252 SizeOfPredicates, 5 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 20/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (!(\old(counter) <= 0) || ((A == r && 0 <= counter) && q == 0)) || !(0 <= \old(counter)) RESULT: Ultimate proved your program to be correct! [2022-04-27 12:33:30,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...