/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/sum04-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:02:02,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:02:02,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:02:02,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:02:02,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:02:02,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:02:02,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:02:02,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:02:02,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:02:02,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:02:02,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:02:02,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:02:02,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:02:02,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:02:02,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:02:02,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:02:02,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:02:02,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:02:02,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:02:02,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:02:02,486 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:02:02,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:02:02,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:02:02,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:02:02,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:02:02,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:02:02,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:02:02,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:02:02,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:02:02,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:02:02,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:02:02,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:02:02,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:02:02,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:02:02,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:02:02,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:02:02,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:02:02,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:02:02,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:02:02,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:02:02,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:02:02,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:02:02,507 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:02:02,513 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:02:02,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:02:02,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:02:02,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:02:02,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:02:02,514 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:02:02,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:02:02,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:02:02,515 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:02:02,515 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:02:02,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:02:02,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:02:02,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:02:02,515 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:02:02,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:02:02,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:02:02,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:02:02,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:02:02,516 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:02:02,516 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:02:02,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:02:02,516 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:02:02,516 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 09:02:02,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:02:02,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:02:02,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:02:02,735 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:02:02,737 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:02:02,739 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-08 09:02:02,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de88faa6d/03d2d2235d4c4d25862d47d879689c2c/FLAG7744c8a87 [2022-04-08 09:02:03,083 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:02:03,083 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2022-04-08 09:02:03,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de88faa6d/03d2d2235d4c4d25862d47d879689c2c/FLAG7744c8a87 [2022-04-08 09:02:03,521 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de88faa6d/03d2d2235d4c4d25862d47d879689c2c [2022-04-08 09:02:03,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:02:03,526 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:02:03,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:02:03,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:02:03,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:02:03,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:02:03" (1/1) ... [2022-04-08 09:02:03,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6fd388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:03, skipping insertion in model container [2022-04-08 09:02:03,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:02:03" (1/1) ... [2022-04-08 09:02:03,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:02:03,546 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:02:03,697 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-08 09:02:03,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:02:03,712 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:02:03,733 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-08 09:02:03,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:02:03,746 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:02:03,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:03 WrapperNode [2022-04-08 09:02:03,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:02:03,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:02:03,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:02:03,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:02:03,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:03" (1/1) ... [2022-04-08 09:02:03,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:03" (1/1) ... [2022-04-08 09:02:03,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:03" (1/1) ... [2022-04-08 09:02:03,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:03" (1/1) ... [2022-04-08 09:02:03,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:03" (1/1) ... [2022-04-08 09:02:03,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:03" (1/1) ... [2022-04-08 09:02:03,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:03" (1/1) ... [2022-04-08 09:02:03,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:02:03,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:02:03,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:02:03,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:02:03,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:03" (1/1) ... [2022-04-08 09:02:03,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:02:03,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:02:03,798 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-08 09:02:03,839 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-08 09:02:03,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:02:03,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:02:03,859 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:02:03,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:02:03,860 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:02:03,860 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:02:03,860 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:02:03,860 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:02:03,860 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:02:03,860 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:02:03,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:02:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:02:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:02:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:02:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:02:03,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:02:03,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:02:03,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:02:03,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:02:03,906 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:02:03,907 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:02:04,020 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:02:04,031 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:02:04,031 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:02:04,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:02:04 BoogieIcfgContainer [2022-04-08 09:02:04,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:02:04,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:02:04,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:02:04,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:02:04,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:02:03" (1/3) ... [2022-04-08 09:02:04,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e2594a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:02:04, skipping insertion in model container [2022-04-08 09:02:04,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:02:03" (2/3) ... [2022-04-08 09:02:04,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e2594a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:02:04, skipping insertion in model container [2022-04-08 09:02:04,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:02:04" (3/3) ... [2022-04-08 09:02:04,052 INFO L111 eAbstractionObserver]: Analyzing ICFG sum04-2.i [2022-04-08 09:02:04,055 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:02:04,055 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:02:04,105 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:02:04,109 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-08 09:02:04,109 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:02:04,130 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-08 09:02:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:02:04,135 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:02:04,135 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:02:04,136 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:02:04,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:02:04,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1274873075, now seen corresponding path program 1 times [2022-04-08 09:02:04,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:04,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704910761] [2022-04-08 09:02:04,159 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:02:04,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1274873075, now seen corresponding path program 2 times [2022-04-08 09:02:04,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:02:04,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001499019] [2022-04-08 09:02:04,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:02:04,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:02:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:04,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:02:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:04,306 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-08 09:02:04,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-08 09:02:04,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-08 09:02:04,308 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-08 09:02:04,309 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-08 09:02:04,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-08 09:02:04,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-08 09:02:04,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2022-04-08 09:02:04,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {22#true} is VALID [2022-04-08 09:02:04,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-08 09:02:04,310 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-08 09:02:04,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-08 09:02:04,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-08 09:02:04,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-08 09:02:04,311 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-08 09:02:04,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:02:04,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001499019] [2022-04-08 09:02:04,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001499019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:04,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:04,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:02:04,316 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:02:04,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704910761] [2022-04-08 09:02:04,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704910761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:04,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:04,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:02:04,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089152143] [2022-04-08 09:02:04,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:02:04,321 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-08 09:02:04,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:02:04,324 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-08 09:02:04,342 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-08 09:02:04,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:02:04,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:04,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:02:04,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:02:04,361 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-08 09:02:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:04,432 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-08 09:02:04,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:02:04,433 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-08 09:02:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:02:04,434 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-08 09:02:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-08 09:02:04,441 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-08 09:02:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-08 09:02:04,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-04-08 09:02:04,496 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-08 09:02:04,501 INFO L225 Difference]: With dead ends: 30 [2022-04-08 09:02:04,501 INFO L226 Difference]: Without dead ends: 13 [2022-04-08 09:02:04,503 INFO L912 BasicCegarLoop]: 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-08 09:02:04,505 INFO L913 BasicCegarLoop]: 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-08 09:02:04,505 INFO L914 BasicCegarLoop]: 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-08 09:02:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-08 09:02:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-08 09:02:04,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:02:04,528 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-08 09:02:04,529 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-08 09:02:04,529 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-08 09:02:04,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:04,530 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 09:02:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 09:02:04,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:04,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:04,531 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-08 09:02:04,531 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-08 09:02:04,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:04,533 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 09:02:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 09:02:04,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:04,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:04,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:02:04,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:02:04,534 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-08 09:02:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-08 09:02:04,536 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-08 09:02:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:02:04,536 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-08 09:02:04,536 INFO L479 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-08 09:02:04,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-08 09:02:04,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 09:02:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:02:04,549 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:02:04,549 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:02:04,549 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:02:04,549 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:02:04,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:02:04,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1280414201, now seen corresponding path program 1 times [2022-04-08 09:02:04,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:04,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [604021466] [2022-04-08 09:02:04,551 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:02:04,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1280414201, now seen corresponding path program 2 times [2022-04-08 09:02:04,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:02:04,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750769965] [2022-04-08 09:02:04,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:02:04,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:02:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:04,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:02:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:04,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(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); {142#true} is VALID [2022-04-08 09:02:04,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-08 09:02:04,615 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-08 09:02:04,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:02:04,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(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); {142#true} is VALID [2022-04-08 09:02:04,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-08 09:02:04,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-08 09:02:04,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret2 := main(); {142#true} is VALID [2022-04-08 09:02:04,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {147#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:04,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 <= 8); {143#false} is VALID [2022-04-08 09:02:04,618 INFO L272 TraceCheckUtils]: 7: Hoare triple {143#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {143#false} is VALID [2022-04-08 09:02:04,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2022-04-08 09:02:04,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2022-04-08 09:02:04,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2022-04-08 09:02:04,619 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-08 09:02:04,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:02:04,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750769965] [2022-04-08 09:02:04,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750769965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:04,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:04,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:02:04,620 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:02:04,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [604021466] [2022-04-08 09:02:04,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [604021466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:04,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:04,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:02:04,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184787886] [2022-04-08 09:02:04,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:02:04,622 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-08 09:02:04,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:02:04,622 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-08 09:02:04,631 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-08 09:02:04,631 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:02:04,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:04,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:02:04,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:02:04,632 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-08 09:02:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:04,695 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 09:02:04,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:02:04,695 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-08 09:02:04,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:02:04,695 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-08 09:02:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-08 09:02:04,696 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-08 09:02:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-08 09:02:04,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2022-04-08 09:02:04,713 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-08 09:02:04,714 INFO L225 Difference]: With dead ends: 20 [2022-04-08 09:02:04,714 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 09:02:04,715 INFO L912 BasicCegarLoop]: 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-08 09:02:04,716 INFO L913 BasicCegarLoop]: 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-08 09:02:04,716 INFO L914 BasicCegarLoop]: 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-08 09:02:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 09:02:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-08 09:02:04,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:02:04,720 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-08 09:02:04,720 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-08 09:02:04,720 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-08 09:02:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:04,721 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:02:04,722 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:02:04,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:04,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:04,722 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-08 09:02:04,722 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-08 09:02:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:04,723 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:02:04,723 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:02:04,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:04,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:04,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:02:04,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:02:04,724 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-08 09:02:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-08 09:02:04,725 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2022-04-08 09:02:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:02:04,725 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-08 09:02:04,725 INFO L479 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-08 09:02:04,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-08 09:02:04,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:04,738 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 09:02:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 09:02:04,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:02:04,738 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:02:04,738 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:02:04,738 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:02:04,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:02:04,739 INFO L85 PathProgramCache]: Analyzing trace with hash -985852763, now seen corresponding path program 1 times [2022-04-08 09:02:04,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:04,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1390775016] [2022-04-08 09:02:04,751 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:02:04,751 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:02:04,752 INFO L85 PathProgramCache]: Analyzing trace with hash -985852763, now seen corresponding path program 2 times [2022-04-08 09:02:04,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:02:04,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829766469] [2022-04-08 09:02:04,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:02:04,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:02:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:04,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:02:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:04,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {258#(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); {251#true} is VALID [2022-04-08 09:02:04,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-08 09:02:04,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-08 09:02:04,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:02:04,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#(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); {251#true} is VALID [2022-04-08 09:02:04,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-08 09:02:04,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-08 09:02:04,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret2 := main(); {251#true} is VALID [2022-04-08 09:02:04,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {256#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:04,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {256#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:04,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {257#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:04,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#(<= main_~i~0 2)} assume !(~i~0 <= 8); {252#false} is VALID [2022-04-08 09:02:04,803 INFO L272 TraceCheckUtils]: 9: Hoare triple {252#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {252#false} is VALID [2022-04-08 09:02:04,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-08 09:02:04,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-08 09:02:04,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-08 09:02:04,804 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-08 09:02:04,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:02:04,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829766469] [2022-04-08 09:02:04,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829766469] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:02:04,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681078883] [2022-04-08 09:02:04,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:02:04,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:02:04,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:02:04,820 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-08 09:02:04,821 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-08 09:02:04,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:02:04,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:02:04,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 09:02:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:04,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:02:04,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2022-04-08 09:02:04,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#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); {251#true} is VALID [2022-04-08 09:02:04,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-08 09:02:04,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-08 09:02:04,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret2 := main(); {251#true} is VALID [2022-04-08 09:02:04,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {277#(<= main_~i~0 1)} is VALID [2022-04-08 09:02:04,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {277#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {277#(<= main_~i~0 1)} is VALID [2022-04-08 09:02:04,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {277#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {257#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:04,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#(<= main_~i~0 2)} assume !(~i~0 <= 8); {252#false} is VALID [2022-04-08 09:02:04,925 INFO L272 TraceCheckUtils]: 9: Hoare triple {252#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {252#false} is VALID [2022-04-08 09:02:04,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-08 09:02:04,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-08 09:02:04,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-08 09:02:04,926 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-08 09:02:04,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:02:04,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-08 09:02:04,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-08 09:02:04,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-08 09:02:04,983 INFO L272 TraceCheckUtils]: 9: Hoare triple {252#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {252#false} is VALID [2022-04-08 09:02:04,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {311#(<= main_~i~0 8)} assume !(~i~0 <= 8); {252#false} is VALID [2022-04-08 09:02:04,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {311#(<= main_~i~0 8)} is VALID [2022-04-08 09:02:04,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {315#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {315#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:04,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {315#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:04,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret2 := main(); {251#true} is VALID [2022-04-08 09:02:04,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-08 09:02:04,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-08 09:02:04,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#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); {251#true} is VALID [2022-04-08 09:02:04,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2022-04-08 09:02:04,985 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-08 09:02:04,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681078883] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:02:04,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:02:04,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-08 09:02:04,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:02:04,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1390775016] [2022-04-08 09:02:04,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1390775016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:04,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:04,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:02:04,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99362005] [2022-04-08 09:02:04,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:02:04,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-08 09:02:04,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:02:04,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-08 09:02:04,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:04,997 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:02:04,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:04,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:02:04,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:02:04,998 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-08 09:02:05,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:05,046 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 09:02:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:02:05,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-08 09:02:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:02:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-08 09:02:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-04-08 09:02:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-08 09:02:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-04-08 09:02:05,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2022-04-08 09:02:05,067 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-08 09:02:05,067 INFO L225 Difference]: With dead ends: 22 [2022-04-08 09:02:05,067 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 09:02:05,068 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:02:05,069 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:02:05,069 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 18 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:02:05,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 09:02:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-08 09:02:05,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:02:05,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:02:05,073 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:02:05,073 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:02:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:05,074 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:02:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:02:05,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:05,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:05,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 09:02:05,075 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 09:02:05,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:05,076 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:02:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:02:05,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:05,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:05,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:02:05,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:02:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:02:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-08 09:02:05,077 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2022-04-08 09:02:05,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:02:05,077 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-08 09:02:05,078 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-08 09:02:05,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-08 09:02:05,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:02:05,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:02:05,091 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:02:05,091 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:02:05,108 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-08 09:02:05,307 WARN L460 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-08 09:02:05,308 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:02:05,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:02:05,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1380152381, now seen corresponding path program 3 times [2022-04-08 09:02:05,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:05,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2082572358] [2022-04-08 09:02:05,311 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:02:05,312 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:02:05,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1380152381, now seen corresponding path program 4 times [2022-04-08 09:02:05,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:02:05,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530021272] [2022-04-08 09:02:05,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:02:05,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:02:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:05,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:02:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:05,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#(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); {453#true} is VALID [2022-04-08 09:02:05,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-08 09:02:05,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {453#true} {453#true} #42#return; {453#true} is VALID [2022-04-08 09:02:05,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {461#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:02:05,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#(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); {453#true} is VALID [2022-04-08 09:02:05,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-08 09:02:05,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #42#return; {453#true} is VALID [2022-04-08 09:02:05,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret2 := main(); {453#true} is VALID [2022-04-08 09:02:05,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {458#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:05,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {458#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {458#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:05,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {458#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {459#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:05,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {459#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {459#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:05,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {460#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:05,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {460#(<= main_~i~0 3)} assume !(~i~0 <= 8); {454#false} is VALID [2022-04-08 09:02:05,358 INFO L272 TraceCheckUtils]: 11: Hoare triple {454#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {454#false} is VALID [2022-04-08 09:02:05,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2022-04-08 09:02:05,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#false} assume 0 == ~cond; {454#false} is VALID [2022-04-08 09:02:05,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-08 09:02:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:05,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:02:05,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530021272] [2022-04-08 09:02:05,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530021272] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:02:05,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840962388] [2022-04-08 09:02:05,360 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:02:05,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:02:05,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:02:05,361 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-08 09:02:05,362 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-08 09:02:05,383 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:02:05,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:02:05,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 09:02:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:05,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:02:05,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {453#true} is VALID [2022-04-08 09:02:05,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#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); {453#true} is VALID [2022-04-08 09:02:05,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-08 09:02:05,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #42#return; {453#true} is VALID [2022-04-08 09:02:05,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret2 := main(); {453#true} is VALID [2022-04-08 09:02:05,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {480#(<= main_~i~0 1)} is VALID [2022-04-08 09:02:05,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {480#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {480#(<= main_~i~0 1)} is VALID [2022-04-08 09:02:05,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {459#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:05,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {459#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {459#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:05,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {460#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:05,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {460#(<= main_~i~0 3)} assume !(~i~0 <= 8); {454#false} is VALID [2022-04-08 09:02:05,457 INFO L272 TraceCheckUtils]: 11: Hoare triple {454#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {454#false} is VALID [2022-04-08 09:02:05,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2022-04-08 09:02:05,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#false} assume 0 == ~cond; {454#false} is VALID [2022-04-08 09:02:05,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-08 09:02:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:05,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:02:05,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-08 09:02:05,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#false} assume 0 == ~cond; {454#false} is VALID [2022-04-08 09:02:05,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2022-04-08 09:02:05,542 INFO L272 TraceCheckUtils]: 11: Hoare triple {454#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {454#false} is VALID [2022-04-08 09:02:05,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {520#(<= main_~i~0 8)} assume !(~i~0 <= 8); {454#false} is VALID [2022-04-08 09:02:05,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {524#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {520#(<= main_~i~0 8)} is VALID [2022-04-08 09:02:05,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {524#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {524#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:05,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {531#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {524#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:05,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {531#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {531#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:05,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {531#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:05,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret2 := main(); {453#true} is VALID [2022-04-08 09:02:05,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #42#return; {453#true} is VALID [2022-04-08 09:02:05,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-08 09:02:05,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#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); {453#true} is VALID [2022-04-08 09:02:05,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {453#true} is VALID [2022-04-08 09:02:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:05,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840962388] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:02:05,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:02:05,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-08 09:02:05,546 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:02:05,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2082572358] [2022-04-08 09:02:05,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2082572358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:05,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:05,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:02:05,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207273842] [2022-04-08 09:02:05,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:02:05,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-08 09:02:05,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:02:05,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-08 09:02:05,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:05,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:02:05,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:05,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:02:05,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:02:05,558 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-08 09:02:05,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:05,613 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-08 09:02:05,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:02:05,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-08 09:02:05,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:02:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-08 09:02:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-08 09:02:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-08 09:02:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-08 09:02:05,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-08 09:02:05,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:05,634 INFO L225 Difference]: With dead ends: 24 [2022-04-08 09:02:05,634 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 09:02:05,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:02:05,635 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:02:05,635 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 18 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:02:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 09:02:05,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-08 09:02:05,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:02:05,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-08 09:02:05,640 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-08 09:02:05,641 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-08 09:02:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:05,641 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 09:02:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 09:02:05,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:05,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:05,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 19 states. [2022-04-08 09:02:05,642 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 19 states. [2022-04-08 09:02:05,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:05,643 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 09:02:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-08 09:02:05,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:05,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:05,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:02:05,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:02:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-08 09:02:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-08 09:02:05,644 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2022-04-08 09:02:05,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:02:05,644 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-08 09:02:05,645 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-08 09:02:05,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-08 09:02:05,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:05,659 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 09:02:05,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:02:05,659 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:02:05,659 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:02:05,679 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-08 09:02:05,878 WARN L460 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-08 09:02:05,878 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:02:05,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:02:05,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1950004065, now seen corresponding path program 5 times [2022-04-08 09:02:05,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:05,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [299754977] [2022-04-08 09:02:05,887 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:02:05,887 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:02:05,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1950004065, now seen corresponding path program 6 times [2022-04-08 09:02:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:02:05,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245520242] [2022-04-08 09:02:05,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:02:05,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:02:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:05,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:02:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:05,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {692#(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); {683#true} is VALID [2022-04-08 09:02:05,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-08 09:02:05,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {683#true} {683#true} #42#return; {683#true} is VALID [2022-04-08 09:02:05,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {692#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:02:05,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {692#(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); {683#true} is VALID [2022-04-08 09:02:05,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-08 09:02:05,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #42#return; {683#true} is VALID [2022-04-08 09:02:05,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret2 := main(); {683#true} is VALID [2022-04-08 09:02:05,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {683#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {688#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:05,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {688#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {688#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:05,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {688#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {689#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:05,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {689#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {689#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:05,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {689#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {690#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:05,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {690#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {690#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:05,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {690#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {691#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:05,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {691#(<= main_~i~0 4)} assume !(~i~0 <= 8); {684#false} is VALID [2022-04-08 09:02:05,938 INFO L272 TraceCheckUtils]: 13: Hoare triple {684#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {684#false} is VALID [2022-04-08 09:02:05,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {684#false} ~cond := #in~cond; {684#false} is VALID [2022-04-08 09:02:05,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {684#false} assume 0 == ~cond; {684#false} is VALID [2022-04-08 09:02:05,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {684#false} assume !false; {684#false} is VALID [2022-04-08 09:02:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:05,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:02:05,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245520242] [2022-04-08 09:02:05,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245520242] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:02:05,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365656933] [2022-04-08 09:02:05,939 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:02:05,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:02:05,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:02:05,954 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-08 09:02:05,957 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-08 09:02:05,991 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 09:02:05,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:02:05,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 09:02:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:05,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:02:06,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {683#true} is VALID [2022-04-08 09:02:06,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {683#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); {683#true} is VALID [2022-04-08 09:02:06,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-08 09:02:06,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #42#return; {683#true} is VALID [2022-04-08 09:02:06,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret2 := main(); {683#true} is VALID [2022-04-08 09:02:06,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {683#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {711#(<= main_~i~0 1)} is VALID [2022-04-08 09:02:06,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {711#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {711#(<= main_~i~0 1)} is VALID [2022-04-08 09:02:06,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {711#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {689#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:06,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {689#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {689#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:06,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {689#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {690#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:06,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {690#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {690#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:06,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {690#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {691#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:06,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {691#(<= main_~i~0 4)} assume !(~i~0 <= 8); {684#false} is VALID [2022-04-08 09:02:06,062 INFO L272 TraceCheckUtils]: 13: Hoare triple {684#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {684#false} is VALID [2022-04-08 09:02:06,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {684#false} ~cond := #in~cond; {684#false} is VALID [2022-04-08 09:02:06,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {684#false} assume 0 == ~cond; {684#false} is VALID [2022-04-08 09:02:06,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {684#false} assume !false; {684#false} is VALID [2022-04-08 09:02:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:06,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:02:06,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {684#false} assume !false; {684#false} is VALID [2022-04-08 09:02:06,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {684#false} assume 0 == ~cond; {684#false} is VALID [2022-04-08 09:02:06,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {684#false} ~cond := #in~cond; {684#false} is VALID [2022-04-08 09:02:06,149 INFO L272 TraceCheckUtils]: 13: Hoare triple {684#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {684#false} is VALID [2022-04-08 09:02:06,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {757#(<= main_~i~0 8)} assume !(~i~0 <= 8); {684#false} is VALID [2022-04-08 09:02:06,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {761#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {757#(<= main_~i~0 8)} is VALID [2022-04-08 09:02:06,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {761#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {761#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:06,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {768#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {761#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:06,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {768#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {768#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:06,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {775#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {768#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:06,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {775#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {775#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:06,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {683#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {775#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:06,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret2 := main(); {683#true} is VALID [2022-04-08 09:02:06,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #42#return; {683#true} is VALID [2022-04-08 09:02:06,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2022-04-08 09:02:06,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {683#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); {683#true} is VALID [2022-04-08 09:02:06,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {683#true} is VALID [2022-04-08 09:02:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:06,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365656933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:02:06,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:02:06,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-08 09:02:06,154 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:02:06,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [299754977] [2022-04-08 09:02:06,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [299754977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:06,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:06,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:02:06,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784619885] [2022-04-08 09:02:06,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:02:06,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 17 [2022-04-08 09:02:06,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:02:06,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-08 09:02:06,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:06,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:02:06,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:06,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:02:06,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:02:06,167 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-08 09:02:06,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:06,244 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-08 09:02:06,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:02:06,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 17 [2022-04-08 09:02:06,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:02:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-08 09:02:06,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-04-08 09:02:06,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-08 09:02:06,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-04-08 09:02:06,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 26 transitions. [2022-04-08 09:02:06,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:06,265 INFO L225 Difference]: With dead ends: 26 [2022-04-08 09:02:06,265 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 09:02:06,266 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=138, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:02:06,266 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:02:06,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 18 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:02:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 09:02:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-08 09:02:06,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:02:06,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 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-08 09:02:06,274 INFO L74 IsIncluded]: Start isIncluded. First operand 21 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-08 09:02:06,274 INFO L87 Difference]: Start difference. First operand 21 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-08 09:02:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:06,275 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 09:02:06,275 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 09:02:06,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:06,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:06,276 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 21 states. [2022-04-08 09:02:06,276 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 21 states. [2022-04-08 09:02:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:06,277 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 09:02:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-08 09:02:06,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:06,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:06,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:02:06,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:02:06,278 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-08 09:02:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-08 09:02:06,278 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2022-04-08 09:02:06,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:02:06,279 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-08 09:02:06,279 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-08 09:02:06,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-08 09:02:06,294 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-08 09:02:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-08 09:02:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 09:02:06,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:02:06,295 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:02:06,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 09:02:06,508 WARN L460 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-08 09:02:06,509 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:02:06,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:02:06,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1815254145, now seen corresponding path program 7 times [2022-04-08 09:02:06,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:06,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1039245945] [2022-04-08 09:02:06,512 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:02:06,512 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:02:06,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1815254145, now seen corresponding path program 8 times [2022-04-08 09:02:06,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:02:06,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756099471] [2022-04-08 09:02:06,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:02:06,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:02:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:06,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:02:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:06,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {951#(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); {941#true} is VALID [2022-04-08 09:02:06,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {941#true} assume true; {941#true} is VALID [2022-04-08 09:02:06,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {941#true} {941#true} #42#return; {941#true} is VALID [2022-04-08 09:02:06,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {941#true} call ULTIMATE.init(); {951#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:02:06,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {951#(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); {941#true} is VALID [2022-04-08 09:02:06,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {941#true} assume true; {941#true} is VALID [2022-04-08 09:02:06,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {941#true} {941#true} #42#return; {941#true} is VALID [2022-04-08 09:02:06,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {941#true} call #t~ret2 := main(); {941#true} is VALID [2022-04-08 09:02:06,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {941#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {946#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:06,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {946#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {946#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:06,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {946#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {947#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:06,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {947#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {947#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:06,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {947#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {948#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:06,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {948#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {948#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:06,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {948#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {949#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:06,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {949#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {949#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:06,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {949#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {950#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:06,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(<= main_~i~0 5)} assume !(~i~0 <= 8); {942#false} is VALID [2022-04-08 09:02:06,599 INFO L272 TraceCheckUtils]: 15: Hoare triple {942#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {942#false} is VALID [2022-04-08 09:02:06,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {942#false} ~cond := #in~cond; {942#false} is VALID [2022-04-08 09:02:06,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {942#false} assume 0 == ~cond; {942#false} is VALID [2022-04-08 09:02:06,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {942#false} assume !false; {942#false} is VALID [2022-04-08 09:02:06,600 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-08 09:02:06,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:02:06,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756099471] [2022-04-08 09:02:06,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756099471] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:02:06,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248587266] [2022-04-08 09:02:06,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:02:06,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:02:06,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:02:06,606 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-08 09:02:06,608 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-08 09:02:06,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:02:06,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:02:06,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 09:02:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:06,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:02:06,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {941#true} call ULTIMATE.init(); {941#true} is VALID [2022-04-08 09:02:06,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {941#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); {941#true} is VALID [2022-04-08 09:02:06,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {941#true} assume true; {941#true} is VALID [2022-04-08 09:02:06,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {941#true} {941#true} #42#return; {941#true} is VALID [2022-04-08 09:02:06,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {941#true} call #t~ret2 := main(); {941#true} is VALID [2022-04-08 09:02:06,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {941#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {970#(<= main_~i~0 1)} is VALID [2022-04-08 09:02:06,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {970#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {970#(<= main_~i~0 1)} is VALID [2022-04-08 09:02:06,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {970#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {947#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:06,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {947#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {947#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:06,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {947#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {948#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:06,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {948#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {948#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:06,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {948#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {949#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:06,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {949#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {949#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:06,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {949#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {950#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:06,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(<= main_~i~0 5)} assume !(~i~0 <= 8); {942#false} is VALID [2022-04-08 09:02:06,740 INFO L272 TraceCheckUtils]: 15: Hoare triple {942#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {942#false} is VALID [2022-04-08 09:02:06,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {942#false} ~cond := #in~cond; {942#false} is VALID [2022-04-08 09:02:06,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {942#false} assume 0 == ~cond; {942#false} is VALID [2022-04-08 09:02:06,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {942#false} assume !false; {942#false} is VALID [2022-04-08 09:02:06,741 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-08 09:02:06,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:02:06,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {942#false} assume !false; {942#false} is VALID [2022-04-08 09:02:06,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {942#false} assume 0 == ~cond; {942#false} is VALID [2022-04-08 09:02:06,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {942#false} ~cond := #in~cond; {942#false} is VALID [2022-04-08 09:02:06,840 INFO L272 TraceCheckUtils]: 15: Hoare triple {942#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {942#false} is VALID [2022-04-08 09:02:06,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {1022#(<= main_~i~0 8)} assume !(~i~0 <= 8); {942#false} is VALID [2022-04-08 09:02:06,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {1026#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1022#(<= main_~i~0 8)} is VALID [2022-04-08 09:02:06,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {1026#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1026#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:06,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {1033#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1026#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:06,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {1033#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1033#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:06,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {950#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1033#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:06,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {950#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {950#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:06,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {949#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {950#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:06,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {949#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {949#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:06,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {941#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {949#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:06,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {941#true} call #t~ret2 := main(); {941#true} is VALID [2022-04-08 09:02:06,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {941#true} {941#true} #42#return; {941#true} is VALID [2022-04-08 09:02:06,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {941#true} assume true; {941#true} is VALID [2022-04-08 09:02:06,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {941#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); {941#true} is VALID [2022-04-08 09:02:06,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {941#true} call ULTIMATE.init(); {941#true} is VALID [2022-04-08 09:02:06,858 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-08 09:02:06,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248587266] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:02:06,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:02:06,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-08 09:02:06,858 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:02:06,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1039245945] [2022-04-08 09:02:06,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1039245945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:06,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:06,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:02:06,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10976180] [2022-04-08 09:02:06,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:02:06,859 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 19 [2022-04-08 09:02:06,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:02:06,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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-08 09:02:06,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:06,888 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:02:06,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:06,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:02:06,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:02:06,889 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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-08 09:02:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:06,988 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-08 09:02:06,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:02:06,988 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 19 [2022-04-08 09:02:06,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:02:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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-08 09:02:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2022-04-08 09:02:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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-08 09:02:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2022-04-08 09:02:06,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 28 transitions. [2022-04-08 09:02:07,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:07,011 INFO L225 Difference]: With dead ends: 28 [2022-04-08 09:02:07,011 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 09:02:07,011 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=159, Unknown=0, NotChecked=0, Total=272 [2022-04-08 09:02:07,012 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:02:07,012 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 23 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:02:07,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 09:02:07,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-08 09:02:07,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:02:07,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-08 09:02:07,022 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-08 09:02:07,022 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-08 09:02:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:07,024 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 09:02:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 09:02:07,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:07,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:07,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 09:02:07,024 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 09:02:07,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:07,025 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-08 09:02:07,025 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-08 09:02:07,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:07,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:07,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:02:07,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:02:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-08 09:02:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-08 09:02:07,026 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2022-04-08 09:02:07,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:02:07,026 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-08 09:02:07,027 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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-08 09:02:07,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-08 09:02:07,047 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-08 09:02:07,047 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 09:02:07,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 09:02:07,048 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:02:07,048 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:02:07,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 09:02:07,261 WARN L460 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-08 09:02:07,261 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:02:07,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:02:07,261 INFO L85 PathProgramCache]: Analyzing trace with hash 429036573, now seen corresponding path program 9 times [2022-04-08 09:02:07,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:07,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1077564123] [2022-04-08 09:02:07,264 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:02:07,265 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:02:07,265 INFO L85 PathProgramCache]: Analyzing trace with hash 429036573, now seen corresponding path program 10 times [2022-04-08 09:02:07,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:02:07,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924450760] [2022-04-08 09:02:07,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:02:07,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:02:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:07,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:02:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:07,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {1236#(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); {1225#true} is VALID [2022-04-08 09:02:07,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-08 09:02:07,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1225#true} {1225#true} #42#return; {1225#true} is VALID [2022-04-08 09:02:07,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {1225#true} call ULTIMATE.init(); {1236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:02:07,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {1236#(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); {1225#true} is VALID [2022-04-08 09:02:07,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-08 09:02:07,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1225#true} {1225#true} #42#return; {1225#true} is VALID [2022-04-08 09:02:07,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#true} call #t~ret2 := main(); {1225#true} is VALID [2022-04-08 09:02:07,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {1225#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1230#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:07,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {1230#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1230#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:07,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {1230#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1231#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:07,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {1231#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1231#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:07,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {1231#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1232#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:07,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {1232#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1232#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:07,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {1232#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1233#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:07,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {1233#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1233#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:07,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1234#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:07,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {1234#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1234#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:07,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {1234#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1235#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:07,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#(<= main_~i~0 6)} assume !(~i~0 <= 8); {1226#false} is VALID [2022-04-08 09:02:07,323 INFO L272 TraceCheckUtils]: 17: Hoare triple {1226#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1226#false} is VALID [2022-04-08 09:02:07,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {1226#false} ~cond := #in~cond; {1226#false} is VALID [2022-04-08 09:02:07,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {1226#false} assume 0 == ~cond; {1226#false} is VALID [2022-04-08 09:02:07,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2022-04-08 09:02:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:07,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:02:07,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924450760] [2022-04-08 09:02:07,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924450760] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:02:07,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232999631] [2022-04-08 09:02:07,324 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:02:07,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:02:07,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:02:07,325 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:02:07,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 09:02:07,349 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:02:07,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:02:07,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 09:02:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:07,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:02:07,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {1225#true} call ULTIMATE.init(); {1225#true} is VALID [2022-04-08 09:02:07,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {1225#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); {1225#true} is VALID [2022-04-08 09:02:07,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-08 09:02:07,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1225#true} {1225#true} #42#return; {1225#true} is VALID [2022-04-08 09:02:07,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#true} call #t~ret2 := main(); {1225#true} is VALID [2022-04-08 09:02:07,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {1225#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1255#(<= main_~i~0 1)} is VALID [2022-04-08 09:02:07,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {1255#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1255#(<= main_~i~0 1)} is VALID [2022-04-08 09:02:07,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {1255#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1231#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:07,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {1231#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1231#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:07,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {1231#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1232#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:07,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {1232#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1232#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:07,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {1232#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1233#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:07,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {1233#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1233#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:07,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1234#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:07,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {1234#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1234#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:07,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {1234#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1235#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:07,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#(<= main_~i~0 6)} assume !(~i~0 <= 8); {1226#false} is VALID [2022-04-08 09:02:07,434 INFO L272 TraceCheckUtils]: 17: Hoare triple {1226#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1226#false} is VALID [2022-04-08 09:02:07,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {1226#false} ~cond := #in~cond; {1226#false} is VALID [2022-04-08 09:02:07,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {1226#false} assume 0 == ~cond; {1226#false} is VALID [2022-04-08 09:02:07,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2022-04-08 09:02:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:07,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:02:07,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2022-04-08 09:02:07,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {1226#false} assume 0 == ~cond; {1226#false} is VALID [2022-04-08 09:02:07,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {1226#false} ~cond := #in~cond; {1226#false} is VALID [2022-04-08 09:02:07,517 INFO L272 TraceCheckUtils]: 17: Hoare triple {1226#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1226#false} is VALID [2022-04-08 09:02:07,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {1313#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1226#false} is VALID [2022-04-08 09:02:07,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {1317#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1313#(<= main_~i~0 8)} is VALID [2022-04-08 09:02:07,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {1317#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1317#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:07,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {1235#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1317#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:07,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {1235#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1235#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:07,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {1234#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1235#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:07,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {1234#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1234#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:07,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {1233#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1234#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:07,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {1233#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1233#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:07,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {1232#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1233#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:07,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {1232#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1232#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:07,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {1225#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1232#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:07,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#true} call #t~ret2 := main(); {1225#true} is VALID [2022-04-08 09:02:07,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1225#true} {1225#true} #42#return; {1225#true} is VALID [2022-04-08 09:02:07,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-08 09:02:07,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {1225#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); {1225#true} is VALID [2022-04-08 09:02:07,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {1225#true} call ULTIMATE.init(); {1225#true} is VALID [2022-04-08 09:02:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:07,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232999631] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:02:07,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:02:07,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-04-08 09:02:07,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:02:07,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1077564123] [2022-04-08 09:02:07,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1077564123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:07,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:07,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:02:07,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440618019] [2022-04-08 09:02:07,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:02:07,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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 21 [2022-04-08 09:02:07,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:02:07,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-08 09:02:07,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:07,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:02:07,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:07,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:02:07,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:02:07,538 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-08 09:02:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:07,650 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 09:02:07,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:02:07,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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 21 [2022-04-08 09:02:07,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:02:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-08 09:02:07,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-04-08 09:02:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-08 09:02:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-04-08 09:02:07,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 30 transitions. [2022-04-08 09:02:07,675 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-08 09:02:07,676 INFO L225 Difference]: With dead ends: 30 [2022-04-08 09:02:07,676 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 09:02:07,677 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:02:07,679 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:02:07,679 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 28 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:02:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 09:02:07,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-08 09:02:07,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:02:07,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-08 09:02:07,695 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-08 09:02:07,695 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-08 09:02:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:07,698 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 09:02:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 09:02:07,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:07,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:07,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 25 states. [2022-04-08 09:02:07,699 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 25 states. [2022-04-08 09:02:07,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:07,702 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-08 09:02:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-08 09:02:07,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:07,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:07,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:02:07,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:02:07,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-08 09:02:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-08 09:02:07,705 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2022-04-08 09:02:07,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:02:07,705 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-08 09:02:07,705 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-08 09:02:07,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-08 09:02:07,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-08 09:02:07,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 09:02:07,723 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:02:07,723 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:02:07,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 09:02:07,938 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:02:07,939 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:02:07,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:02:07,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1118833979, now seen corresponding path program 11 times [2022-04-08 09:02:07,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:07,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1143068604] [2022-04-08 09:02:07,942 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:02:07,942 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:02:07,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1118833979, now seen corresponding path program 12 times [2022-04-08 09:02:07,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:02:07,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512743658] [2022-04-08 09:02:07,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:02:07,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:02:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:08,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:02:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:08,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {1547#(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); {1535#true} is VALID [2022-04-08 09:02:08,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-08 09:02:08,007 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1535#true} {1535#true} #42#return; {1535#true} is VALID [2022-04-08 09:02:08,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {1535#true} call ULTIMATE.init(); {1547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:02:08,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {1547#(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); {1535#true} is VALID [2022-04-08 09:02:08,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-08 09:02:08,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1535#true} {1535#true} #42#return; {1535#true} is VALID [2022-04-08 09:02:08,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {1535#true} call #t~ret2 := main(); {1535#true} is VALID [2022-04-08 09:02:08,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {1535#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1540#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:08,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {1540#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1540#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:08,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {1540#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1541#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:08,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {1541#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1541#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:08,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {1541#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1542#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:08,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {1542#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1542#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:08,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {1542#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1543#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:08,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {1543#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1543#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:08,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {1543#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1544#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:08,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {1544#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1544#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:08,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {1544#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1545#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:08,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {1545#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1545#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:08,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {1545#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1546#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:08,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {1546#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1536#false} is VALID [2022-04-08 09:02:08,012 INFO L272 TraceCheckUtils]: 19: Hoare triple {1536#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1536#false} is VALID [2022-04-08 09:02:08,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {1536#false} ~cond := #in~cond; {1536#false} is VALID [2022-04-08 09:02:08,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {1536#false} assume 0 == ~cond; {1536#false} is VALID [2022-04-08 09:02:08,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {1536#false} assume !false; {1536#false} is VALID [2022-04-08 09:02:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:08,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:02:08,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512743658] [2022-04-08 09:02:08,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512743658] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:02:08,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583028248] [2022-04-08 09:02:08,013 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:02:08,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:02:08,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:02:08,042 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:02:08,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 09:02:08,082 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 09:02:08,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:02:08,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 09:02:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:08,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:02:08,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {1535#true} call ULTIMATE.init(); {1535#true} is VALID [2022-04-08 09:02:08,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {1535#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); {1535#true} is VALID [2022-04-08 09:02:08,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-08 09:02:08,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1535#true} {1535#true} #42#return; {1535#true} is VALID [2022-04-08 09:02:08,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {1535#true} call #t~ret2 := main(); {1535#true} is VALID [2022-04-08 09:02:08,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {1535#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1566#(<= main_~i~0 1)} is VALID [2022-04-08 09:02:08,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {1566#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1566#(<= main_~i~0 1)} is VALID [2022-04-08 09:02:08,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1541#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:08,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {1541#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1541#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:08,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {1541#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1542#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:08,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {1542#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1542#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:08,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {1542#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1543#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:08,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {1543#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1543#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:08,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {1543#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1544#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:08,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {1544#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1544#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:08,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {1544#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1545#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:08,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {1545#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1545#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:08,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {1545#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1546#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:08,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {1546#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1536#false} is VALID [2022-04-08 09:02:08,187 INFO L272 TraceCheckUtils]: 19: Hoare triple {1536#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1536#false} is VALID [2022-04-08 09:02:08,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {1536#false} ~cond := #in~cond; {1536#false} is VALID [2022-04-08 09:02:08,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {1536#false} assume 0 == ~cond; {1536#false} is VALID [2022-04-08 09:02:08,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {1536#false} assume !false; {1536#false} is VALID [2022-04-08 09:02:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:08,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:02:08,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {1536#false} assume !false; {1536#false} is VALID [2022-04-08 09:02:08,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {1536#false} assume 0 == ~cond; {1536#false} is VALID [2022-04-08 09:02:08,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {1536#false} ~cond := #in~cond; {1536#false} is VALID [2022-04-08 09:02:08,282 INFO L272 TraceCheckUtils]: 19: Hoare triple {1536#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1536#false} is VALID [2022-04-08 09:02:08,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {1630#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1536#false} is VALID [2022-04-08 09:02:08,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {1546#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1630#(<= main_~i~0 8)} is VALID [2022-04-08 09:02:08,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {1546#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1546#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:08,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {1545#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1546#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:08,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {1545#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1545#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:08,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {1544#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1545#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:08,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {1544#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1544#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:08,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {1543#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1544#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:08,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {1543#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1543#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:08,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {1542#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1543#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:08,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {1542#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1542#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:08,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {1541#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1542#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:08,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {1541#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1541#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:08,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {1535#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1541#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:08,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {1535#true} call #t~ret2 := main(); {1535#true} is VALID [2022-04-08 09:02:08,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1535#true} {1535#true} #42#return; {1535#true} is VALID [2022-04-08 09:02:08,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-08 09:02:08,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {1535#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); {1535#true} is VALID [2022-04-08 09:02:08,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {1535#true} call ULTIMATE.init(); {1535#true} is VALID [2022-04-08 09:02:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:08,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583028248] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:02:08,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:02:08,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2022-04-08 09:02:08,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:02:08,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1143068604] [2022-04-08 09:02:08,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1143068604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:08,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:08,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:02:08,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435573916] [2022-04-08 09:02:08,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:02:08,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 23 [2022-04-08 09:02:08,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:02:08,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-08 09:02:08,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:08,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:02:08,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:08,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:02:08,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:02:08,301 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-08 09:02:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:08,424 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-08 09:02:08,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:02:08,424 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 23 [2022-04-08 09:02:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:02:08,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-08 09:02:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-08 09:02:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-08 09:02:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-08 09:02:08,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-04-08 09:02:08,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:08,445 INFO L225 Difference]: With dead ends: 32 [2022-04-08 09:02:08,445 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 09:02:08,445 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2022-04-08 09:02:08,445 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:02:08,446 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 23 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:02:08,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 09:02:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-08 09:02:08,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:02:08,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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-08 09:02:08,460 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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-08 09:02:08,460 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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-08 09:02:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:08,461 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 09:02:08,461 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 09:02:08,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:08,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:08,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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 27 states. [2022-04-08 09:02:08,461 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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 27 states. [2022-04-08 09:02:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:08,462 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-08 09:02:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-08 09:02:08,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:08,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:08,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:02:08,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:02:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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-08 09:02:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-08 09:02:08,463 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2022-04-08 09:02:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:02:08,463 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-08 09:02:08,463 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-08 09:02:08,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-08 09:02:08,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-08 09:02:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 09:02:08,479 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:02:08,479 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:02:08,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 09:02:08,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:02:08,695 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:02:08,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:02:08,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1705789735, now seen corresponding path program 13 times [2022-04-08 09:02:08,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:08,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1289023844] [2022-04-08 09:02:08,699 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:02:08,699 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:02:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1705789735, now seen corresponding path program 14 times [2022-04-08 09:02:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:02:08,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764681826] [2022-04-08 09:02:08,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:02:08,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:02:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:08,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:02:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:08,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {1884#(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); {1871#true} is VALID [2022-04-08 09:02:08,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {1871#true} assume true; {1871#true} is VALID [2022-04-08 09:02:08,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1871#true} {1871#true} #42#return; {1871#true} is VALID [2022-04-08 09:02:08,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {1871#true} call ULTIMATE.init(); {1884#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:02:08,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {1884#(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); {1871#true} is VALID [2022-04-08 09:02:08,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {1871#true} assume true; {1871#true} is VALID [2022-04-08 09:02:08,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1871#true} {1871#true} #42#return; {1871#true} is VALID [2022-04-08 09:02:08,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {1871#true} call #t~ret2 := main(); {1871#true} is VALID [2022-04-08 09:02:08,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {1871#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1876#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:08,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {1876#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1876#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:08,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {1876#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1877#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:08,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {1877#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1877#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:08,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {1877#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1878#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:08,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {1878#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1878#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:08,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {1878#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1879#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:08,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {1879#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1879#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:08,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {1879#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1880#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:08,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {1880#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1880#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:08,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {1880#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1881#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:08,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {1881#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1881#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:08,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {1881#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1882#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:08,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {1882#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1882#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:08,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {1882#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1883#(<= main_~i~0 8)} is VALID [2022-04-08 09:02:08,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {1883#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1872#false} is VALID [2022-04-08 09:02:08,801 INFO L272 TraceCheckUtils]: 21: Hoare triple {1872#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1872#false} is VALID [2022-04-08 09:02:08,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {1872#false} ~cond := #in~cond; {1872#false} is VALID [2022-04-08 09:02:08,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {1872#false} assume 0 == ~cond; {1872#false} is VALID [2022-04-08 09:02:08,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {1872#false} assume !false; {1872#false} is VALID [2022-04-08 09:02:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:08,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:02:08,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764681826] [2022-04-08 09:02:08,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764681826] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:02:08,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391724929] [2022-04-08 09:02:08,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:02:08,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:02:08,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:02:08,803 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:02:08,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 09:02:08,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:02:08,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:02:08,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 09:02:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:08,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:02:08,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {1871#true} call ULTIMATE.init(); {1871#true} is VALID [2022-04-08 09:02:09,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {1871#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); {1871#true} is VALID [2022-04-08 09:02:09,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {1871#true} assume true; {1871#true} is VALID [2022-04-08 09:02:09,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1871#true} {1871#true} #42#return; {1871#true} is VALID [2022-04-08 09:02:09,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {1871#true} call #t~ret2 := main(); {1871#true} is VALID [2022-04-08 09:02:09,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {1871#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1903#(<= main_~i~0 1)} is VALID [2022-04-08 09:02:09,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {1903#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1903#(<= main_~i~0 1)} is VALID [2022-04-08 09:02:09,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {1903#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1877#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:09,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {1877#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1877#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:09,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {1877#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1878#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:09,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {1878#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1878#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:09,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {1878#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1879#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:09,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {1879#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1879#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:09,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {1879#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1880#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:09,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {1880#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1880#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:09,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {1880#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1881#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:09,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {1881#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1881#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:09,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {1881#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1882#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:09,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {1882#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1882#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:09,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {1882#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1883#(<= main_~i~0 8)} is VALID [2022-04-08 09:02:09,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {1883#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1872#false} is VALID [2022-04-08 09:02:09,005 INFO L272 TraceCheckUtils]: 21: Hoare triple {1872#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1872#false} is VALID [2022-04-08 09:02:09,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {1872#false} ~cond := #in~cond; {1872#false} is VALID [2022-04-08 09:02:09,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {1872#false} assume 0 == ~cond; {1872#false} is VALID [2022-04-08 09:02:09,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {1872#false} assume !false; {1872#false} is VALID [2022-04-08 09:02:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:09,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:02:09,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {1872#false} assume !false; {1872#false} is VALID [2022-04-08 09:02:09,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {1872#false} assume 0 == ~cond; {1872#false} is VALID [2022-04-08 09:02:09,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {1872#false} ~cond := #in~cond; {1872#false} is VALID [2022-04-08 09:02:09,118 INFO L272 TraceCheckUtils]: 21: Hoare triple {1872#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1872#false} is VALID [2022-04-08 09:02:09,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {1883#(<= main_~i~0 8)} assume !(~i~0 <= 8); {1872#false} is VALID [2022-04-08 09:02:09,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {1882#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1883#(<= main_~i~0 8)} is VALID [2022-04-08 09:02:09,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {1882#(<= main_~i~0 7)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1882#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:09,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {1881#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1882#(<= main_~i~0 7)} is VALID [2022-04-08 09:02:09,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {1881#(<= main_~i~0 6)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1881#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:09,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {1880#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1881#(<= main_~i~0 6)} is VALID [2022-04-08 09:02:09,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {1880#(<= main_~i~0 5)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1880#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:09,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {1879#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1880#(<= main_~i~0 5)} is VALID [2022-04-08 09:02:09,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {1879#(<= main_~i~0 4)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1879#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:09,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {1878#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1879#(<= main_~i~0 4)} is VALID [2022-04-08 09:02:09,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {1878#(<= main_~i~0 3)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1878#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:09,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {1877#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1878#(<= main_~i~0 3)} is VALID [2022-04-08 09:02:09,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {1877#(<= main_~i~0 2)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1877#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:09,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {1903#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1877#(<= main_~i~0 2)} is VALID [2022-04-08 09:02:09,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {1903#(<= main_~i~0 1)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {1903#(<= main_~i~0 1)} is VALID [2022-04-08 09:02:09,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {1871#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1903#(<= main_~i~0 1)} is VALID [2022-04-08 09:02:09,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {1871#true} call #t~ret2 := main(); {1871#true} is VALID [2022-04-08 09:02:09,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1871#true} {1871#true} #42#return; {1871#true} is VALID [2022-04-08 09:02:09,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {1871#true} assume true; {1871#true} is VALID [2022-04-08 09:02:09,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {1871#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); {1871#true} is VALID [2022-04-08 09:02:09,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {1871#true} call ULTIMATE.init(); {1871#true} is VALID [2022-04-08 09:02:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:02:09,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391724929] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:02:09,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:02:09,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 12 [2022-04-08 09:02:09,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:02:09,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1289023844] [2022-04-08 09:02:09,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1289023844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:09,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:09,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:02:09,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523763107] [2022-04-08 09:02:09,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:02:09,126 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 25 [2022-04-08 09:02:09,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:02:09,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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-08 09:02:09,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:09,139 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:02:09,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:09,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:02:09,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:02:09,140 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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-08 09:02:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:09,284 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-08 09:02:09,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:02:09,284 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 25 [2022-04-08 09:02:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:02:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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-08 09:02:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-08 09:02:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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-08 09:02:09,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-08 09:02:09,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2022-04-08 09:02:09,315 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-08 09:02:09,316 INFO L225 Difference]: With dead ends: 33 [2022-04-08 09:02:09,316 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 09:02:09,316 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2022-04-08 09:02:09,316 INFO L913 BasicCegarLoop]: 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-08 09:02:09,317 INFO L914 BasicCegarLoop]: 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-08 09:02:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 09:02:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 09:02:09,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:02:09,333 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-08 09:02:09,333 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-08 09:02:09,333 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-08 09:02:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:09,335 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-08 09:02:09,335 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-08 09:02:09,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:09,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:09,335 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-08 09:02:09,335 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-08 09:02:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:09,336 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-08 09:02:09,336 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-08 09:02:09,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:09,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:09,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:02:09,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:02:09,336 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-08 09:02:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-08 09:02:09,337 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2022-04-08 09:02:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:02:09,337 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-08 09:02:09,337 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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-08 09:02:09,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-08 09:02:09,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-08 09:02:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 09:02:09,357 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:02:09,357 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:02:09,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 09:02:09,572 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:02:09,572 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:02:09,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:02:09,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1749847817, now seen corresponding path program 15 times [2022-04-08 09:02:09,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:09,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1051829573] [2022-04-08 09:02:09,576 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:02:09,576 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:02:09,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1749847817, now seen corresponding path program 16 times [2022-04-08 09:02:09,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:02:09,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929782127] [2022-04-08 09:02:09,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:02:09,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:02:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:09,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:02:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:09,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {2245#(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); {2229#true} is VALID [2022-04-08 09:02:09,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-08 09:02:09,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2229#true} {2229#true} #42#return; {2229#true} is VALID [2022-04-08 09:02:09,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {2229#true} call ULTIMATE.init(); {2245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:02:09,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {2245#(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); {2229#true} is VALID [2022-04-08 09:02:09,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-08 09:02:09,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2229#true} {2229#true} #42#return; {2229#true} is VALID [2022-04-08 09:02:09,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {2229#true} call #t~ret2 := main(); {2229#true} is VALID [2022-04-08 09:02:09,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {2229#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2234#(= main_~sn~0 0)} is VALID [2022-04-08 09:02:09,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {2234#(= main_~sn~0 0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2235#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:02:09,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {2235#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2235#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:02:09,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {2235#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2236#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-08 09:02:09,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {2236#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2236#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-08 09:02:09,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {2236#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2237#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2022-04-08 09:02:09,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {2237#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2237#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2022-04-08 09:02:09,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {2237#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2238#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2022-04-08 09:02:09,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {2238#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2238#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2022-04-08 09:02:09,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {2238#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2239#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2022-04-08 09:02:09,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {2239#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2239#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2022-04-08 09:02:09,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {2239#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2240#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2022-04-08 09:02:09,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {2240#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2240#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2022-04-08 09:02:09,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {2240#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2241#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2022-04-08 09:02:09,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {2241#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2241#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2022-04-08 09:02:09,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {2241#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2242#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-08 09:02:09,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {2242#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2242#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-08 09:02:09,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {2242#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} assume !(~i~0 <= 8); {2242#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-08 09:02:09,736 INFO L272 TraceCheckUtils]: 23: Hoare triple {2242#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2243#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:02:09,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {2243#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2244#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:02:09,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {2244#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2230#false} is VALID [2022-04-08 09:02:09,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#false} assume !false; {2230#false} is VALID [2022-04-08 09:02:09,737 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-08 09:02:09,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:02:09,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929782127] [2022-04-08 09:02:09,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929782127] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:02:09,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894376088] [2022-04-08 09:02:09,738 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:02:09,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:02:09,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:02:09,739 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:02:09,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 09:02:09,767 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:02:09,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:02:09,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 09:02:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:09,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:02:10,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {2229#true} call ULTIMATE.init(); {2229#true} is VALID [2022-04-08 09:02:10,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {2229#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); {2229#true} is VALID [2022-04-08 09:02:10,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-08 09:02:10,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2229#true} {2229#true} #42#return; {2229#true} is VALID [2022-04-08 09:02:10,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {2229#true} call #t~ret2 := main(); {2229#true} is VALID [2022-04-08 09:02:10,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {2229#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2234#(= main_~sn~0 0)} is VALID [2022-04-08 09:02:10,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {2234#(= main_~sn~0 0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2235#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:02:10,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {2235#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2235#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:02:10,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {2235#(and (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2236#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-08 09:02:10,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {2236#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2236#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-08 09:02:10,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {2236#(and (<= 4 main_~sn~0) (<= main_~sn~0 4))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2237#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2022-04-08 09:02:10,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {2237#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2237#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} is VALID [2022-04-08 09:02:10,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {2237#(and (<= 6 main_~sn~0) (<= main_~sn~0 6))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2238#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2022-04-08 09:02:10,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {2238#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2238#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} is VALID [2022-04-08 09:02:10,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {2238#(and (<= 8 main_~sn~0) (<= main_~sn~0 8))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2239#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2022-04-08 09:02:10,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {2239#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2239#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} is VALID [2022-04-08 09:02:10,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {2239#(and (<= main_~sn~0 10) (<= 10 main_~sn~0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2240#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2022-04-08 09:02:10,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {2240#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2240#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} is VALID [2022-04-08 09:02:10,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {2240#(and (<= 12 main_~sn~0) (<= main_~sn~0 12))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2241#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2022-04-08 09:02:10,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {2241#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2241#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} is VALID [2022-04-08 09:02:10,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {2241#(and (<= 14 main_~sn~0) (<= main_~sn~0 14))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2242#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-08 09:02:10,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {2242#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2242#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-08 09:02:10,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {2242#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} assume !(~i~0 <= 8); {2242#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} is VALID [2022-04-08 09:02:10,085 INFO L272 TraceCheckUtils]: 23: Hoare triple {2242#(and (<= main_~sn~0 16) (< 15 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:02:10,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {2318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:02:10,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {2322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2230#false} is VALID [2022-04-08 09:02:10,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#false} assume !false; {2230#false} is VALID [2022-04-08 09:02:10,086 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-08 09:02:10,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:02:10,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#false} assume !false; {2230#false} is VALID [2022-04-08 09:02:10,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {2322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2230#false} is VALID [2022-04-08 09:02:10,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {2318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:02:10,374 INFO L272 TraceCheckUtils]: 23: Hoare triple {2338#(or (= main_~sn~0 0) (= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:02:10,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {2338#(or (= main_~sn~0 0) (= 16 main_~sn~0))} assume !(~i~0 <= 8); {2338#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-08 09:02:10,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {2338#(or (= main_~sn~0 0) (= 16 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2338#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-08 09:02:10,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {2348#(or (= (+ 2 main_~sn~0) 16) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2338#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-08 09:02:10,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {2348#(or (= (+ 2 main_~sn~0) 16) (= (+ 2 main_~sn~0) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2348#(or (= (+ 2 main_~sn~0) 16) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:02:10,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {2355#(or (= (+ main_~sn~0 4) 16) (= (+ main_~sn~0 4) 0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2348#(or (= (+ 2 main_~sn~0) 16) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:02:10,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {2355#(or (= (+ main_~sn~0 4) 16) (= (+ main_~sn~0 4) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2355#(or (= (+ main_~sn~0 4) 16) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-08 09:02:10,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {2362#(or (= (+ 6 main_~sn~0) 16) (= (+ 6 main_~sn~0) 0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2355#(or (= (+ main_~sn~0 4) 16) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-08 09:02:10,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {2362#(or (= (+ 6 main_~sn~0) 16) (= (+ 6 main_~sn~0) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2362#(or (= (+ 6 main_~sn~0) 16) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-08 09:02:10,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {2369#(or (= (+ main_~sn~0 8) 0) (= (+ main_~sn~0 8) 16))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2362#(or (= (+ 6 main_~sn~0) 16) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-08 09:02:10,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {2369#(or (= (+ main_~sn~0 8) 0) (= (+ main_~sn~0 8) 16))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2369#(or (= (+ main_~sn~0 8) 0) (= (+ main_~sn~0 8) 16))} is VALID [2022-04-08 09:02:10,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {2376#(or (= 16 (+ main_~sn~0 10)) (= (+ main_~sn~0 10) 0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2369#(or (= (+ main_~sn~0 8) 0) (= (+ main_~sn~0 8) 16))} is VALID [2022-04-08 09:02:10,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {2376#(or (= 16 (+ main_~sn~0 10)) (= (+ main_~sn~0 10) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2376#(or (= 16 (+ main_~sn~0 10)) (= (+ main_~sn~0 10) 0))} is VALID [2022-04-08 09:02:10,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {2383#(or (= (+ main_~sn~0 12) 16) (= (+ main_~sn~0 12) 0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2376#(or (= 16 (+ main_~sn~0 10)) (= (+ main_~sn~0 10) 0))} is VALID [2022-04-08 09:02:10,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {2383#(or (= (+ main_~sn~0 12) 16) (= (+ main_~sn~0 12) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2383#(or (= (+ main_~sn~0 12) 16) (= (+ main_~sn~0 12) 0))} is VALID [2022-04-08 09:02:10,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {2390#(or (= (+ 14 main_~sn~0) 16) (= (+ 14 main_~sn~0) 0))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2383#(or (= (+ main_~sn~0 12) 16) (= (+ main_~sn~0 12) 0))} is VALID [2022-04-08 09:02:10,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {2390#(or (= (+ 14 main_~sn~0) 16) (= (+ 14 main_~sn~0) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2390#(or (= (+ 14 main_~sn~0) 16) (= (+ 14 main_~sn~0) 0))} is VALID [2022-04-08 09:02:10,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {2397#(or (= (+ 16 main_~sn~0) 0) (= 16 (+ 16 main_~sn~0)))} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2390#(or (= (+ 14 main_~sn~0) 16) (= (+ 14 main_~sn~0) 0))} is VALID [2022-04-08 09:02:10,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {2229#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2397#(or (= (+ 16 main_~sn~0) 0) (= 16 (+ 16 main_~sn~0)))} is VALID [2022-04-08 09:02:10,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {2229#true} call #t~ret2 := main(); {2229#true} is VALID [2022-04-08 09:02:10,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2229#true} {2229#true} #42#return; {2229#true} is VALID [2022-04-08 09:02:10,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-08 09:02:10,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {2229#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); {2229#true} is VALID [2022-04-08 09:02:10,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {2229#true} call ULTIMATE.init(); {2229#true} is VALID [2022-04-08 09:02:10,383 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-08 09:02:10,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894376088] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:02:10,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:02:10,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 25 [2022-04-08 09:02:10,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:02:10,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1051829573] [2022-04-08 09:02:10,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1051829573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:10,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:10,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 09:02:10,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689459729] [2022-04-08 09:02:10,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:02:10,385 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 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 27 [2022-04-08 09:02:10,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:02:10,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 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-08 09:02:10,402 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-08 09:02:10,402 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 09:02:10,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:10,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 09:02:10,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2022-04-08 09:02:10,403 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 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-08 09:02:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:10,901 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-08 09:02:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 09:02:10,901 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 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 27 [2022-04-08 09:02:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:02:10,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 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-08 09:02:10,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2022-04-08 09:02:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 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-08 09:02:10,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2022-04-08 09:02:10,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 35 transitions. [2022-04-08 09:02:10,933 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-08 09:02:10,933 INFO L225 Difference]: With dead ends: 35 [2022-04-08 09:02:10,933 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 09:02:10,934 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=1145, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 09:02:10,934 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:02:10,935 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 75 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:02:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 09:02:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 09:02:10,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:02:10,961 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-08 09:02:10,961 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-08 09:02:10,961 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-08 09:02:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:10,962 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 09:02:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-08 09:02:10,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:10,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:10,962 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-08 09:02:10,962 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-08 09:02:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:10,963 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 09:02:10,963 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-08 09:02:10,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:10,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:10,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:02:10,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:02:10,963 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-08 09:02:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-08 09:02:10,964 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2022-04-08 09:02:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:02:10,964 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-08 09:02:10,964 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 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-08 09:02:10,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-08 09:02:10,984 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-08 09:02:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-08 09:02:10,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 09:02:10,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:02:10,984 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:02:11,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 09:02:11,184 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 09:02:11,185 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:02:11,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:02:11,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1139991659, now seen corresponding path program 17 times [2022-04-08 09:02:11,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:11,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1051593827] [2022-04-08 09:02:11,187 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:02:11,188 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:02:11,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1139991659, now seen corresponding path program 18 times [2022-04-08 09:02:11,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:02:11,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278836506] [2022-04-08 09:02:11,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:02:11,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:02:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:11,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:02:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:11,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {2644#(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); {2630#true} is VALID [2022-04-08 09:02:11,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {2630#true} assume true; {2630#true} is VALID [2022-04-08 09:02:11,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2630#true} {2630#true} #42#return; {2630#true} is VALID [2022-04-08 09:02:11,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {2630#true} call ULTIMATE.init(); {2644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:02:11,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {2644#(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); {2630#true} is VALID [2022-04-08 09:02:11,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {2630#true} assume true; {2630#true} is VALID [2022-04-08 09:02:11,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2630#true} {2630#true} #42#return; {2630#true} is VALID [2022-04-08 09:02:11,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {2630#true} call #t~ret2 := main(); {2630#true} is VALID [2022-04-08 09:02:11,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {2630#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2635#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:11,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {2635#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2635#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:02:11,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {2635#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2636#(<= 2 main_~i~0)} is VALID [2022-04-08 09:02:11,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {2636#(<= 2 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2636#(<= 2 main_~i~0)} is VALID [2022-04-08 09:02:11,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {2636#(<= 2 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2637#(<= 3 main_~i~0)} is VALID [2022-04-08 09:02:11,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {2637#(<= 3 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2637#(<= 3 main_~i~0)} is VALID [2022-04-08 09:02:11,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {2637#(<= 3 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2638#(<= 4 main_~i~0)} is VALID [2022-04-08 09:02:11,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {2638#(<= 4 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2638#(<= 4 main_~i~0)} is VALID [2022-04-08 09:02:11,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {2638#(<= 4 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2639#(<= 5 main_~i~0)} is VALID [2022-04-08 09:02:11,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {2639#(<= 5 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2639#(<= 5 main_~i~0)} is VALID [2022-04-08 09:02:11,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {2639#(<= 5 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2640#(<= 6 main_~i~0)} is VALID [2022-04-08 09:02:11,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {2640#(<= 6 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2640#(<= 6 main_~i~0)} is VALID [2022-04-08 09:02:11,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {2640#(<= 6 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2641#(<= 7 main_~i~0)} is VALID [2022-04-08 09:02:11,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {2641#(<= 7 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2641#(<= 7 main_~i~0)} is VALID [2022-04-08 09:02:11,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {2641#(<= 7 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2642#(<= 8 main_~i~0)} is VALID [2022-04-08 09:02:11,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {2642#(<= 8 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2642#(<= 8 main_~i~0)} is VALID [2022-04-08 09:02:11,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {2642#(<= 8 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2643#(<= 9 main_~i~0)} is VALID [2022-04-08 09:02:11,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {2643#(<= 9 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2631#false} is VALID [2022-04-08 09:02:11,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {2631#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2631#false} is VALID [2022-04-08 09:02:11,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {2631#false} assume !(~i~0 <= 8); {2631#false} is VALID [2022-04-08 09:02:11,296 INFO L272 TraceCheckUtils]: 25: Hoare triple {2631#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2631#false} is VALID [2022-04-08 09:02:11,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {2631#false} ~cond := #in~cond; {2631#false} is VALID [2022-04-08 09:02:11,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {2631#false} assume 0 == ~cond; {2631#false} is VALID [2022-04-08 09:02:11,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {2631#false} assume !false; {2631#false} is VALID [2022-04-08 09:02:11,296 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-08 09:02:11,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:02:11,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278836506] [2022-04-08 09:02:11,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278836506] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:02:11,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170546529] [2022-04-08 09:02:11,297 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:02:11,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:02:11,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:02:11,299 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:02:11,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 09:02:11,328 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 09:02:11,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:02:11,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 09:02:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:02:11,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:02:11,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {2630#true} call ULTIMATE.init(); {2630#true} is VALID [2022-04-08 09:02:11,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {2630#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); {2630#true} is VALID [2022-04-08 09:02:11,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {2630#true} assume true; {2630#true} is VALID [2022-04-08 09:02:11,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2630#true} {2630#true} #42#return; {2630#true} is VALID [2022-04-08 09:02:11,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {2630#true} call #t~ret2 := main(); {2630#true} is VALID [2022-04-08 09:02:11,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {2630#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2663#(<= 1 main_~i~0)} is VALID [2022-04-08 09:02:11,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {2663#(<= 1 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2663#(<= 1 main_~i~0)} is VALID [2022-04-08 09:02:11,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {2663#(<= 1 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2636#(<= 2 main_~i~0)} is VALID [2022-04-08 09:02:11,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {2636#(<= 2 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2636#(<= 2 main_~i~0)} is VALID [2022-04-08 09:02:11,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {2636#(<= 2 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2637#(<= 3 main_~i~0)} is VALID [2022-04-08 09:02:11,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {2637#(<= 3 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2637#(<= 3 main_~i~0)} is VALID [2022-04-08 09:02:11,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {2637#(<= 3 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2638#(<= 4 main_~i~0)} is VALID [2022-04-08 09:02:11,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {2638#(<= 4 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2638#(<= 4 main_~i~0)} is VALID [2022-04-08 09:02:11,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {2638#(<= 4 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2639#(<= 5 main_~i~0)} is VALID [2022-04-08 09:02:11,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {2639#(<= 5 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2639#(<= 5 main_~i~0)} is VALID [2022-04-08 09:02:11,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {2639#(<= 5 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2640#(<= 6 main_~i~0)} is VALID [2022-04-08 09:02:11,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {2640#(<= 6 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2640#(<= 6 main_~i~0)} is VALID [2022-04-08 09:02:11,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {2640#(<= 6 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2641#(<= 7 main_~i~0)} is VALID [2022-04-08 09:02:11,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {2641#(<= 7 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2641#(<= 7 main_~i~0)} is VALID [2022-04-08 09:02:11,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {2641#(<= 7 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2642#(<= 8 main_~i~0)} is VALID [2022-04-08 09:02:11,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {2642#(<= 8 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2642#(<= 8 main_~i~0)} is VALID [2022-04-08 09:02:11,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {2642#(<= 8 main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2643#(<= 9 main_~i~0)} is VALID [2022-04-08 09:02:11,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {2643#(<= 9 main_~i~0)} assume !!(~i~0 <= 8);~sn~0 := 2 + ~sn~0; {2631#false} is VALID [2022-04-08 09:02:11,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {2631#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2631#false} is VALID [2022-04-08 09:02:11,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {2631#false} assume !(~i~0 <= 8); {2631#false} is VALID [2022-04-08 09:02:11,452 INFO L272 TraceCheckUtils]: 25: Hoare triple {2631#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2631#false} is VALID [2022-04-08 09:02:11,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {2631#false} ~cond := #in~cond; {2631#false} is VALID [2022-04-08 09:02:11,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {2631#false} assume 0 == ~cond; {2631#false} is VALID [2022-04-08 09:02:11,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {2631#false} assume !false; {2631#false} is VALID [2022-04-08 09:02:11,452 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-08 09:02:11,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 09:02:11,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170546529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:11,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 09:02:11,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 13 [2022-04-08 09:02:11,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:02:11,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1051593827] [2022-04-08 09:02:11,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1051593827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:02:11,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:02:11,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:02:11,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220859526] [2022-04-08 09:02:11,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:02:11,454 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-08 09:02:11,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:02:11,454 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-08 09:02:11,469 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-08 09:02:11,469 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:02:11,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:02:11,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:02:11,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:02:11,470 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-08 09:02:11,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:11,549 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-08 09:02:11,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:02:11,549 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-08 09:02:11,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:02:11,549 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-08 09:02:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 30 transitions. [2022-04-08 09:02:11,550 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-08 09:02:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 30 transitions. [2022-04-08 09:02:11,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 30 transitions. [2022-04-08 09:02:11,566 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-08 09:02:11,566 INFO L225 Difference]: With dead ends: 30 [2022-04-08 09:02:11,566 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:02:11,566 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:02:11,567 INFO L913 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:02:11,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:02:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:02:11,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:02:11,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:02:11,568 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-08 09:02:11,568 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-08 09:02:11,568 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-08 09:02:11,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:11,568 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:02:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:02:11,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:11,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:11,568 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-08 09:02:11,568 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-08 09:02:11,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:02:11,568 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:02:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:02:11,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:11,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:02:11,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:02:11,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:02:11,569 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-08 09:02:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:02:11,569 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-04-08 09:02:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:02:11,569 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:02:11,569 INFO L479 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-08 09:02:11,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:02:11,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:02:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:02:11,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:02:11,571 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:02:11,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 09:02:11,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:02:11,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:02:12,050 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 09:02:12,051 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 09:02:12,051 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 09:02:12,051 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 28) the Hoare annotation is: true [2022-04-08 09:02:12,051 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 22 28) the Hoare annotation is: true [2022-04-08 09:02:12,051 INFO L878 garLoopResultBuilder]: At program point L24-2(lines 24 26) the Hoare annotation is: (or (and (<= 8 main_~sn~0) (<= main_~i~0 4) (<= 4 main_~i~0) (<= main_~sn~0 8)) (and (<= 14 main_~sn~0) (<= main_~i~0 7) (<= main_~sn~0 14) (<= 7 main_~i~0)) (and (<= main_~sn~0 2) (= main_~i~0 1) (<= 2 main_~sn~0)) (and (<= 4 main_~sn~0) (<= 2 main_~i~0) (<= main_~sn~0 4) (<= main_~i~0 2)) (and (<= main_~i~0 5) (<= main_~sn~0 10) (<= 10 main_~sn~0) (<= 5 main_~i~0)) (and (<= main_~i~0 6) (<= 12 main_~sn~0) (<= 6 main_~i~0) (<= main_~sn~0 12)) (and (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= 3 main_~i~0) (<= main_~i~0 3)) (and (<= main_~sn~0 16) (<= 8 main_~i~0) (<= main_~i~0 8) (< 15 main_~sn~0))) [2022-04-08 09:02:12,052 INFO L878 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-08 09:02:12,052 INFO L878 garLoopResultBuilder]: At program point L24-4(lines 24 26) the Hoare annotation is: (and (<= main_~sn~0 16) (< 15 main_~sn~0)) [2022-04-08 09:02:12,052 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 22 28) the Hoare annotation is: true [2022-04-08 09:02:12,052 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:02:12,052 INFO L878 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-08 09:02:12,053 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:02:12,053 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:02:12,053 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:02:12,053 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:02:12,053 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:02:12,053 INFO L878 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:02:12,053 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:02:12,053 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-04-08 09:02:12,053 INFO L885 garLoopResultBuilder]: At program point L15-2(lines 14 19) the Hoare annotation is: true [2022-04-08 09:02:12,053 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 19) the Hoare annotation is: true [2022-04-08 09:02:12,053 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:02:12,055 INFO L719 BasicCegarLoop]: Path program histogram: [18, 2, 2] [2022-04-08 09:02:12,056 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:02:12,058 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:02:12,058 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:02:12,062 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:02:12,090 INFO L163 areAnnotationChecker]: CFG has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:02:12,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:02:12 BoogieIcfgContainer [2022-04-08 09:02:12,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:02:12,108 INFO L158 Benchmark]: Toolchain (without parser) took 8581.84ms. Allocated memory was 226.5MB in the beginning and 333.4MB in the end (delta: 107.0MB). Free memory was 178.9MB in the beginning and 284.8MB in the end (delta: -105.9MB). Peak memory consumption was 135.0MB. Max. memory is 8.0GB. [2022-04-08 09:02:12,108 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory was 194.9MB in the beginning and 194.8MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:02:12,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.79ms. Allocated memory is still 226.5MB. Free memory was 178.7MB in the beginning and 203.4MB in the end (delta: -24.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 09:02:12,108 INFO L158 Benchmark]: Boogie Preprocessor took 28.71ms. Allocated memory is still 226.5MB. Free memory was 203.4MB in the beginning and 202.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 09:02:12,108 INFO L158 Benchmark]: RCFGBuilder took 255.93ms. Allocated memory is still 226.5MB. Free memory was 202.1MB in the beginning and 191.9MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 09:02:12,109 INFO L158 Benchmark]: TraceAbstraction took 8073.33ms. Allocated memory was 226.5MB in the beginning and 333.4MB in the end (delta: 107.0MB). Free memory was 191.2MB in the beginning and 284.8MB in the end (delta: -93.6MB). Peak memory consumption was 148.0MB. Max. memory is 8.0GB. [2022-04-08 09:02:12,110 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.13ms. Allocated memory is still 226.5MB. Free memory was 194.9MB in the beginning and 194.8MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.79ms. Allocated memory is still 226.5MB. Free memory was 178.7MB in the beginning and 203.4MB in the end (delta: -24.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.71ms. Allocated memory is still 226.5MB. Free memory was 203.4MB in the beginning and 202.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 255.93ms. Allocated memory is still 226.5MB. Free memory was 202.1MB in the beginning and 191.9MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8073.33ms. Allocated memory was 226.5MB in the beginning and 333.4MB in the end (delta: 107.0MB). Free memory was 191.2MB in the beginning and 284.8MB in the end (delta: -93.6MB). Peak memory consumption was 148.0MB. 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: 8.0s, OverallIterations: 11, TraceHistogramMax: 9, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 291 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 466 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 130 mSDtfsCounter, 466 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 487 GetRequests, 336 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=10, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 79 PreInvPairs, 121 NumberOfFragments, 251 HoareAnnotationTreeSize, 79 FomulaSimplifications, 392 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 19 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 09:02:12,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...