/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/loops/sum01_bug02_sum01_bug02_base.case.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:19:38,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:19:38,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:19:38,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:19:38,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:19:38,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:19:38,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:19:38,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:19:38,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:19:38,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:19:38,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:19:38,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:19:38,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:19:38,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:19:38,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:19:38,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:19:38,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:19:38,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:19:38,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:19:38,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:19:38,777 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:19:38,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:19:38,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:19:38,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:19:38,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:19:38,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:19:38,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:19:38,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:19:38,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:19:38,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:19:38,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:19:38,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:19:38,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:19:38,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:19:38,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:19:38,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:19:38,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:19:38,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:19:38,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:19:38,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:19:38,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:19:38,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:19:38,791 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 10:19:38,809 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:19:38,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:19:38,810 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:19:38,810 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:19:38,810 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:19:38,810 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:19:38,811 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:19:38,811 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:19:38,811 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:19:38,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:19:38,811 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:19:38,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:19:38,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:19:38,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:19:38,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:19:38,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:19:38,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:19:38,812 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:19:38,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:19:38,812 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:19:38,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:19:38,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:19:38,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:19:38,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:19:38,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:19:38,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:19:38,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:19:38,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:19:38,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:19:38,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:19:38,814 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:19:38,814 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:19:38,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:19:38,814 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 10:19:39,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:19:39,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:19:39,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:19:39,021 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:19:39,023 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:19:39,024 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2022-04-27 10:19:39,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b5640c5b/7514a75ee67643188033fbe1ae7aaa59/FLAGd86bcb6cb [2022-04-27 10:19:39,391 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:19:39,392 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2022-04-27 10:19:39,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b5640c5b/7514a75ee67643188033fbe1ae7aaa59/FLAGd86bcb6cb [2022-04-27 10:19:39,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b5640c5b/7514a75ee67643188033fbe1ae7aaa59 [2022-04-27 10:19:39,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:19:39,408 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:19:39,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:19:39,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:19:39,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:19:39,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:19:39" (1/1) ... [2022-04-27 10:19:39,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677e00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:39, skipping insertion in model container [2022-04-27 10:19:39,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:19:39" (1/1) ... [2022-04-27 10:19:39,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:19:39,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:19:39,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i[834,847] [2022-04-27 10:19:39,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:19:39,661 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:19:39,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i[834,847] [2022-04-27 10:19:39,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:19:39,686 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:19:39,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:39 WrapperNode [2022-04-27 10:19:39,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:19:39,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:19:39,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:19:39,688 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:19:39,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:39" (1/1) ... [2022-04-27 10:19:39,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:39" (1/1) ... [2022-04-27 10:19:39,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:39" (1/1) ... [2022-04-27 10:19:39,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:39" (1/1) ... [2022-04-27 10:19:39,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:39" (1/1) ... [2022-04-27 10:19:39,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:39" (1/1) ... [2022-04-27 10:19:39,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:39" (1/1) ... [2022-04-27 10:19:39,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:19:39,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:19:39,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:19:39,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:19:39,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:39" (1/1) ... [2022-04-27 10:19:39,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:19:39,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:39,743 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 10:19:39,770 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 10:19:39,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:19:39,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:19:39,784 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:19:39,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:19:39,784 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:19:39,784 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:19:39,784 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:19:39,784 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:19:39,784 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:19:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:19:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:19:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:19:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 10:19:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:19:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:19:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:19:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:19:39,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:19:39,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:19:39,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:19:39,837 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:19:39,839 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:19:39,965 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:19:39,970 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:19:39,971 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:19:39,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:19:39 BoogieIcfgContainer [2022-04-27 10:19:39,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:19:39,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:19:39,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:19:39,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:19:39,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:19:39" (1/3) ... [2022-04-27 10:19:39,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bb5979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:19:39, skipping insertion in model container [2022-04-27 10:19:39,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:39" (2/3) ... [2022-04-27 10:19:39,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bb5979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:19:39, skipping insertion in model container [2022-04-27 10:19:39,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:19:39" (3/3) ... [2022-04-27 10:19:39,979 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case.i [2022-04-27 10:19:39,990 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:19:39,991 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:19:40,031 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:19:40,037 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@28811138, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c6e55b4 [2022-04-27 10:19:40,037 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:19:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:19:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:19:40,051 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:40,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:40,051 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:40,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:40,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 1 times [2022-04-27 10:19:40,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:40,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489193340] [2022-04-27 10:19:40,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:40,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:40,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:40,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#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(36, 2); {23#true} is VALID [2022-04-27 10:19:40,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 10:19:40,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-27 10:19:40,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:40,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#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(36, 2); {23#true} is VALID [2022-04-27 10:19:40,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 10:19:40,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-27 10:19:40,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-27 10:19:40,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {23#true} is VALID [2022-04-27 10:19:40,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-27 10:19:40,208 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {24#false} is VALID [2022-04-27 10:19:40,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-27 10:19:40,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-27 10:19:40,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 10:19:40,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:40,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:40,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489193340] [2022-04-27 10:19:40,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489193340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:40,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:40,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:19:40,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338349232] [2022-04-27 10:19:40,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:40,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:19:40,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:40,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:40,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:19:40,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:40,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:19:40,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:19:40,267 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:40,324 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-27 10:19:40,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:19:40,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:19:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:40,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 10:19:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 10:19:40,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-27 10:19:40,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:40,418 INFO L225 Difference]: With dead ends: 31 [2022-04-27 10:19:40,418 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 10:19:40,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 10:19:40,426 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:40,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:19:40,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 10:19:40,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 10:19:40,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:40,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,453 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,453 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:40,460 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 10:19:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 10:19:40,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:40,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:40,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 10:19:40,461 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 10:19:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:40,462 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 10:19:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 10:19:40,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:40,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:40,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:40,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 10:19:40,465 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-27 10:19:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:40,466 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 10:19:40,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 10:19:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:19:40,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:40,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:40,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:19:40,467 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:40,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:40,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 1 times [2022-04-27 10:19:40,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:40,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774947995] [2022-04-27 10:19:40,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:40,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:40,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:40,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {128#(and (= |#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(36, 2); {120#true} is VALID [2022-04-27 10:19:40,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} assume true; {120#true} is VALID [2022-04-27 10:19:40,607 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120#true} {120#true} #47#return; {120#true} is VALID [2022-04-27 10:19:40,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {120#true} call ULTIMATE.init(); {128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:40,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#(and (= |#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(36, 2); {120#true} is VALID [2022-04-27 10:19:40,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {120#true} assume true; {120#true} is VALID [2022-04-27 10:19:40,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120#true} {120#true} #47#return; {120#true} is VALID [2022-04-27 10:19:40,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {120#true} call #t~ret3 := main(); {120#true} is VALID [2022-04-27 10:19:40,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:40,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:40,613 INFO L272 TraceCheckUtils]: 7: Hoare triple {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {126#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:19:40,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {126#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {127#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:19:40,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {127#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {121#false} is VALID [2022-04-27 10:19:40,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {121#false} assume !false; {121#false} is VALID [2022-04-27 10:19:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:40,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:40,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774947995] [2022-04-27 10:19:40,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774947995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:40,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:40,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:19:40,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263509116] [2022-04-27 10:19:40,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:40,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:19:40,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:40,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:40,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:19:40,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:40,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:19:40,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:19:40,640 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:40,789 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 10:19:40,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:19:40,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:19:40,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-27 10:19:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-27 10:19:40,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 21 transitions. [2022-04-27 10:19:40,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:40,814 INFO L225 Difference]: With dead ends: 20 [2022-04-27 10:19:40,814 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 10:19:40,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:19:40,816 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:40,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 29 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:19:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 10:19:40,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 10:19:40,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:40,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,823 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,823 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:40,824 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 10:19:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 10:19:40,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:40,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:40,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 10:19:40,825 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 10:19:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:40,826 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 10:19:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 10:19:40,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:40,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:40,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:40,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 10:19:40,833 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-27 10:19:40,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:40,833 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 10:19:40,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 10:19:40,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:19:40,834 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:40,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:40,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:19:40,834 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:40,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:40,835 INFO L85 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 1 times [2022-04-27 10:19:40,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:40,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315771905] [2022-04-27 10:19:40,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:40,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:40,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:40,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {226#(and (= |#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(36, 2); {220#true} is VALID [2022-04-27 10:19:40,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#true} assume true; {220#true} is VALID [2022-04-27 10:19:40,921 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {220#true} {220#true} #47#return; {220#true} is VALID [2022-04-27 10:19:40,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:40,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#(and (= |#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(36, 2); {220#true} is VALID [2022-04-27 10:19:40,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {220#true} assume true; {220#true} is VALID [2022-04-27 10:19:40,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} #47#return; {220#true} is VALID [2022-04-27 10:19:40,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {220#true} call #t~ret3 := main(); {220#true} is VALID [2022-04-27 10:19:40,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {225#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-27 10:19:40,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {225#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {225#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-27 10:19:40,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {225#(= (+ (- 1) main_~i~0) 0)} assume 4 == ~i~0;~sn~0 := -10; {221#false} is VALID [2022-04-27 10:19:40,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {221#false} is VALID [2022-04-27 10:19:40,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {221#false} assume !(~i~0 <= ~n~0); {221#false} is VALID [2022-04-27 10:19:40,924 INFO L272 TraceCheckUtils]: 10: Hoare triple {221#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {221#false} is VALID [2022-04-27 10:19:40,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {221#false} ~cond := #in~cond; {221#false} is VALID [2022-04-27 10:19:40,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {221#false} assume 0 == ~cond; {221#false} is VALID [2022-04-27 10:19:40,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {221#false} assume !false; {221#false} is VALID [2022-04-27 10:19:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:40,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:40,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315771905] [2022-04-27 10:19:40,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315771905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:40,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:40,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:19:40,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492892837] [2022-04-27 10:19:40,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:40,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:19:40,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:40,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:40,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:19:40,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:40,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:19:40,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:19:40,951 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:41,009 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 10:19:41,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:19:41,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:19:41,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:41,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-27 10:19:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-27 10:19:41,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-27 10:19:41,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:41,087 INFO L225 Difference]: With dead ends: 25 [2022-04-27 10:19:41,088 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 10:19:41,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:19:41,089 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:41,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:19:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 10:19:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-27 10:19:41,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:41,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:41,102 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:41,103 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:41,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:41,105 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 10:19:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 10:19:41,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:41,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:41,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 10:19:41,107 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 10:19:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:41,109 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 10:19:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 10:19:41,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:41,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:41,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:41,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-27 10:19:41,111 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-04-27 10:19:41,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:41,111 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-27 10:19:41,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 10:19:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:19:41,112 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:41,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:41,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:19:41,112 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:41,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:41,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1968158987, now seen corresponding path program 1 times [2022-04-27 10:19:41,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:41,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036870144] [2022-04-27 10:19:41,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:41,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:41,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:41,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {336#(and (= |#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(36, 2); {325#true} is VALID [2022-04-27 10:19:41,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} assume true; {325#true} is VALID [2022-04-27 10:19:41,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {325#true} {325#true} #47#return; {325#true} is VALID [2022-04-27 10:19:41,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {325#true} call ULTIMATE.init(); {336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:41,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#(and (= |#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(36, 2); {325#true} is VALID [2022-04-27 10:19:41,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} assume true; {325#true} is VALID [2022-04-27 10:19:41,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325#true} {325#true} #47#return; {325#true} is VALID [2022-04-27 10:19:41,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {325#true} call #t~ret3 := main(); {325#true} is VALID [2022-04-27 10:19:41,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {330#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:41,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {330#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {331#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} is VALID [2022-04-27 10:19:41,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} assume !(4 == ~i~0); {331#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} is VALID [2022-04-27 10:19:41,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {332#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-27 10:19:41,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {332#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} assume !(~i~0 <= ~n~0); {333#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:41,343 INFO L272 TraceCheckUtils]: 10: Hoare triple {333#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {334#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:19:41,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {334#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {335#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:19:41,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {335#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {326#false} is VALID [2022-04-27 10:19:41,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#false} assume !false; {326#false} is VALID [2022-04-27 10:19:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:41,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:41,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036870144] [2022-04-27 10:19:41,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036870144] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:19:41,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209921261] [2022-04-27 10:19:41,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:41,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:41,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:41,347 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 10:19:41,352 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 10:19:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:41,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 10:19:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:41,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:19:41,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {325#true} call ULTIMATE.init(); {325#true} is VALID [2022-04-27 10:19:41,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#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(36, 2); {325#true} is VALID [2022-04-27 10:19:41,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} assume true; {325#true} is VALID [2022-04-27 10:19:41,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325#true} {325#true} #47#return; {325#true} is VALID [2022-04-27 10:19:41,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {325#true} call #t~ret3 := main(); {325#true} is VALID [2022-04-27 10:19:41,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {330#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:41,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {330#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {358#(and (<= main_~i~0 main_~n~0) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:41,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {358#(and (<= main_~i~0 main_~n~0) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 0))} assume !(4 == ~i~0); {358#(and (<= main_~i~0 main_~n~0) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:41,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {358#(and (<= main_~i~0 main_~n~0) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {365#(and (<= 1 main_~n~0) (= 2 main_~sn~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:19:41,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {365#(and (<= 1 main_~n~0) (= 2 main_~sn~0) (<= main_~i~0 2))} assume !(~i~0 <= ~n~0); {369#(and (<= 1 main_~n~0) (= 2 main_~sn~0) (< main_~n~0 2))} is VALID [2022-04-27 10:19:41,778 INFO L272 TraceCheckUtils]: 10: Hoare triple {369#(and (<= 1 main_~n~0) (= 2 main_~sn~0) (< main_~n~0 2))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {373#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:19:41,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {373#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {377#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:41,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {326#false} is VALID [2022-04-27 10:19:41,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#false} assume !false; {326#false} is VALID [2022-04-27 10:19:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:41,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:19:42,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#false} assume !false; {326#false} is VALID [2022-04-27 10:19:42,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {326#false} is VALID [2022-04-27 10:19:42,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {373#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {377#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:42,058 INFO L272 TraceCheckUtils]: 10: Hoare triple {393#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {373#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:19:42,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {393#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:42,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {401#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {397#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:42,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {401#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(4 == ~i~0); {401#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:42,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {408#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {401#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:42,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {408#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:42,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {325#true} call #t~ret3 := main(); {325#true} is VALID [2022-04-27 10:19:42,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325#true} {325#true} #47#return; {325#true} is VALID [2022-04-27 10:19:42,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} assume true; {325#true} is VALID [2022-04-27 10:19:42,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#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(36, 2); {325#true} is VALID [2022-04-27 10:19:42,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {325#true} call ULTIMATE.init(); {325#true} is VALID [2022-04-27 10:19:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:42,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209921261] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:19:42,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:19:42,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-27 10:19:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171367622] [2022-04-27 10:19:42,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:19:42,067 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:19:42,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:42,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:42,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:42,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 10:19:42,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:42,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 10:19:42,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-27 10:19:42,094 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:42,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:42,545 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-27 10:19:42,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 10:19:42,546 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:19:42,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2022-04-27 10:19:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2022-04-27 10:19:42,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 31 transitions. [2022-04-27 10:19:42,581 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 10:19:42,582 INFO L225 Difference]: With dead ends: 28 [2022-04-27 10:19:42,582 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 10:19:42,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2022-04-27 10:19:42,583 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:42,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 41 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:19:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 10:19:42,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-27 10:19:42,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:42,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:42,597 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:42,597 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:42,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:42,599 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 10:19:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-27 10:19:42,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:42,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:42,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 10:19:42,600 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 10:19:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:42,601 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 10:19:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-27 10:19:42,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:42,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:42,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:42,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-27 10:19:42,603 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2022-04-27 10:19:42,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:42,603 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-27 10:19:42,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-27 10:19:42,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:19:42,604 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:42,604 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:42,630 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 10:19:42,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:42,824 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:42,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:42,824 INFO L85 PathProgramCache]: Analyzing trace with hash 80268138, now seen corresponding path program 1 times [2022-04-27 10:19:42,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:42,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129293379] [2022-04-27 10:19:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:42,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:42,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:42,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {570#(and (= |#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(36, 2); {563#true} is VALID [2022-04-27 10:19:42,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {563#true} assume true; {563#true} is VALID [2022-04-27 10:19:42,873 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {563#true} {563#true} #47#return; {563#true} is VALID [2022-04-27 10:19:42,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {563#true} call ULTIMATE.init(); {570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:42,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {570#(and (= |#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(36, 2); {563#true} is VALID [2022-04-27 10:19:42,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {563#true} assume true; {563#true} is VALID [2022-04-27 10:19:42,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {563#true} {563#true} #47#return; {563#true} is VALID [2022-04-27 10:19:42,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {563#true} call #t~ret3 := main(); {563#true} is VALID [2022-04-27 10:19:42,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {563#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {568#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-27 10:19:42,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {568#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {568#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-27 10:19:42,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {568#(= (+ (- 1) main_~i~0) 0)} assume !(4 == ~i~0); {568#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-27 10:19:42,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {568#(= (+ (- 1) main_~i~0) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {569#(<= main_~i~0 2)} is VALID [2022-04-27 10:19:42,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {569#(<= main_~i~0 2)} is VALID [2022-04-27 10:19:42,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {569#(<= main_~i~0 2)} assume 4 == ~i~0;~sn~0 := -10; {564#false} is VALID [2022-04-27 10:19:42,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {564#false} is VALID [2022-04-27 10:19:42,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#false} assume !(~i~0 <= ~n~0); {564#false} is VALID [2022-04-27 10:19:42,878 INFO L272 TraceCheckUtils]: 13: Hoare triple {564#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {564#false} is VALID [2022-04-27 10:19:42,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {564#false} ~cond := #in~cond; {564#false} is VALID [2022-04-27 10:19:42,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {564#false} assume 0 == ~cond; {564#false} is VALID [2022-04-27 10:19:42,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {564#false} assume !false; {564#false} is VALID [2022-04-27 10:19:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:42,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:42,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129293379] [2022-04-27 10:19:42,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129293379] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:19:42,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288531781] [2022-04-27 10:19:42,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:42,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:42,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:42,881 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 10:19:42,889 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 10:19:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:42,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 10:19:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:42,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:19:42,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {563#true} call ULTIMATE.init(); {563#true} is VALID [2022-04-27 10:19:42,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {563#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(36, 2); {563#true} is VALID [2022-04-27 10:19:42,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {563#true} assume true; {563#true} is VALID [2022-04-27 10:19:42,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {563#true} {563#true} #47#return; {563#true} is VALID [2022-04-27 10:19:42,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {563#true} call #t~ret3 := main(); {563#true} is VALID [2022-04-27 10:19:42,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {563#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {589#(<= main_~i~0 1)} is VALID [2022-04-27 10:19:42,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {589#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {589#(<= main_~i~0 1)} is VALID [2022-04-27 10:19:42,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#(<= main_~i~0 1)} assume !(4 == ~i~0); {589#(<= main_~i~0 1)} is VALID [2022-04-27 10:19:42,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {569#(<= main_~i~0 2)} is VALID [2022-04-27 10:19:43,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {569#(<= main_~i~0 2)} is VALID [2022-04-27 10:19:43,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {569#(<= main_~i~0 2)} assume 4 == ~i~0;~sn~0 := -10; {564#false} is VALID [2022-04-27 10:19:43,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {564#false} is VALID [2022-04-27 10:19:43,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#false} assume !(~i~0 <= ~n~0); {564#false} is VALID [2022-04-27 10:19:43,013 INFO L272 TraceCheckUtils]: 13: Hoare triple {564#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {564#false} is VALID [2022-04-27 10:19:43,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {564#false} ~cond := #in~cond; {564#false} is VALID [2022-04-27 10:19:43,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {564#false} assume 0 == ~cond; {564#false} is VALID [2022-04-27 10:19:43,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {564#false} assume !false; {564#false} is VALID [2022-04-27 10:19:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:43,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:19:43,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {564#false} assume !false; {564#false} is VALID [2022-04-27 10:19:43,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {564#false} assume 0 == ~cond; {564#false} is VALID [2022-04-27 10:19:43,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {564#false} ~cond := #in~cond; {564#false} is VALID [2022-04-27 10:19:43,079 INFO L272 TraceCheckUtils]: 13: Hoare triple {564#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {564#false} is VALID [2022-04-27 10:19:43,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#false} assume !(~i~0 <= ~n~0); {564#false} is VALID [2022-04-27 10:19:43,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {564#false} is VALID [2022-04-27 10:19:43,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {641#(not (<= 4 main_~i~0))} assume 4 == ~i~0;~sn~0 := -10; {564#false} is VALID [2022-04-27 10:19:43,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#(not (<= 4 main_~i~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {641#(not (<= 4 main_~i~0))} is VALID [2022-04-27 10:19:43,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {569#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {641#(not (<= 4 main_~i~0))} is VALID [2022-04-27 10:19:43,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {569#(<= main_~i~0 2)} assume !(4 == ~i~0); {569#(<= main_~i~0 2)} is VALID [2022-04-27 10:19:43,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {569#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {569#(<= main_~i~0 2)} is VALID [2022-04-27 10:19:43,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {563#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {569#(<= main_~i~0 2)} is VALID [2022-04-27 10:19:43,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {563#true} call #t~ret3 := main(); {563#true} is VALID [2022-04-27 10:19:43,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {563#true} {563#true} #47#return; {563#true} is VALID [2022-04-27 10:19:43,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {563#true} assume true; {563#true} is VALID [2022-04-27 10:19:43,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {563#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(36, 2); {563#true} is VALID [2022-04-27 10:19:43,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {563#true} call ULTIMATE.init(); {563#true} is VALID [2022-04-27 10:19:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:43,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288531781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:19:43,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:19:43,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-27 10:19:43,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377462219] [2022-04-27 10:19:43,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:19:43,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 10:19:43,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:43,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:43,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:43,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:19:43,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:43,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:19:43,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:19:43,109 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:43,210 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-27 10:19:43,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:19:43,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 10:19:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-27 10:19:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-27 10:19:43,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-27 10:19:43,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:43,243 INFO L225 Difference]: With dead ends: 31 [2022-04-27 10:19:43,243 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 10:19:43,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:19:43,244 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:43,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:19:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 10:19:43,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-27 10:19:43,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:43,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:43,254 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:43,254 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:43,255 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-27 10:19:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-27 10:19:43,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:43,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:43,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 10:19:43,256 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 10:19:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:43,257 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-27 10:19:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-27 10:19:43,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:43,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:43,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:43,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:43,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-27 10:19:43,259 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2022-04-27 10:19:43,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:43,259 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-27 10:19:43,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:43,260 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 10:19:43,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:19:43,260 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:43,260 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:43,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:19:43,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:43,461 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:43,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:43,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1902707051, now seen corresponding path program 2 times [2022-04-27 10:19:43,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:43,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040107402] [2022-04-27 10:19:43,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:43,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:43,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:43,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {816#(and (= |#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(36, 2); {802#true} is VALID [2022-04-27 10:19:43,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {802#true} assume true; {802#true} is VALID [2022-04-27 10:19:43,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {802#true} {802#true} #47#return; {802#true} is VALID [2022-04-27 10:19:43,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {802#true} call ULTIMATE.init(); {816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:43,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#(and (= |#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(36, 2); {802#true} is VALID [2022-04-27 10:19:43,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {802#true} assume true; {802#true} is VALID [2022-04-27 10:19:43,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {802#true} {802#true} #47#return; {802#true} is VALID [2022-04-27 10:19:43,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {802#true} call #t~ret3 := main(); {802#true} is VALID [2022-04-27 10:19:43,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {802#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {807#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:43,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {807#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {808#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:43,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {808#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} assume !(4 == ~i~0); {808#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:43,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {808#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {809#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-27 10:19:43,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {809#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {810#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:43,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {810#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} assume !(4 == ~i~0); {810#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:43,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {810#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {809#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-27 10:19:43,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {809#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {811#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-27 10:19:43,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {811#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} assume !(4 == ~i~0); {811#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-27 10:19:43,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {811#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {812#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-27 10:19:43,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {812#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} assume !(~i~0 <= ~n~0); {813#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:43,695 INFO L272 TraceCheckUtils]: 16: Hoare triple {813#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:19:43,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {814#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {815#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:19:43,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {815#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {803#false} is VALID [2022-04-27 10:19:43,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {803#false} assume !false; {803#false} is VALID [2022-04-27 10:19:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:19:43,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:43,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040107402] [2022-04-27 10:19:43,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040107402] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:19:43,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170827850] [2022-04-27 10:19:43,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:19:43,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:43,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:43,698 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 10:19:43,700 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 10:19:43,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:19:43,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:19:43,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 10:19:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:43,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:19:44,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {802#true} call ULTIMATE.init(); {802#true} is VALID [2022-04-27 10:19:44,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {802#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(36, 2); {802#true} is VALID [2022-04-27 10:19:44,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {802#true} assume true; {802#true} is VALID [2022-04-27 10:19:44,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {802#true} {802#true} #47#return; {802#true} is VALID [2022-04-27 10:19:44,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {802#true} call #t~ret3 := main(); {802#true} is VALID [2022-04-27 10:19:44,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {802#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {807#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:44,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {807#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {808#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:44,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {808#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} assume !(4 == ~i~0); {808#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:44,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {808#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {844#(and (= (+ (- 2) main_~i~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:44,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {844#(and (= (+ (- 2) main_~i~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {848#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-27 10:19:44,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {848#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} assume !(4 == ~i~0); {848#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-27 10:19:44,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {848#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {855#(and (<= 4 main_~sn~0) (= main_~i~0 3) (<= main_~sn~0 4))} is VALID [2022-04-27 10:19:44,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(and (<= 4 main_~sn~0) (= main_~i~0 3) (<= main_~sn~0 4))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {859#(and (= main_~i~0 3) (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6))} is VALID [2022-04-27 10:19:44,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {859#(and (= main_~i~0 3) (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6))} assume !(4 == ~i~0); {859#(and (= main_~i~0 3) (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6))} is VALID [2022-04-27 10:19:44,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {859#(and (= main_~i~0 3) (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {866#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} is VALID [2022-04-27 10:19:44,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {866#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} assume !(~i~0 <= ~n~0); {870#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} is VALID [2022-04-27 10:19:44,216 INFO L272 TraceCheckUtils]: 16: Hoare triple {870#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:19:44,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:44,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {803#false} is VALID [2022-04-27 10:19:44,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {803#false} assume !false; {803#false} is VALID [2022-04-27 10:19:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:44,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:19:44,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {803#false} assume !false; {803#false} is VALID [2022-04-27 10:19:44,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {803#false} is VALID [2022-04-27 10:19:44,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:44,744 INFO L272 TraceCheckUtils]: 16: Hoare triple {894#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:19:44,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {898#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {894#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:44,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {902#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {898#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:44,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {902#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(4 == ~i~0); {902#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:44,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {909#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {902#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-27 10:19:44,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {909#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:44,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {913#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} assume !(4 == ~i~0); {913#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:44,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {913#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:44,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {924#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {920#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-27 10:19:44,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {924#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} assume !(4 == ~i~0); {924#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-27 10:19:44,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {931#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {924#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-27 10:19:44,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {802#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {931#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-27 10:19:44,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {802#true} call #t~ret3 := main(); {802#true} is VALID [2022-04-27 10:19:44,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {802#true} {802#true} #47#return; {802#true} is VALID [2022-04-27 10:19:44,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {802#true} assume true; {802#true} is VALID [2022-04-27 10:19:44,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {802#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(36, 2); {802#true} is VALID [2022-04-27 10:19:44,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {802#true} call ULTIMATE.init(); {802#true} is VALID [2022-04-27 10:19:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:44,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170827850] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:19:44,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:19:44,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-04-27 10:19:44,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828680932] [2022-04-27 10:19:44,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:19:44,760 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 10:19:44,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:44,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:44,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:44,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 10:19:44,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:44,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 10:19:44,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2022-04-27 10:19:44,802 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:45,703 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 10:19:45,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 10:19:45,704 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 10:19:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2022-04-27 10:19:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2022-04-27 10:19:45,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 37 transitions. [2022-04-27 10:19:45,743 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 10:19:45,744 INFO L225 Difference]: With dead ends: 34 [2022-04-27 10:19:45,744 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 10:19:45,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=269, Invalid=1453, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 10:19:45,746 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:45,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 81 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:19:45,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 10:19:45,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-04-27 10:19:45,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:45,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:45,762 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:45,762 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:45,763 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-27 10:19:45,763 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-27 10:19:45,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:45,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:45,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-27 10:19:45,766 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-27 10:19:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:45,770 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-27 10:19:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-27 10:19:45,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:45,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:45,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:45,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-27 10:19:45,772 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2022-04-27 10:19:45,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:45,772 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-27 10:19:45,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:45,773 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 10:19:45,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 10:19:45,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:45,774 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:45,799 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 10:19:45,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:45,996 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:45,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:45,996 INFO L85 PathProgramCache]: Analyzing trace with hash 116795146, now seen corresponding path program 2 times [2022-04-27 10:19:45,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:45,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074436028] [2022-04-27 10:19:45,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:45,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:19:46,012 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 10:19:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:19:46,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 10:19:46,050 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 10:19:46,051 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:19:46,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 10:19:46,055 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2022-04-27 10:19:46,058 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:19:46,087 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:19:46,088 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-27 10:19:46,089 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-27 10:19:46,089 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 10:19:46,089 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 10:19:46,089 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 10:19:46,089 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 10:19:46,089 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:19:46,089 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:19:46,089 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-27 10:19:46,089 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:19:46,089 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:19:46,089 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:19:46,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:19:46 BoogieIcfgContainer [2022-04-27 10:19:46,090 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:19:46,097 INFO L158 Benchmark]: Toolchain (without parser) took 6689.35ms. Allocated memory was 173.0MB in the beginning and 249.6MB in the end (delta: 76.5MB). Free memory was 119.9MB in the beginning and 226.5MB in the end (delta: -106.6MB). Peak memory consumption was 91.8MB. Max. memory is 8.0GB. [2022-04-27 10:19:46,098 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 173.0MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:19:46,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.57ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 119.8MB in the beginning and 183.4MB in the end (delta: -63.6MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. [2022-04-27 10:19:46,098 INFO L158 Benchmark]: Boogie Preprocessor took 23.50ms. Allocated memory is still 207.6MB. Free memory was 183.4MB in the beginning and 181.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:19:46,098 INFO L158 Benchmark]: RCFGBuilder took 260.67ms. Allocated memory is still 207.6MB. Free memory was 181.8MB in the beginning and 171.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 10:19:46,099 INFO L158 Benchmark]: TraceAbstraction took 6122.58ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 170.9MB in the beginning and 226.5MB in the end (delta: -55.6MB). Peak memory consumption was 108.1MB. Max. memory is 8.0GB. [2022-04-27 10:19:46,100 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.12ms. Allocated memory is still 173.0MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.57ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 119.8MB in the beginning and 183.4MB in the end (delta: -63.6MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.50ms. Allocated memory is still 207.6MB. Free memory was 183.4MB in the beginning and 181.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 260.67ms. Allocated memory is still 207.6MB. Free memory was 181.8MB in the beginning and 171.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6122.58ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 170.9MB in the beginning and 226.5MB in the end (delta: -55.6MB). Peak memory consumption was 108.1MB. 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 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L24] i=1 VAL [i=1, n=4, n=0] [L24] COND TRUE i<=n [L25] sn = sn + (2) VAL [i=1, n=4, n=2] [L26] COND FALSE !(i==4) VAL [i=1, n=4, n=2] [L24] i++ VAL [i=2, n=2, n=4] [L24] COND TRUE i<=n [L25] sn = sn + (2) VAL [i=2, n=4, n=4] [L26] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L24] i++ VAL [i=3, n=4, n=4] [L24] COND TRUE i<=n [L25] sn = sn + (2) VAL [i=3, n=6, n=4] [L26] COND FALSE !(i==4) VAL [i=3, n=4, n=6] [L24] i++ VAL [i=4, n=4, n=6] [L24] COND TRUE i<=n [L25] sn = sn + (2) VAL [i=4, n=4, n=8] [L26] COND TRUE i==4 [L26] sn=-10 VAL [i=4, n=-10, n=4] [L24] i++ VAL [i=5, n=-10, n=4] [L24] COND FALSE !(i<=n) VAL [i=5, n=-10, n=4] [L28] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 74 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=6, InterpolantAutomatonStates: 48, 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, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 1017 SizeOfPredicates, 6 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 11/55 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-27 10:19:46,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...