/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/sum04-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:19:56,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:19:56,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:19:56,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:19:56,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:19:56,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:19:56,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:19:56,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:19:56,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:19:56,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:19:56,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:19:56,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:19:56,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:19:56,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:19:56,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:19:56,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:19:56,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:19:56,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:19:56,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:19:56,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:19:56,881 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:19:56,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:19:56,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:19:56,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:19:56,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:19:56,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:19:56,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:19:56,890 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:19:56,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:19:56,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:19:56,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:19:56,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:19:56,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:19:56,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:19:56,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:19:56,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:19:56,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:19:56,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:19:56,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:19:56,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:19:56,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:19:56,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:19:56,898 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:56,932 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:19:56,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:19:56,932 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:19:56,932 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:19:56,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:19:56,933 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:19:56,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:19:56,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:19:56,934 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:19:56,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:19:56,935 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:19:56,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:19:56,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:19:56,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:19:56,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:19:56,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:19:56,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:19:56,936 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:19:56,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:19:56,937 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:19:56,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:19:56,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:19:56,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:19:56,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:19:56,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:19:56,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:19:56,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:19:56,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:19:56,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:19:56,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:19:56,938 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:19:56,938 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:19:56,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:19:56,938 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:57,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:19:57,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:19:57,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:19:57,180 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:19:57,180 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:19:57,181 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-2.i [2022-04-27 10:19:57,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1818c3f38/fc5c7d7f3ed54219a46cb9b21d334fa4/FLAGf5b953837 [2022-04-27 10:19:57,604 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:19:57,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2022-04-27 10:19:57,610 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1818c3f38/fc5c7d7f3ed54219a46cb9b21d334fa4/FLAGf5b953837 [2022-04-27 10:19:58,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1818c3f38/fc5c7d7f3ed54219a46cb9b21d334fa4 [2022-04-27 10:19:58,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:19:58,021 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:19:58,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:19:58,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:19:58,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:19:58,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:19:58" (1/1) ... [2022-04-27 10:19:58,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50cd24d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:58, skipping insertion in model container [2022-04-27 10:19:58,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:19:58" (1/1) ... [2022-04-27 10:19:58,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:19:58,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:19:58,244 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/sum04-2.i[808,821] [2022-04-27 10:19:58,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:19:58,267 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:19:58,278 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/sum04-2.i[808,821] [2022-04-27 10:19:58,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:19:58,299 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:19:58,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:58 WrapperNode [2022-04-27 10:19:58,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:19:58,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:19:58,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:19:58,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:19:58,309 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:58" (1/1) ... [2022-04-27 10:19:58,310 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:58" (1/1) ... [2022-04-27 10:19:58,315 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:58" (1/1) ... [2022-04-27 10:19:58,316 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:58" (1/1) ... [2022-04-27 10:19:58,322 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:58" (1/1) ... [2022-04-27 10:19:58,325 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:58" (1/1) ... [2022-04-27 10:19:58,329 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:58" (1/1) ... [2022-04-27 10:19:58,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:19:58,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:19:58,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:19:58,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:19:58,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:58" (1/1) ... [2022-04-27 10:19:58,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:19:58,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:58,360 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:58,387 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:58,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:19:58,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:19:58,408 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:19:58,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:19:58,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:19:58,410 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:19:58,410 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:19:58,411 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:19:58,411 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:19:58,411 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:19:58,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:19:58,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:19:58,411 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:19:58,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:19:58,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:19:58,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:19:58,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:19:58,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:19:58,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:19:58,470 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:19:58,471 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:19:58,607 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:19:58,613 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:19:58,613 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:19:58,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:19:58 BoogieIcfgContainer [2022-04-27 10:19:58,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:19:58,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:19:58,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:19:58,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:19:58,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:19:58" (1/3) ... [2022-04-27 10:19:58,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29224f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:19:58, skipping insertion in model container [2022-04-27 10:19:58,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:58" (2/3) ... [2022-04-27 10:19:58,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29224f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:19:58, skipping insertion in model container [2022-04-27 10:19:58,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:19:58" (3/3) ... [2022-04-27 10:19:58,622 INFO L111 eAbstractionObserver]: Analyzing ICFG sum04-2.i [2022-04-27 10:19:58,632 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:19:58,633 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:19:58,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:19:58,673 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@2467f626, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@66f1bdb [2022-04-27 10:19:58,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:19:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:19:58,687 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:58,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:58,688 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:58,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:58,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1274873075, now seen corresponding path program 1 times [2022-04-27 10:19:58,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:58,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985764674] [2022-04-27 10:19:58,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:58,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:58,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:58,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(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(10, 2); {22#true} is VALID [2022-04-27 10:19:58,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-27 10:19:58,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-27 10:19:58,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:58,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(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(10, 2); {22#true} is VALID [2022-04-27 10:19:58,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-27 10:19:58,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-27 10:19:58,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2022-04-27 10:19:58,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {22#true} is VALID [2022-04-27 10:19:58,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-27 10:19:58,861 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {23#false} is VALID [2022-04-27 10:19:58,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-27 10:19:58,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-27 10:19:58,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-27 10:19:58,862 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:58,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:58,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985764674] [2022-04-27 10:19:58,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985764674] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:58,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:58,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:19:58,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587891538] [2022-04-27 10:19:58,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:58,870 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:58,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:58,874 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:58,888 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:58,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:19:58,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:58,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:19:58,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:19:58,909 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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:58,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:58,963 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-27 10:19:58,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:19:58,963 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:58,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:58,965 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:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-27 10:19:58,977 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:58,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-27 10:19:58,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-04-27 10:19:59,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:59,032 INFO L225 Difference]: With dead ends: 30 [2022-04-27 10:19:59,032 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 10:19:59,034 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:59,037 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 21 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:59,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 21 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:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 10:19:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 10:19:59,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:59,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:59,062 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:59,063 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:59,065 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:19:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:19:59,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:59,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:59,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-27 10:19:59,066 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-27 10:19:59,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:59,069 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:19:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:19:59,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:59,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:59,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:59,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 10:19:59,072 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 10:19:59,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:59,073 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 10:19:59,073 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:59,073 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:19:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:19:59,073 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:59,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:59,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:19:59,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:59,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:59,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1280414201, now seen corresponding path program 1 times [2022-04-27 10:19:59,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:59,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675661894] [2022-04-27 10:19:59,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:59,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:59,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:59,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {121#(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(10, 2); {115#true} is VALID [2022-04-27 10:19:59,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#true} assume true; {115#true} is VALID [2022-04-27 10:19:59,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115#true} {115#true} #42#return; {115#true} is VALID [2022-04-27 10:19:59,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {115#true} call ULTIMATE.init(); {121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:59,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#(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(10, 2); {115#true} is VALID [2022-04-27 10:19:59,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {115#true} assume true; {115#true} is VALID [2022-04-27 10:19:59,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115#true} {115#true} #42#return; {115#true} is VALID [2022-04-27 10:19:59,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {115#true} call #t~ret2 := main(); {115#true} is VALID [2022-04-27 10:19:59,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {115#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {120#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-27 10:19:59,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {120#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 <= 8); {116#false} is VALID [2022-04-27 10:19:59,142 INFO L272 TraceCheckUtils]: 7: Hoare triple {116#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {116#false} is VALID [2022-04-27 10:19:59,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {116#false} ~cond := #in~cond; {116#false} is VALID [2022-04-27 10:19:59,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {116#false} assume 0 == ~cond; {116#false} is VALID [2022-04-27 10:19:59,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {116#false} assume !false; {116#false} is VALID [2022-04-27 10:19:59,143 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:59,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:59,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675661894] [2022-04-27 10:19:59,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675661894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:59,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:59,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:19:59,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713532309] [2022-04-27 10:19:59,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:59,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:59,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:59,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:59,156 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:59,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:19:59,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:59,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:19:59,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:19:59,157 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:59,204 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 10:19:59,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:19:59,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:59,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-27 10:19:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-27 10:19:59,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2022-04-27 10:19:59,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:59,230 INFO L225 Difference]: With dead ends: 20 [2022-04-27 10:19:59,230 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 10:19:59,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:59,232 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:59,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 18 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:19:59,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 10:19:59,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-27 10:19:59,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:59,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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:59,237 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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:59,237 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:59,238 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 10:19:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:19:59,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:59,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:59,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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:59,239 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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:59,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:59,241 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 10:19:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:19:59,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:59,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:59,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:59,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 10:19:59,243 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2022-04-27 10:19:59,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:59,243 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 10:19:59,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 10:19:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:19:59,244 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:59,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:59,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:19:59,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:59,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:59,245 INFO L85 PathProgramCache]: Analyzing trace with hash -985852763, now seen corresponding path program 1 times [2022-04-27 10:19:59,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:59,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015747276] [2022-04-27 10:19:59,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:59,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:59,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:59,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#(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(10, 2); {208#true} is VALID [2022-04-27 10:19:59,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} assume true; {208#true} is VALID [2022-04-27 10:19:59,323 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208#true} {208#true} #42#return; {208#true} is VALID [2022-04-27 10:19:59,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:59,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#(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(10, 2); {208#true} is VALID [2022-04-27 10:19:59,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} assume true; {208#true} is VALID [2022-04-27 10:19:59,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} #42#return; {208#true} is VALID [2022-04-27 10:19:59,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} call #t~ret2 := main(); {208#true} is VALID [2022-04-27 10:19:59,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {213#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-27 10:19:59,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {213#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-27 10:19:59,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {214#(<= main_~i~0 2)} is VALID [2022-04-27 10:19:59,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(<= main_~i~0 2)} assume !(~i~0 <= 8); {209#false} is VALID [2022-04-27 10:19:59,334 INFO L272 TraceCheckUtils]: 9: Hoare triple {209#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {209#false} is VALID [2022-04-27 10:19:59,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {209#false} ~cond := #in~cond; {209#false} is VALID [2022-04-27 10:19:59,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#false} assume 0 == ~cond; {209#false} is VALID [2022-04-27 10:19:59,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} assume !false; {209#false} is VALID [2022-04-27 10:19:59,335 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:59,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:59,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015747276] [2022-04-27 10:19:59,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015747276] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:19:59,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513486703] [2022-04-27 10:19:59,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:59,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:59,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:59,343 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:59,363 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:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:59,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 10:19:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:59,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:19:59,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {208#true} is VALID [2022-04-27 10:19:59,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#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(10, 2); {208#true} is VALID [2022-04-27 10:19:59,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} assume true; {208#true} is VALID [2022-04-27 10:19:59,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} #42#return; {208#true} is VALID [2022-04-27 10:19:59,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} call #t~ret2 := main(); {208#true} is VALID [2022-04-27 10:19:59,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {234#(<= main_~i~0 1)} is VALID [2022-04-27 10:19:59,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {234#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {234#(<= main_~i~0 1)} is VALID [2022-04-27 10:19:59,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {214#(<= main_~i~0 2)} is VALID [2022-04-27 10:19:59,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(<= main_~i~0 2)} assume !(~i~0 <= 8); {209#false} is VALID [2022-04-27 10:19:59,525 INFO L272 TraceCheckUtils]: 9: Hoare triple {209#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {209#false} is VALID [2022-04-27 10:19:59,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {209#false} ~cond := #in~cond; {209#false} is VALID [2022-04-27 10:19:59,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#false} assume 0 == ~cond; {209#false} is VALID [2022-04-27 10:19:59,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} assume !false; {209#false} is VALID [2022-04-27 10:19:59,526 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:59,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:19:59,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} assume !false; {209#false} is VALID [2022-04-27 10:19:59,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#false} assume 0 == ~cond; {209#false} is VALID [2022-04-27 10:19:59,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {209#false} ~cond := #in~cond; {209#false} is VALID [2022-04-27 10:19:59,614 INFO L272 TraceCheckUtils]: 9: Hoare triple {209#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {209#false} is VALID [2022-04-27 10:19:59,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {268#(<= main_~i~0 8)} assume !(~i~0 <= 8); {209#false} is VALID [2022-04-27 10:19:59,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {272#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {268#(<= main_~i~0 8)} is VALID [2022-04-27 10:19:59,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {272#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {272#(<= main_~i~0 7)} is VALID [2022-04-27 10:19:59,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {272#(<= main_~i~0 7)} is VALID [2022-04-27 10:19:59,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} call #t~ret2 := main(); {208#true} is VALID [2022-04-27 10:19:59,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} #42#return; {208#true} is VALID [2022-04-27 10:19:59,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} assume true; {208#true} is VALID [2022-04-27 10:19:59,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#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(10, 2); {208#true} is VALID [2022-04-27 10:19:59,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {208#true} is VALID [2022-04-27 10:19:59,618 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:59,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513486703] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:19:59,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:19:59,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 10:19:59,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021455684] [2022-04-27 10:19:59,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:19:59,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 13 [2022-04-27 10:19:59,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:59,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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:59,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:59,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:19:59,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:59,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:19:59,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:19:59,646 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:59,770 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 10:19:59,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:19:59,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 13 [2022-04-27 10:19:59,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-27 10:19:59,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-27 10:19:59,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-27 10:19:59,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:59,806 INFO L225 Difference]: With dead ends: 25 [2022-04-27 10:19:59,806 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 10:19:59,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:19:59,808 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:59,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 23 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:19:59,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 10:19:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 10:19:59,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:59,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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:59,815 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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:59,815 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:59,818 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 10:19:59,818 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-27 10:19:59,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:59,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:59,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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 20 states. [2022-04-27 10:19:59,820 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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 20 states. [2022-04-27 10:19:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:59,823 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 10:19:59,823 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-27 10:19:59,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:59,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:59,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:59,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-27 10:19:59,826 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 13 [2022-04-27 10:19:59,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:59,826 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-27 10:19:59,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-27 10:19:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 10:19:59,827 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:59,827 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:59,853 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:20:00,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:20:00,050 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:20:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:20:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1815254145, now seen corresponding path program 2 times [2022-04-27 10:20:00,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:20:00,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716014937] [2022-04-27 10:20:00,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:20:00,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:20:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:00,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:20:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:00,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {423#(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(10, 2); {413#true} is VALID [2022-04-27 10:20:00,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#true} assume true; {413#true} is VALID [2022-04-27 10:20:00,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {413#true} {413#true} #42#return; {413#true} is VALID [2022-04-27 10:20:00,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {413#true} call ULTIMATE.init(); {423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:20:00,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#(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(10, 2); {413#true} is VALID [2022-04-27 10:20:00,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#true} assume true; {413#true} is VALID [2022-04-27 10:20:00,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} #42#return; {413#true} is VALID [2022-04-27 10:20:00,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#true} call #t~ret2 := main(); {413#true} is VALID [2022-04-27 10:20:00,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {418#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-27 10:20:00,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {418#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {418#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-27 10:20:00,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {419#(<= main_~i~0 2)} is VALID [2022-04-27 10:20:00,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {419#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {419#(<= main_~i~0 2)} is VALID [2022-04-27 10:20:00,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {420#(<= main_~i~0 3)} is VALID [2022-04-27 10:20:00,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {420#(<= main_~i~0 3)} is VALID [2022-04-27 10:20:00,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {421#(<= main_~i~0 4)} is VALID [2022-04-27 10:20:00,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {421#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {421#(<= main_~i~0 4)} is VALID [2022-04-27 10:20:00,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {421#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {422#(<= main_~i~0 5)} is VALID [2022-04-27 10:20:00,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {422#(<= main_~i~0 5)} assume !(~i~0 <= 8); {414#false} is VALID [2022-04-27 10:20:00,162 INFO L272 TraceCheckUtils]: 15: Hoare triple {414#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {414#false} is VALID [2022-04-27 10:20:00,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {414#false} ~cond := #in~cond; {414#false} is VALID [2022-04-27 10:20:00,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {414#false} assume 0 == ~cond; {414#false} is VALID [2022-04-27 10:20:00,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {414#false} assume !false; {414#false} is VALID [2022-04-27 10:20:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:20:00,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:20:00,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716014937] [2022-04-27 10:20:00,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716014937] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:20:00,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505130607] [2022-04-27 10:20:00,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:20:00,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:20:00,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:20:00,165 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:20:00,192 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:20:00,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:20:00,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:20:00,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:20:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:00,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:20:00,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {413#true} call ULTIMATE.init(); {413#true} is VALID [2022-04-27 10:20:00,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#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(10, 2); {413#true} is VALID [2022-04-27 10:20:00,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#true} assume true; {413#true} is VALID [2022-04-27 10:20:00,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} #42#return; {413#true} is VALID [2022-04-27 10:20:00,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#true} call #t~ret2 := main(); {413#true} is VALID [2022-04-27 10:20:00,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {442#(<= main_~i~0 1)} is VALID [2022-04-27 10:20:00,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {442#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {442#(<= main_~i~0 1)} is VALID [2022-04-27 10:20:00,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {442#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {419#(<= main_~i~0 2)} is VALID [2022-04-27 10:20:00,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {419#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {419#(<= main_~i~0 2)} is VALID [2022-04-27 10:20:00,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {420#(<= main_~i~0 3)} is VALID [2022-04-27 10:20:00,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {420#(<= main_~i~0 3)} is VALID [2022-04-27 10:20:00,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {421#(<= main_~i~0 4)} is VALID [2022-04-27 10:20:00,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {421#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {421#(<= main_~i~0 4)} is VALID [2022-04-27 10:20:00,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {421#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {422#(<= main_~i~0 5)} is VALID [2022-04-27 10:20:00,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {422#(<= main_~i~0 5)} assume !(~i~0 <= 8); {414#false} is VALID [2022-04-27 10:20:00,377 INFO L272 TraceCheckUtils]: 15: Hoare triple {414#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {414#false} is VALID [2022-04-27 10:20:00,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {414#false} ~cond := #in~cond; {414#false} is VALID [2022-04-27 10:20:00,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {414#false} assume 0 == ~cond; {414#false} is VALID [2022-04-27 10:20:00,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {414#false} assume !false; {414#false} is VALID [2022-04-27 10:20:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:20:00,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:20:00,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {414#false} assume !false; {414#false} is VALID [2022-04-27 10:20:00,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {414#false} assume 0 == ~cond; {414#false} is VALID [2022-04-27 10:20:00,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {414#false} ~cond := #in~cond; {414#false} is VALID [2022-04-27 10:20:00,540 INFO L272 TraceCheckUtils]: 15: Hoare triple {414#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {414#false} is VALID [2022-04-27 10:20:00,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {494#(<= main_~i~0 8)} assume !(~i~0 <= 8); {414#false} is VALID [2022-04-27 10:20:00,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {498#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {494#(<= main_~i~0 8)} is VALID [2022-04-27 10:20:00,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {498#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {498#(<= main_~i~0 7)} is VALID [2022-04-27 10:20:00,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {505#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {498#(<= main_~i~0 7)} is VALID [2022-04-27 10:20:00,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {505#(<= main_~i~0 6)} is VALID [2022-04-27 10:20:00,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {505#(<= main_~i~0 6)} is VALID [2022-04-27 10:20:00,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {422#(<= main_~i~0 5)} is VALID [2022-04-27 10:20:00,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {422#(<= main_~i~0 5)} is VALID [2022-04-27 10:20:00,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {421#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {421#(<= main_~i~0 4)} is VALID [2022-04-27 10:20:00,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {421#(<= main_~i~0 4)} is VALID [2022-04-27 10:20:00,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#true} call #t~ret2 := main(); {413#true} is VALID [2022-04-27 10:20:00,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} #42#return; {413#true} is VALID [2022-04-27 10:20:00,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#true} assume true; {413#true} is VALID [2022-04-27 10:20:00,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#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(10, 2); {413#true} is VALID [2022-04-27 10:20:00,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {413#true} call ULTIMATE.init(); {413#true} is VALID [2022-04-27 10:20:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:20:00,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505130607] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:20:00,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:20:00,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-27 10:20:00,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278360520] [2022-04-27 10:20:00,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:20:00,558 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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 19 [2022-04-27 10:20:00,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:20:00,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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:20:00,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:20:00,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:20:00,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:20:00,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:20:00,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:20:00,594 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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:20:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:00,818 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 10:20:00,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 10:20:00,818 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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 19 [2022-04-27 10:20:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:20:00,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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:20:00,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-27 10:20:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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:20:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-27 10:20:00,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 36 transitions. [2022-04-27 10:20:00,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:20:00,861 INFO L225 Difference]: With dead ends: 33 [2022-04-27 10:20:00,861 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 10:20:00,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2022-04-27 10:20:00,863 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:20:00,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:20:00,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 10:20:00,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-27 10:20:00,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:20:00,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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:20:00,872 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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:20:00,873 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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:20:00,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:00,874 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-27 10:20:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-27 10:20:00,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:00,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:20:00,875 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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:20:00,875 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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:20:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:00,876 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-27 10:20:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-27 10:20:00,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:00,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:20:00,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:20:00,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:20:00,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 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:20:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-27 10:20:00,879 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2022-04-27 10:20:00,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:20:00,879 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-27 10:20:00,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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:20:00,879 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-27 10:20:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 10:20:00,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:20:00,880 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:20:00,906 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:20:01,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 10:20:01,092 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:20:01,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:20:01,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1749847817, now seen corresponding path program 3 times [2022-04-27 10:20:01,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:20:01,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496884496] [2022-04-27 10:20:01,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:20:01,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:20:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:01,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:20:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:01,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {722#(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(10, 2); {706#true} is VALID [2022-04-27 10:20:01,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {706#true} assume true; {706#true} is VALID [2022-04-27 10:20:01,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {706#true} {706#true} #42#return; {706#true} is VALID [2022-04-27 10:20:01,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {706#true} call ULTIMATE.init(); {722#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:20:01,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {722#(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(10, 2); {706#true} is VALID [2022-04-27 10:20:01,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {706#true} assume true; {706#true} is VALID [2022-04-27 10:20:01,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {706#true} {706#true} #42#return; {706#true} is VALID [2022-04-27 10:20:01,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {706#true} call #t~ret2 := main(); {706#true} is VALID [2022-04-27 10:20:01,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {706#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {711#(= main_~sn~0 0)} is VALID [2022-04-27 10:20:01,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {711#(= main_~sn~0 0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {712#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:20:01,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {712#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:20:01,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {713#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-27 10:20:01,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {713#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {713#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-27 10:20:01,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {713#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {714#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2022-04-27 10:20:01,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {714#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {714#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2022-04-27 10:20:01,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {714#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {715#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2022-04-27 10:20:01,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {715#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2022-04-27 10:20:01,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {716#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2022-04-27 10:20:01,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {716#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {716#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2022-04-27 10:20:01,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {716#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {717#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2022-04-27 10:20:01,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {717#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {717#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2022-04-27 10:20:01,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {717#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {718#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2022-04-27 10:20:01,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {718#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {718#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2022-04-27 10:20:01,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {718#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-27 10:20:01,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-27 10:20:01,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} assume !(~i~0 <= 8); {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-27 10:20:01,342 INFO L272 TraceCheckUtils]: 23: Hoare triple {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {720#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:20:01,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {720#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {721#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:20:01,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {721#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {707#false} is VALID [2022-04-27 10:20:01,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {707#false} assume !false; {707#false} is VALID [2022-04-27 10:20:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:20:01,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:20:01,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496884496] [2022-04-27 10:20:01,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496884496] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:20:01,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017828500] [2022-04-27 10:20:01,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:20:01,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:20:01,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:20:01,351 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:20:01,357 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:20:01,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-04-27 10:20:01,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:20:01,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 10:20:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:01,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:20:01,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {706#true} call ULTIMATE.init(); {706#true} is VALID [2022-04-27 10:20:01,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {706#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(10, 2); {706#true} is VALID [2022-04-27 10:20:01,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {706#true} assume true; {706#true} is VALID [2022-04-27 10:20:01,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {706#true} {706#true} #42#return; {706#true} is VALID [2022-04-27 10:20:01,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {706#true} call #t~ret2 := main(); {706#true} is VALID [2022-04-27 10:20:01,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {706#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {711#(= main_~sn~0 0)} is VALID [2022-04-27 10:20:01,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {711#(= main_~sn~0 0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {712#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:20:01,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {712#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:20:01,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {713#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-27 10:20:01,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {713#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {713#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-27 10:20:01,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {713#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {714#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2022-04-27 10:20:01,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {714#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {714#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2022-04-27 10:20:01,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {714#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {715#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2022-04-27 10:20:01,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {715#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2022-04-27 10:20:01,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {716#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2022-04-27 10:20:01,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {716#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {716#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2022-04-27 10:20:01,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {716#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {717#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2022-04-27 10:20:01,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {717#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {717#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2022-04-27 10:20:01,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {717#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {718#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2022-04-27 10:20:01,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {718#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {718#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2022-04-27 10:20:01,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {718#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-27 10:20:01,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-27 10:20:01,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} assume !(~i~0 <= 8); {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-27 10:20:01,834 INFO L272 TraceCheckUtils]: 23: Hoare triple {719#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {795#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:20:01,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {799#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:20:01,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {799#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {707#false} is VALID [2022-04-27 10:20:01,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {707#false} assume !false; {707#false} is VALID [2022-04-27 10:20:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:20:01,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:20:02,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {707#false} assume !false; {707#false} is VALID [2022-04-27 10:20:02,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {799#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {707#false} is VALID [2022-04-27 10:20:02,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {799#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:20:02,179 INFO L272 TraceCheckUtils]: 23: Hoare triple {815#(or (= main_~sn~0 0) (= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {795#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:20:02,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {815#(or (= main_~sn~0 0) (= 16 main_~sn~0))} assume !(~i~0 <= 8); {815#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-27 10:20:02,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {815#(or (= main_~sn~0 0) (= 16 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {815#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-27 10:20:02,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {825#(or (= (+ 2 main_~sn~0) 16) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {815#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-27 10:20:02,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {825#(or (= (+ 2 main_~sn~0) 16) (= (+ 2 main_~sn~0) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {825#(or (= (+ 2 main_~sn~0) 16) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:20:02,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {832#(or (= (+ main_~sn~0 4) 16) (= (+ main_~sn~0 4) 0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {825#(or (= (+ 2 main_~sn~0) 16) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:20:02,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {832#(or (= (+ main_~sn~0 4) 16) (= (+ main_~sn~0 4) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {832#(or (= (+ main_~sn~0 4) 16) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-27 10:20:02,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {839#(or (= (+ 6 main_~sn~0) 16) (= (+ 6 main_~sn~0) 0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {832#(or (= (+ main_~sn~0 4) 16) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-27 10:20:02,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {839#(or (= (+ 6 main_~sn~0) 16) (= (+ 6 main_~sn~0) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {839#(or (= (+ 6 main_~sn~0) 16) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-27 10:20:02,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {846#(or (= (+ main_~sn~0 8) 0) (= (+ main_~sn~0 8) 16))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {839#(or (= (+ 6 main_~sn~0) 16) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-27 10:20:02,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {846#(or (= (+ main_~sn~0 8) 0) (= (+ main_~sn~0 8) 16))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {846#(or (= (+ main_~sn~0 8) 0) (= (+ main_~sn~0 8) 16))} is VALID [2022-04-27 10:20:02,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {853#(or (= 16 (+ main_~sn~0 10)) (= (+ main_~sn~0 10) 0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {846#(or (= (+ main_~sn~0 8) 0) (= (+ main_~sn~0 8) 16))} is VALID [2022-04-27 10:20:02,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {853#(or (= 16 (+ main_~sn~0 10)) (= (+ main_~sn~0 10) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {853#(or (= 16 (+ main_~sn~0 10)) (= (+ main_~sn~0 10) 0))} is VALID [2022-04-27 10:20:02,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#(or (= (+ main_~sn~0 12) 16) (= (+ main_~sn~0 12) 0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {853#(or (= 16 (+ main_~sn~0 10)) (= (+ main_~sn~0 10) 0))} is VALID [2022-04-27 10:20:02,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {860#(or (= (+ main_~sn~0 12) 16) (= (+ main_~sn~0 12) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {860#(or (= (+ main_~sn~0 12) 16) (= (+ main_~sn~0 12) 0))} is VALID [2022-04-27 10:20:02,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {867#(or (= (+ 14 main_~sn~0) 16) (= (+ 14 main_~sn~0) 0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {860#(or (= (+ main_~sn~0 12) 16) (= (+ main_~sn~0 12) 0))} is VALID [2022-04-27 10:20:02,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {867#(or (= (+ 14 main_~sn~0) 16) (= (+ 14 main_~sn~0) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {867#(or (= (+ 14 main_~sn~0) 16) (= (+ 14 main_~sn~0) 0))} is VALID [2022-04-27 10:20:02,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {874#(or (= (+ 16 main_~sn~0) 0) (= 16 (+ 16 main_~sn~0)))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {867#(or (= (+ 14 main_~sn~0) 16) (= (+ 14 main_~sn~0) 0))} is VALID [2022-04-27 10:20:02,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {706#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {874#(or (= (+ 16 main_~sn~0) 0) (= 16 (+ 16 main_~sn~0)))} is VALID [2022-04-27 10:20:02,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {706#true} call #t~ret2 := main(); {706#true} is VALID [2022-04-27 10:20:02,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {706#true} {706#true} #42#return; {706#true} is VALID [2022-04-27 10:20:02,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {706#true} assume true; {706#true} is VALID [2022-04-27 10:20:02,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {706#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(10, 2); {706#true} is VALID [2022-04-27 10:20:02,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {706#true} call ULTIMATE.init(); {706#true} is VALID [2022-04-27 10:20:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:20:02,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017828500] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:20:02,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:20:02,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 25 [2022-04-27 10:20:02,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280458294] [2022-04-27 10:20:02,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:20:02,194 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 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 27 [2022-04-27 10:20:02,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:20:02,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 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:20:02,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:20:02,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 10:20:02,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:20:02,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 10:20:02,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2022-04-27 10:20:02,240 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 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:20:03,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:03,092 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-27 10:20:03,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 10:20:03,093 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 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 27 [2022-04-27 10:20:03,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:20:03,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 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:20:03,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2022-04-27 10:20:03,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 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:20:03,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2022-04-27 10:20:03,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 35 transitions. [2022-04-27 10:20:03,128 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:20:03,129 INFO L225 Difference]: With dead ends: 35 [2022-04-27 10:20:03,129 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 10:20:03,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=1142, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 10:20:03,130 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:20:03,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 105 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:20:03,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 10:20:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 10:20:03,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:20:03,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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:20:03,150 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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:20:03,150 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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:20:03,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:03,153 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-27 10:20:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-27 10:20:03,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:03,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:20:03,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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 30 states. [2022-04-27 10:20:03,158 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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 30 states. [2022-04-27 10:20:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:03,159 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-27 10:20:03,159 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-27 10:20:03,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:03,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:20:03,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:20:03,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:20:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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:20:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-27 10:20:03,163 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2022-04-27 10:20:03,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:20:03,164 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-27 10:20:03,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 22 states have internal predecessors, (44), 3 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:20:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-27 10:20:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 10:20:03,165 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:20:03,165 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:20:03,190 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:20:03,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:20:03,384 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:20:03,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:20:03,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1139991659, now seen corresponding path program 4 times [2022-04-27 10:20:03,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:20:03,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759950411] [2022-04-27 10:20:03,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:20:03,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:20:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:03,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:20:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:03,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {1090#(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(10, 2); {1076#true} is VALID [2022-04-27 10:20:03,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-27 10:20:03,499 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1076#true} {1076#true} #42#return; {1076#true} is VALID [2022-04-27 10:20:03,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {1076#true} call ULTIMATE.init(); {1090#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:20:03,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#(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(10, 2); {1076#true} is VALID [2022-04-27 10:20:03,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-27 10:20:03,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1076#true} {1076#true} #42#return; {1076#true} is VALID [2022-04-27 10:20:03,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {1076#true} call #t~ret2 := main(); {1076#true} is VALID [2022-04-27 10:20:03,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {1076#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1081#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-27 10:20:03,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {1081#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1081#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-27 10:20:03,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {1081#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1082#(<= 2 main_~i~0)} is VALID [2022-04-27 10:20:03,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {1082#(<= 2 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1082#(<= 2 main_~i~0)} is VALID [2022-04-27 10:20:03,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {1082#(<= 2 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1083#(<= 3 main_~i~0)} is VALID [2022-04-27 10:20:03,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {1083#(<= 3 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1083#(<= 3 main_~i~0)} is VALID [2022-04-27 10:20:03,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {1083#(<= 3 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1084#(<= 4 main_~i~0)} is VALID [2022-04-27 10:20:03,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {1084#(<= 4 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1084#(<= 4 main_~i~0)} is VALID [2022-04-27 10:20:03,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {1084#(<= 4 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1085#(<= 5 main_~i~0)} is VALID [2022-04-27 10:20:03,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {1085#(<= 5 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1085#(<= 5 main_~i~0)} is VALID [2022-04-27 10:20:03,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {1085#(<= 5 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1086#(<= 6 main_~i~0)} is VALID [2022-04-27 10:20:03,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {1086#(<= 6 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1086#(<= 6 main_~i~0)} is VALID [2022-04-27 10:20:03,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {1086#(<= 6 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1087#(<= 7 main_~i~0)} is VALID [2022-04-27 10:20:03,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {1087#(<= 7 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1087#(<= 7 main_~i~0)} is VALID [2022-04-27 10:20:03,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {1087#(<= 7 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1088#(<= 8 main_~i~0)} is VALID [2022-04-27 10:20:03,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {1088#(<= 8 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1088#(<= 8 main_~i~0)} is VALID [2022-04-27 10:20:03,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {1088#(<= 8 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1089#(<= 9 main_~i~0)} is VALID [2022-04-27 10:20:03,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {1089#(<= 9 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1077#false} is VALID [2022-04-27 10:20:03,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {1077#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1077#false} is VALID [2022-04-27 10:20:03,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {1077#false} assume !(~i~0 <= 8); {1077#false} is VALID [2022-04-27 10:20:03,509 INFO L272 TraceCheckUtils]: 25: Hoare triple {1077#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1077#false} is VALID [2022-04-27 10:20:03,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {1077#false} ~cond := #in~cond; {1077#false} is VALID [2022-04-27 10:20:03,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {1077#false} assume 0 == ~cond; {1077#false} is VALID [2022-04-27 10:20:03,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {1077#false} assume !false; {1077#false} is VALID [2022-04-27 10:20:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 66 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:20:03,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:20:03,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759950411] [2022-04-27 10:20:03,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759950411] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:20:03,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473334526] [2022-04-27 10:20:03,510 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:20:03,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:20:03,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:20:03,512 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:20:03,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 10:20:03,546 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:20:03,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:20:03,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 10:20:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:03,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:20:03,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {1076#true} call ULTIMATE.init(); {1076#true} is VALID [2022-04-27 10:20:03,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#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(10, 2); {1076#true} is VALID [2022-04-27 10:20:03,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-04-27 10:20:03,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1076#true} {1076#true} #42#return; {1076#true} is VALID [2022-04-27 10:20:03,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {1076#true} call #t~ret2 := main(); {1076#true} is VALID [2022-04-27 10:20:03,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {1076#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1109#(<= 1 main_~i~0)} is VALID [2022-04-27 10:20:03,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {1109#(<= 1 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1109#(<= 1 main_~i~0)} is VALID [2022-04-27 10:20:03,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {1109#(<= 1 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1082#(<= 2 main_~i~0)} is VALID [2022-04-27 10:20:03,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {1082#(<= 2 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1082#(<= 2 main_~i~0)} is VALID [2022-04-27 10:20:03,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {1082#(<= 2 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1083#(<= 3 main_~i~0)} is VALID [2022-04-27 10:20:03,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {1083#(<= 3 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1083#(<= 3 main_~i~0)} is VALID [2022-04-27 10:20:03,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {1083#(<= 3 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1084#(<= 4 main_~i~0)} is VALID [2022-04-27 10:20:03,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {1084#(<= 4 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1084#(<= 4 main_~i~0)} is VALID [2022-04-27 10:20:03,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {1084#(<= 4 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1085#(<= 5 main_~i~0)} is VALID [2022-04-27 10:20:03,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {1085#(<= 5 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1085#(<= 5 main_~i~0)} is VALID [2022-04-27 10:20:03,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {1085#(<= 5 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1086#(<= 6 main_~i~0)} is VALID [2022-04-27 10:20:03,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {1086#(<= 6 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1086#(<= 6 main_~i~0)} is VALID [2022-04-27 10:20:03,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {1086#(<= 6 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1087#(<= 7 main_~i~0)} is VALID [2022-04-27 10:20:03,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {1087#(<= 7 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1087#(<= 7 main_~i~0)} is VALID [2022-04-27 10:20:03,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {1087#(<= 7 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1088#(<= 8 main_~i~0)} is VALID [2022-04-27 10:20:03,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {1088#(<= 8 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1088#(<= 8 main_~i~0)} is VALID [2022-04-27 10:20:03,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {1088#(<= 8 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1089#(<= 9 main_~i~0)} is VALID [2022-04-27 10:20:03,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {1089#(<= 9 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1077#false} is VALID [2022-04-27 10:20:03,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {1077#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1077#false} is VALID [2022-04-27 10:20:03,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {1077#false} assume !(~i~0 <= 8); {1077#false} is VALID [2022-04-27 10:20:03,706 INFO L272 TraceCheckUtils]: 25: Hoare triple {1077#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1077#false} is VALID [2022-04-27 10:20:03,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {1077#false} ~cond := #in~cond; {1077#false} is VALID [2022-04-27 10:20:03,706 INFO L290 TraceCheckUtils]: 27: Hoare triple {1077#false} assume 0 == ~cond; {1077#false} is VALID [2022-04-27 10:20:03,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {1077#false} assume !false; {1077#false} is VALID [2022-04-27 10:20:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:20:03,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:20:03,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473334526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:20:03,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:20:03,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 13 [2022-04-27 10:20:03,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284970768] [2022-04-27 10:20:03,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:20:03,708 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 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 29 [2022-04-27 10:20:03,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:20:03,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 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:20:03,730 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:20:03,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 10:20:03,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:20:03,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 10:20:03,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:20:03,731 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 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:20:03,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:03,808 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-27 10:20:03,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 10:20:03,808 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 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 29 [2022-04-27 10:20:03,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:20:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 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:20:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 30 transitions. [2022-04-27 10:20:03,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 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:20:03,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 30 transitions. [2022-04-27 10:20:03,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 30 transitions. [2022-04-27 10:20:03,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:20:03,837 INFO L225 Difference]: With dead ends: 30 [2022-04-27 10:20:03,838 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:20:03,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:20:03,839 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:20:03,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:20:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:20:03,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:20:03,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:20:03,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:20:03,840 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:20:03,840 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:20:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:03,840 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:20:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:20:03,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:03,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:20:03,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:20:03,841 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:20:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:03,841 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:20:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:20:03,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:03,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:20:03,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:20:03,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:20:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:20:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:20:03,842 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-04-27 10:20:03,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:20:03,842 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:20:03,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 2 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:20:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:20:03,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:03,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:20:03,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 10:20:04,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:20:04,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:20:04,180 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:20:04,180 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:20:04,180 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:20:04,180 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 28) the Hoare annotation is: true [2022-04-27 10:20:04,180 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 22 28) no Hoare annotation was computed. [2022-04-27 10:20:04,180 INFO L899 garLoopResultBuilder]: For program point L24-2(lines 24 26) no Hoare annotation was computed. [2022-04-27 10:20:04,181 INFO L895 garLoopResultBuilder]: At program point L24-3(lines 24 26) the Hoare annotation is: (or (and (<= main_~sn~0 16) (<= 9 main_~i~0) (< 15 main_~sn~0)) (and (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= main_~i~0 4) (<= 4 main_~i~0)) (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 7) (<= 12 main_~sn~0) (<= main_~sn~0 12) (<= 7 main_~i~0)) (and (<= 14 main_~sn~0) (<= 8 main_~i~0) (<= main_~i~0 8) (<= main_~sn~0 14)) (and (<= main_~sn~0 10) (<= 10 main_~sn~0) (<= main_~i~0 6) (<= 6 main_~i~0)) (and (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= 3 main_~i~0) (<= main_~i~0 3)) (and (<= 2 main_~i~0) (<= main_~sn~0 2) (<= main_~i~0 2) (<= 2 main_~sn~0)) (and (<= main_~i~0 5) (<= 8 main_~sn~0) (<= 5 main_~i~0) (<= main_~sn~0 8))) [2022-04-27 10:20:04,181 INFO L895 garLoopResultBuilder]: At program point L24-4(lines 24 26) the Hoare annotation is: (and (<= main_~sn~0 16) (< 15 main_~sn~0)) [2022-04-27 10:20:04,181 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 22 28) no Hoare annotation was computed. [2022-04-27 10:20:04,181 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:20:04,181 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:20:04,181 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:20:04,181 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:20:04,181 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:20:04,181 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:20:04,181 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:20:04,182 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 10:20:04,182 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-27 10:20:04,182 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-04-27 10:20:04,182 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 19) no Hoare annotation was computed. [2022-04-27 10:20:04,182 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 19) no Hoare annotation was computed. [2022-04-27 10:20:04,182 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-27 10:20:04,185 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-04-27 10:20:04,186 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:20:04,189 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:20:04,189 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:20:04,189 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:20:04,190 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:20:04,190 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:20:04,190 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:20:04,190 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:20:04,205 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-27 10:20:04,205 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:20:04,205 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:20:04,205 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:20:04,205 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:20:04,205 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:20:04,205 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-27 10:20:04,205 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 10:20:04,205 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 10:20:04,205 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:20:04,205 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:20:04,205 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:20:04,205 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:20:04,205 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:20:04,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:20:04 BoogieIcfgContainer [2022-04-27 10:20:04,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:20:04,215 INFO L158 Benchmark]: Toolchain (without parser) took 6193.23ms. Allocated memory was 183.5MB in the beginning and 249.6MB in the end (delta: 66.1MB). Free memory was 125.9MB in the beginning and 89.5MB in the end (delta: 36.4MB). Peak memory consumption was 103.0MB. Max. memory is 8.0GB. [2022-04-27 10:20:04,215 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 183.5MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:20:04,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.80ms. Allocated memory was 183.5MB in the beginning and 249.6MB in the end (delta: 66.1MB). Free memory was 125.7MB in the beginning and 220.0MB in the end (delta: -94.4MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2022-04-27 10:20:04,215 INFO L158 Benchmark]: Boogie Preprocessor took 31.10ms. Allocated memory is still 249.6MB. Free memory was 220.0MB in the beginning and 219.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:20:04,216 INFO L158 Benchmark]: RCFGBuilder took 282.06ms. Allocated memory is still 249.6MB. Free memory was 218.5MB in the beginning and 207.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 10:20:04,216 INFO L158 Benchmark]: TraceAbstraction took 5597.24ms. Allocated memory is still 249.6MB. Free memory was 206.4MB in the beginning and 89.5MB in the end (delta: 116.9MB). Peak memory consumption was 116.4MB. Max. memory is 8.0GB. [2022-04-27 10:20:04,217 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.32ms. Allocated memory is still 183.5MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 276.80ms. Allocated memory was 183.5MB in the beginning and 249.6MB in the end (delta: 66.1MB). Free memory was 125.7MB in the beginning and 220.0MB in the end (delta: -94.4MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.10ms. Allocated memory is still 249.6MB. Free memory was 220.0MB in the beginning and 219.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 282.06ms. Allocated memory is still 249.6MB. Free memory was 218.5MB in the beginning and 207.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5597.24ms. Allocated memory is still 249.6MB. Free memory was 206.4MB in the beginning and 89.5MB in the end (delta: 116.9MB). Peak memory consumption was 116.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 211 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 489 IncrementalHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 75 mSDtfsCounter, 489 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 139 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=5, InterpolantAutomatonStates: 50, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 127 HoareAnnotationTreeSize, 12 FomulaSimplifications, 11 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 198 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 826 SizeOfPredicates, 1 NumberOfNonLiveVariables, 283 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 147/405 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((((sn <= 16 && 9 <= i) && 15 < sn) || (((6 <= sn && sn <= 6) && i <= 4) && 4 <= i)) || (sn == 0 && i == 1)) || (((i <= 7 && 12 <= sn) && sn <= 12) && 7 <= i)) || (((14 <= sn && 8 <= i) && i <= 8) && sn <= 14)) || (((sn <= 10 && 10 <= sn) && i <= 6) && 6 <= i)) || (((4 <= sn && sn <= 4) && 3 <= i) && i <= 3)) || (((2 <= i && sn <= 2) && i <= 2) && 2 <= sn)) || (((i <= 5 && 8 <= sn) && 5 <= i) && sn <= 8) RESULT: Ultimate proved your program to be correct! [2022-04-27 10:20:04,246 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...