/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/loop-simple/nested_1b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:33:36,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:33:36,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:33:36,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:33:36,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:33:36,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:33:36,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:33:36,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:33:36,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:33:36,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:33:36,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:33:36,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:33:36,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:33:36,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:33:36,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:33:36,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:33:36,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:33:36,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:33:36,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:33:36,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:33:36,608 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:33:36,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:33:36,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:33:36,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:33:36,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:33:36,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:33:36,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:33:36,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:33:36,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:33:36,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:33:36,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:33:36,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:33:36,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:33:36,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:33:36,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:33:36,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:33:36,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:33:36,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:33:36,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:33:36,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:33:36,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:33:36,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:33:36,630 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:33:36,644 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:33:36,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:33:36,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:33:36,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:33:36,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:33:36,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:33:36,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:33:36,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:33:36,646 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:33:36,647 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:33:36,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:33:36,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:33:36,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:33:36,647 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:33:36,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:33:36,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:33:36,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:33:36,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:33:36,648 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:33:36,648 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:33:36,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:33:36,648 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:33:36,649 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-28 10:33:36,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:33:36,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:33:36,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:33:36,889 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:33:36,890 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:33:36,891 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_1b.c [2022-04-28 10:33:36,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85be725f0/57569e3bedee46da9bfe5a16f25f18b6/FLAG627989ef5 [2022-04-28 10:33:37,333 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:33:37,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_1b.c [2022-04-28 10:33:37,339 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85be725f0/57569e3bedee46da9bfe5a16f25f18b6/FLAG627989ef5 [2022-04-28 10:33:37,358 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85be725f0/57569e3bedee46da9bfe5a16f25f18b6 [2022-04-28 10:33:37,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:33:37,362 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:33:37,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:33:37,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:33:37,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:33:37,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:33:37" (1/1) ... [2022-04-28 10:33:37,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58524d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:37, skipping insertion in model container [2022-04-28 10:33:37,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:33:37" (1/1) ... [2022-04-28 10:33:37,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:33:37,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:33:37,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_1b.c[674,687] [2022-04-28 10:33:37,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:33:37,561 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:33:37,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_1b.c[674,687] [2022-04-28 10:33:37,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:33:37,583 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:33:37,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:37 WrapperNode [2022-04-28 10:33:37,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:33:37,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:33:37,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:33:37,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:33:37,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:37" (1/1) ... [2022-04-28 10:33:37,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:37" (1/1) ... [2022-04-28 10:33:37,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:37" (1/1) ... [2022-04-28 10:33:37,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:37" (1/1) ... [2022-04-28 10:33:37,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:37" (1/1) ... [2022-04-28 10:33:37,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:37" (1/1) ... [2022-04-28 10:33:37,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:37" (1/1) ... [2022-04-28 10:33:37,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:33:37,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:33:37,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:33:37,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:33:37,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:37" (1/1) ... [2022-04-28 10:33:37,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:33:37,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:37,636 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-28 10:33:37,655 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-28 10:33:37,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:33:37,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:33:37,681 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:33:37,681 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:33:37,681 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:33:37,681 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:33:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:33:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:33:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:33:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:33:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:33:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:33:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:33:37,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:33:37,727 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:33:37,729 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:33:37,854 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:33:37,864 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:33:37,864 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:33:37,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:33:37 BoogieIcfgContainer [2022-04-28 10:33:37,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:33:37,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:33:37,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:33:37,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:33:37,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:33:37" (1/3) ... [2022-04-28 10:33:37,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260b11a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:33:37, skipping insertion in model container [2022-04-28 10:33:37,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:37" (2/3) ... [2022-04-28 10:33:37,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260b11a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:33:37, skipping insertion in model container [2022-04-28 10:33:37,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:33:37" (3/3) ... [2022-04-28 10:33:37,873 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_1b.c [2022-04-28 10:33:37,886 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:33:37,886 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:33:37,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:33:37,945 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c41c293, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68cdd161 [2022-04-28 10:33:37,945 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:33:37,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:33:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 10:33:37,966 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:37,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:37,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:37,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:37,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1887993331, now seen corresponding path program 1 times [2022-04-28 10:33:37,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:37,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [248667698] [2022-04-28 10:33:37,992 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:33:37,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1887993331, now seen corresponding path program 2 times [2022-04-28 10:33:37,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:37,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84473048] [2022-04-28 10:33:37,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:37,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:38,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:38,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#(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(12, 2);call #Ultimate.allocInit(12, 3); {19#true} is VALID [2022-04-28 10:33:38,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume true; {19#true} is VALID [2022-04-28 10:33:38,188 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19#true} {19#true} #32#return; {19#true} is VALID [2022-04-28 10:33:38,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {24#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:38,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#(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(12, 2);call #Ultimate.allocInit(12, 3); {19#true} is VALID [2022-04-28 10:33:38,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2022-04-28 10:33:38,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #32#return; {19#true} is VALID [2022-04-28 10:33:38,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret5 := main(); {19#true} is VALID [2022-04-28 10:33:38,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {19#true} ~a~0 := 6;~a~0 := 0; {19#true} is VALID [2022-04-28 10:33:38,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {19#true} assume !true; {20#false} is VALID [2022-04-28 10:33:38,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {20#false} assume 6 == ~a~0; {20#false} is VALID [2022-04-28 10:33:38,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-04-28 10:33:38,207 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-28 10:33:38,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:38,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84473048] [2022-04-28 10:33:38,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84473048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:38,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:38,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:33:38,211 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:38,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [248667698] [2022-04-28 10:33:38,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [248667698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:38,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:38,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:33:38,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165552284] [2022-04-28 10:33:38,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:38,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 10:33:38,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:38,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:38,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:33:38,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:38,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:33:38,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:33:38,275 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:38,320 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 10:33:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:33:38,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 10:33:38,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-28 10:33:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-28 10:33:38,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-04-28 10:33:38,375 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-28 10:33:38,382 INFO L225 Difference]: With dead ends: 24 [2022-04-28 10:33:38,382 INFO L226 Difference]: Without dead ends: 11 [2022-04-28 10:33:38,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:33:38,391 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:38,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-04-28 10:33:38,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-04-28 10:33:38,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:38,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,425 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,426 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:38,432 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-28 10:33:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-28 10:33:38,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:38,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:38,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11 states. [2022-04-28 10:33:38,433 INFO L87 Difference]: Start difference. First operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11 states. [2022-04-28 10:33:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:38,435 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-28 10:33:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-28 10:33:38,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:38,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:38,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:38,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:38,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-04-28 10:33:38,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-04-28 10:33:38,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:38,443 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-04-28 10:33:38,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 11 transitions. [2022-04-28 10:33:38,470 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-28 10:33:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-28 10:33:38,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 10:33:38,472 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:38,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:38,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:33:38,473 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:38,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:38,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1887999097, now seen corresponding path program 1 times [2022-04-28 10:33:38,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:38,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [608640903] [2022-04-28 10:33:38,481 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:33:38,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1887999097, now seen corresponding path program 2 times [2022-04-28 10:33:38,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:38,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915754402] [2022-04-28 10:33:38,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:38,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:38,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:38,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {125#(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(12, 2);call #Ultimate.allocInit(12, 3); {119#true} is VALID [2022-04-28 10:33:38,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {119#true} assume true; {119#true} is VALID [2022-04-28 10:33:38,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {119#true} {119#true} #32#return; {119#true} is VALID [2022-04-28 10:33:38,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {119#true} call ULTIMATE.init(); {125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:38,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {125#(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(12, 2);call #Ultimate.allocInit(12, 3); {119#true} is VALID [2022-04-28 10:33:38,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {119#true} assume true; {119#true} is VALID [2022-04-28 10:33:38,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119#true} {119#true} #32#return; {119#true} is VALID [2022-04-28 10:33:38,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {119#true} call #t~ret5 := main(); {119#true} is VALID [2022-04-28 10:33:38,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {119#true} ~a~0 := 6;~a~0 := 0; {124#(= main_~a~0 0)} is VALID [2022-04-28 10:33:38,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {124#(= main_~a~0 0)} assume !(~a~0 < 6); {120#false} is VALID [2022-04-28 10:33:38,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {120#false} assume 6 == ~a~0; {120#false} is VALID [2022-04-28 10:33:38,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {120#false} assume !false; {120#false} is VALID [2022-04-28 10:33:38,612 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-28 10:33:38,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:38,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915754402] [2022-04-28 10:33:38,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915754402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:38,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:38,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:33:38,613 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:38,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [608640903] [2022-04-28 10:33:38,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [608640903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:38,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:38,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:33:38,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697220292] [2022-04-28 10:33:38,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:38,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 10:33:38,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:38,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:38,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:33:38,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:38,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:33:38,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:33:38,641 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:38,712 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 10:33:38,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:33:38,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 10:33:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-04-28 10:33:38,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-04-28 10:33:38,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2022-04-28 10:33:38,745 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-28 10:33:38,747 INFO L225 Difference]: With dead ends: 16 [2022-04-28 10:33:38,747 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 10:33:38,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:33:38,748 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:38,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 16 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:38,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 10:33:38,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-04-28 10:33:38,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:38,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,753 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,753 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:38,755 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 10:33:38,755 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 10:33:38,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:38,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:38,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 10:33:38,756 INFO L87 Difference]: Start difference. First operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 10:33:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:38,758 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 10:33:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 10:33:38,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:38,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:38,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:38,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-28 10:33:38,764 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2022-04-28 10:33:38,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:38,764 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-28 10:33:38,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:38,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-28 10:33:38,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 10:33:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 10:33:38,790 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:38,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:38,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:33:38,792 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:38,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:38,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1889274843, now seen corresponding path program 1 times [2022-04-28 10:33:38,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:38,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [449346248] [2022-04-28 10:33:38,812 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:38,812 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:38,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1889274843, now seen corresponding path program 2 times [2022-04-28 10:33:38,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:38,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433403430] [2022-04-28 10:33:38,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:38,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:38,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:38,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#(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(12, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-28 10:33:38,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-28 10:33:38,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {212#true} {212#true} #32#return; {212#true} is VALID [2022-04-28 10:33:38,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:38,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#(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(12, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-28 10:33:38,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-28 10:33:38,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #32#return; {212#true} is VALID [2022-04-28 10:33:38,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret5 := main(); {212#true} is VALID [2022-04-28 10:33:38,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~a~0 := 6;~a~0 := 0; {217#(= main_~a~0 0)} is VALID [2022-04-28 10:33:38,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(= main_~a~0 0)} assume !!(~a~0 < 6); {217#(= main_~a~0 0)} is VALID [2022-04-28 10:33:38,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {218#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:38,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(<= main_~a~0 1)} assume !(~a~0 < 6); {213#false} is VALID [2022-04-28 10:33:38,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#false} assume 6 == ~a~0; {213#false} is VALID [2022-04-28 10:33:38,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-28 10:33:38,906 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-28 10:33:38,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:38,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433403430] [2022-04-28 10:33:38,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433403430] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:38,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713808975] [2022-04-28 10:33:38,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:33:38,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:38,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:38,918 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-28 10:33:38,925 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-28 10:33:38,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:33:38,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:38,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 10:33:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:38,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:39,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2022-04-28 10:33:39,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#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(12, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-28 10:33:39,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-28 10:33:39,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #32#return; {212#true} is VALID [2022-04-28 10:33:39,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret5 := main(); {212#true} is VALID [2022-04-28 10:33:39,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~a~0 := 6;~a~0 := 0; {238#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:39,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {238#(<= main_~a~0 0)} assume !!(~a~0 < 6); {238#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:39,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {238#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {218#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:39,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(<= main_~a~0 1)} assume !(~a~0 < 6); {213#false} is VALID [2022-04-28 10:33:39,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#false} assume 6 == ~a~0; {213#false} is VALID [2022-04-28 10:33:39,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-28 10:33:39,071 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-28 10:33:39,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:39,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-28 10:33:39,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#false} assume 6 == ~a~0; {213#false} is VALID [2022-04-28 10:33:39,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {260#(< main_~a~0 6)} assume !(~a~0 < 6); {213#false} is VALID [2022-04-28 10:33:39,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {260#(< main_~a~0 6)} is VALID [2022-04-28 10:33:39,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {264#(< main_~a~0 5)} assume !!(~a~0 < 6); {264#(< main_~a~0 5)} is VALID [2022-04-28 10:33:39,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~a~0 := 6;~a~0 := 0; {264#(< main_~a~0 5)} is VALID [2022-04-28 10:33:39,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret5 := main(); {212#true} is VALID [2022-04-28 10:33:39,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #32#return; {212#true} is VALID [2022-04-28 10:33:39,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-28 10:33:39,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#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(12, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-28 10:33:39,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2022-04-28 10:33:39,188 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-28 10:33:39,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713808975] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:39,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:39,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 10:33:39,190 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:39,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [449346248] [2022-04-28 10:33:39,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [449346248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:39,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:39,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:33:39,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358624923] [2022-04-28 10:33:39,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:39,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 10:33:39,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:39,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:39,202 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-28 10:33:39,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:33:39,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:39,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:33:39,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:33:39,204 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:39,306 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 10:33:39,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:33:39,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 10:33:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-04-28 10:33:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-04-28 10:33:39,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2022-04-28 10:33:39,339 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-28 10:33:39,341 INFO L225 Difference]: With dead ends: 18 [2022-04-28 10:33:39,341 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 10:33:39,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 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-28 10:33:39,349 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:39,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 16 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:39,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 10:33:39,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-28 10:33:39,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:39,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:39,362 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:39,363 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:39,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:39,365 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 10:33:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 10:33:39,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:39,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:39,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 10:33:39,366 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 10:33:39,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:39,369 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 10:33:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 10:33:39,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:39,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:39,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:39,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 10:33:39,371 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2022-04-28 10:33:39,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:39,371 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 10:33:39,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:39,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 10:33:39,386 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-28 10:33:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 10:33:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 10:33:39,387 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:39,387 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:39,419 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-28 10:33:39,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:39,600 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:39,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:39,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1179700547, now seen corresponding path program 3 times [2022-04-28 10:33:39,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:39,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1366917973] [2022-04-28 10:33:39,610 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:39,610 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:39,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1179700547, now seen corresponding path program 4 times [2022-04-28 10:33:39,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:39,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447854667] [2022-04-28 10:33:39,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:39,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:39,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:39,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {394#(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(12, 2);call #Ultimate.allocInit(12, 3); {386#true} is VALID [2022-04-28 10:33:39,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#true} assume true; {386#true} is VALID [2022-04-28 10:33:39,703 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {386#true} {386#true} #32#return; {386#true} is VALID [2022-04-28 10:33:39,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:39,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#(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(12, 2);call #Ultimate.allocInit(12, 3); {386#true} is VALID [2022-04-28 10:33:39,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2022-04-28 10:33:39,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #32#return; {386#true} is VALID [2022-04-28 10:33:39,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret5 := main(); {386#true} is VALID [2022-04-28 10:33:39,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {386#true} ~a~0 := 6;~a~0 := 0; {391#(= main_~a~0 0)} is VALID [2022-04-28 10:33:39,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {391#(= main_~a~0 0)} assume !!(~a~0 < 6); {391#(= main_~a~0 0)} is VALID [2022-04-28 10:33:39,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {391#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {392#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:39,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#(<= main_~a~0 1)} assume !!(~a~0 < 6); {392#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:39,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {393#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:39,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {393#(<= main_~a~0 2)} assume !(~a~0 < 6); {387#false} is VALID [2022-04-28 10:33:39,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {387#false} assume 6 == ~a~0; {387#false} is VALID [2022-04-28 10:33:39,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {387#false} assume !false; {387#false} is VALID [2022-04-28 10:33:39,711 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-28 10:33:39,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:39,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447854667] [2022-04-28 10:33:39,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447854667] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:39,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260285144] [2022-04-28 10:33:39,712 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:33:39,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:39,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:39,713 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-28 10:33:39,716 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-28 10:33:39,745 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:33:39,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:39,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 10:33:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:39,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:39,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {386#true} is VALID [2022-04-28 10:33:39,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#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(12, 2);call #Ultimate.allocInit(12, 3); {386#true} is VALID [2022-04-28 10:33:39,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2022-04-28 10:33:39,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #32#return; {386#true} is VALID [2022-04-28 10:33:39,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret5 := main(); {386#true} is VALID [2022-04-28 10:33:39,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {386#true} ~a~0 := 6;~a~0 := 0; {413#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:39,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {413#(<= main_~a~0 0)} assume !!(~a~0 < 6); {413#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:39,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {413#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {392#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:39,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#(<= main_~a~0 1)} assume !!(~a~0 < 6); {392#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:39,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {393#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:39,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {393#(<= main_~a~0 2)} assume !(~a~0 < 6); {387#false} is VALID [2022-04-28 10:33:39,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {387#false} assume 6 == ~a~0; {387#false} is VALID [2022-04-28 10:33:39,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {387#false} assume !false; {387#false} is VALID [2022-04-28 10:33:39,848 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-28 10:33:39,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:39,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {387#false} assume !false; {387#false} is VALID [2022-04-28 10:33:39,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {387#false} assume 6 == ~a~0; {387#false} is VALID [2022-04-28 10:33:39,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {441#(< main_~a~0 6)} assume !(~a~0 < 6); {387#false} is VALID [2022-04-28 10:33:39,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {445#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {441#(< main_~a~0 6)} is VALID [2022-04-28 10:33:39,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {445#(< main_~a~0 5)} assume !!(~a~0 < 6); {445#(< main_~a~0 5)} is VALID [2022-04-28 10:33:39,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#(< main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {445#(< main_~a~0 5)} is VALID [2022-04-28 10:33:39,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {452#(< main_~a~0 4)} assume !!(~a~0 < 6); {452#(< main_~a~0 4)} is VALID [2022-04-28 10:33:39,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {386#true} ~a~0 := 6;~a~0 := 0; {452#(< main_~a~0 4)} is VALID [2022-04-28 10:33:39,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret5 := main(); {386#true} is VALID [2022-04-28 10:33:39,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #32#return; {386#true} is VALID [2022-04-28 10:33:39,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2022-04-28 10:33:39,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#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(12, 2);call #Ultimate.allocInit(12, 3); {386#true} is VALID [2022-04-28 10:33:39,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {386#true} is VALID [2022-04-28 10:33:39,959 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-28 10:33:39,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260285144] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:39,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:39,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 10:33:39,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:39,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1366917973] [2022-04-28 10:33:39,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1366917973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:39,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:39,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:33:39,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675983081] [2022-04-28 10:33:39,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:39,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 10:33:39,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:39,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:39,974 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-28 10:33:39,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:33:39,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:39,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:33:39,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:39,976 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:40,073 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 10:33:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:33:40,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 10:33:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 10:33:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 10:33:40,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-28 10:33:40,097 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-28 10:33:40,098 INFO L225 Difference]: With dead ends: 20 [2022-04-28 10:33:40,098 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 10:33:40,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:33:40,100 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:40,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 10:33:40,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-28 10:33:40,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:40,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,110 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,110 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:40,113 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 10:33:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 10:33:40,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:40,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:40,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:33:40,113 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:33:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:40,120 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 10:33:40,120 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 10:33:40,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:40,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:40,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:40,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 10:33:40,122 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2022-04-28 10:33:40,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:40,122 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 10:33:40,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 10:33:40,141 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-28 10:33:40,142 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 10:33:40,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:33:40,142 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:40,142 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:40,166 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-28 10:33:40,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 10:33:40,355 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:40,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:40,356 INFO L85 PathProgramCache]: Analyzing trace with hash -177482015, now seen corresponding path program 5 times [2022-04-28 10:33:40,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:40,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [219211378] [2022-04-28 10:33:40,359 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:40,359 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:40,360 INFO L85 PathProgramCache]: Analyzing trace with hash -177482015, now seen corresponding path program 6 times [2022-04-28 10:33:40,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:40,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697555721] [2022-04-28 10:33:40,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:40,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:40,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:40,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#(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(12, 2);call #Ultimate.allocInit(12, 3); {588#true} is VALID [2022-04-28 10:33:40,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-28 10:33:40,427 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {588#true} {588#true} #32#return; {588#true} is VALID [2022-04-28 10:33:40,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:40,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#(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(12, 2);call #Ultimate.allocInit(12, 3); {588#true} is VALID [2022-04-28 10:33:40,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-28 10:33:40,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #32#return; {588#true} is VALID [2022-04-28 10:33:40,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret5 := main(); {588#true} is VALID [2022-04-28 10:33:40,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#true} ~a~0 := 6;~a~0 := 0; {593#(= main_~a~0 0)} is VALID [2022-04-28 10:33:40,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {593#(= main_~a~0 0)} assume !!(~a~0 < 6); {593#(= main_~a~0 0)} is VALID [2022-04-28 10:33:40,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {593#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {594#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:40,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {594#(<= main_~a~0 1)} assume !!(~a~0 < 6); {594#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:40,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {595#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:40,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#(<= main_~a~0 2)} assume !!(~a~0 < 6); {595#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:40,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {596#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:40,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {596#(<= main_~a~0 3)} assume !(~a~0 < 6); {589#false} is VALID [2022-04-28 10:33:40,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {589#false} assume 6 == ~a~0; {589#false} is VALID [2022-04-28 10:33:40,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#false} assume !false; {589#false} is VALID [2022-04-28 10:33:40,433 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-28 10:33:40,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:40,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697555721] [2022-04-28 10:33:40,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697555721] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:40,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967455075] [2022-04-28 10:33:40,434 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:33:40,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:40,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:40,435 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-28 10:33:40,460 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-28 10:33:40,481 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:33:40,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:40,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 10:33:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:40,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:40,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {588#true} is VALID [2022-04-28 10:33:40,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {588#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(12, 2);call #Ultimate.allocInit(12, 3); {588#true} is VALID [2022-04-28 10:33:40,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-28 10:33:40,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #32#return; {588#true} is VALID [2022-04-28 10:33:40,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret5 := main(); {588#true} is VALID [2022-04-28 10:33:40,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#true} ~a~0 := 6;~a~0 := 0; {616#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:40,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {616#(<= main_~a~0 0)} assume !!(~a~0 < 6); {616#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:40,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {594#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:40,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {594#(<= main_~a~0 1)} assume !!(~a~0 < 6); {594#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:40,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {595#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:40,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#(<= main_~a~0 2)} assume !!(~a~0 < 6); {595#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:40,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {596#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:40,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {596#(<= main_~a~0 3)} assume !(~a~0 < 6); {589#false} is VALID [2022-04-28 10:33:40,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {589#false} assume 6 == ~a~0; {589#false} is VALID [2022-04-28 10:33:40,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#false} assume !false; {589#false} is VALID [2022-04-28 10:33:40,585 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-28 10:33:40,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:40,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#false} assume !false; {589#false} is VALID [2022-04-28 10:33:40,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {589#false} assume 6 == ~a~0; {589#false} is VALID [2022-04-28 10:33:40,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {650#(< main_~a~0 6)} assume !(~a~0 < 6); {589#false} is VALID [2022-04-28 10:33:40,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {654#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {650#(< main_~a~0 6)} is VALID [2022-04-28 10:33:40,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {654#(< main_~a~0 5)} assume !!(~a~0 < 6); {654#(< main_~a~0 5)} is VALID [2022-04-28 10:33:40,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#(<= main_~a~0 3)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {654#(< main_~a~0 5)} is VALID [2022-04-28 10:33:40,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#(<= main_~a~0 3)} assume !!(~a~0 < 6); {596#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:40,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {595#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {596#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:40,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#(<= main_~a~0 2)} assume !!(~a~0 < 6); {595#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:40,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#true} ~a~0 := 6;~a~0 := 0; {595#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:40,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret5 := main(); {588#true} is VALID [2022-04-28 10:33:40,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #32#return; {588#true} is VALID [2022-04-28 10:33:40,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-28 10:33:40,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {588#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(12, 2);call #Ultimate.allocInit(12, 3); {588#true} is VALID [2022-04-28 10:33:40,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {588#true} is VALID [2022-04-28 10:33:40,688 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-28 10:33:40,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967455075] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:40,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:40,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-28 10:33:40,689 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:40,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [219211378] [2022-04-28 10:33:40,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [219211378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:40,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:40,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:33:40,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233489629] [2022-04-28 10:33:40,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:40,690 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:33:40,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:40,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,701 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-28 10:33:40,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:33:40,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:40,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:33:40,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:40,702 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:40,804 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 10:33:40,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:33:40,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:33:40,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2022-04-28 10:33:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2022-04-28 10:33:40,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 22 transitions. [2022-04-28 10:33:40,827 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-28 10:33:40,828 INFO L225 Difference]: With dead ends: 22 [2022-04-28 10:33:40,828 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 10:33:40,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:33:40,829 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:40,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 26 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 10:33:40,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-28 10:33:40,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:40,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,838 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,838 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:40,839 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 10:33:40,840 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 10:33:40,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:40,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:40,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 10:33:40,840 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 10:33:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:40,841 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 10:33:40,841 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 10:33:40,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:40,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:40,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:40,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-28 10:33:40,843 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2022-04-28 10:33:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:40,843 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-28 10:33:40,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:40,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-28 10:33:40,858 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-28 10:33:40,858 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 10:33:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:33:40,858 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:40,859 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:40,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 10:33:41,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:41,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:41,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:41,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1240133887, now seen corresponding path program 7 times [2022-04-28 10:33:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:41,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [447423109] [2022-04-28 10:33:41,077 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:41,077 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:41,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1240133887, now seen corresponding path program 8 times [2022-04-28 10:33:41,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:41,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160211247] [2022-04-28 10:33:41,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:41,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:41,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:41,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {826#(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(12, 2);call #Ultimate.allocInit(12, 3); {816#true} is VALID [2022-04-28 10:33:41,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#true} assume true; {816#true} is VALID [2022-04-28 10:33:41,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {816#true} {816#true} #32#return; {816#true} is VALID [2022-04-28 10:33:41,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {826#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:41,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {826#(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(12, 2);call #Ultimate.allocInit(12, 3); {816#true} is VALID [2022-04-28 10:33:41,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2022-04-28 10:33:41,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #32#return; {816#true} is VALID [2022-04-28 10:33:41,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret5 := main(); {816#true} is VALID [2022-04-28 10:33:41,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#true} ~a~0 := 6;~a~0 := 0; {821#(= main_~a~0 0)} is VALID [2022-04-28 10:33:41,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {821#(= main_~a~0 0)} assume !!(~a~0 < 6); {821#(= main_~a~0 0)} is VALID [2022-04-28 10:33:41,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {821#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {822#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:41,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#(<= main_~a~0 1)} assume !!(~a~0 < 6); {822#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:41,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {823#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:41,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {823#(<= main_~a~0 2)} assume !!(~a~0 < 6); {823#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:41,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {823#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {824#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:41,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {824#(<= main_~a~0 3)} assume !!(~a~0 < 6); {824#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:41,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {824#(<= main_~a~0 3)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {825#(<= main_~a~0 4)} is VALID [2022-04-28 10:33:41,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {825#(<= main_~a~0 4)} assume !(~a~0 < 6); {817#false} is VALID [2022-04-28 10:33:41,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {817#false} assume 6 == ~a~0; {817#false} is VALID [2022-04-28 10:33:41,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {817#false} assume !false; {817#false} is VALID [2022-04-28 10:33:41,143 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-28 10:33:41,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:41,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160211247] [2022-04-28 10:33:41,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160211247] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:41,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129799158] [2022-04-28 10:33:41,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:33:41,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:41,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:41,144 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-28 10:33:41,156 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-28 10:33:41,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:33:41,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:41,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 10:33:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:41,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:41,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {816#true} is VALID [2022-04-28 10:33:41,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#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(12, 2);call #Ultimate.allocInit(12, 3); {816#true} is VALID [2022-04-28 10:33:41,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2022-04-28 10:33:41,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #32#return; {816#true} is VALID [2022-04-28 10:33:41,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret5 := main(); {816#true} is VALID [2022-04-28 10:33:41,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#true} ~a~0 := 6;~a~0 := 0; {845#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:41,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {845#(<= main_~a~0 0)} assume !!(~a~0 < 6); {845#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:41,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {845#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {822#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:41,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#(<= main_~a~0 1)} assume !!(~a~0 < 6); {822#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:41,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {823#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:41,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {823#(<= main_~a~0 2)} assume !!(~a~0 < 6); {823#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:41,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {823#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {824#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:41,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {824#(<= main_~a~0 3)} assume !!(~a~0 < 6); {824#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:41,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {824#(<= main_~a~0 3)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {825#(<= main_~a~0 4)} is VALID [2022-04-28 10:33:41,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {825#(<= main_~a~0 4)} assume !(~a~0 < 6); {817#false} is VALID [2022-04-28 10:33:41,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {817#false} assume 6 == ~a~0; {817#false} is VALID [2022-04-28 10:33:41,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {817#false} assume !false; {817#false} is VALID [2022-04-28 10:33:41,299 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-28 10:33:41,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:41,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {817#false} assume !false; {817#false} is VALID [2022-04-28 10:33:41,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {817#false} assume 6 == ~a~0; {817#false} is VALID [2022-04-28 10:33:41,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {885#(< main_~a~0 6)} assume !(~a~0 < 6); {817#false} is VALID [2022-04-28 10:33:41,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {825#(<= main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {885#(< main_~a~0 6)} is VALID [2022-04-28 10:33:41,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {825#(<= main_~a~0 4)} assume !!(~a~0 < 6); {825#(<= main_~a~0 4)} is VALID [2022-04-28 10:33:41,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {824#(<= main_~a~0 3)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {825#(<= main_~a~0 4)} is VALID [2022-04-28 10:33:41,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {824#(<= main_~a~0 3)} assume !!(~a~0 < 6); {824#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:41,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {823#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {824#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:41,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {823#(<= main_~a~0 2)} assume !!(~a~0 < 6); {823#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:41,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {823#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:41,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {822#(<= main_~a~0 1)} assume !!(~a~0 < 6); {822#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:41,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#true} ~a~0 := 6;~a~0 := 0; {822#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:41,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret5 := main(); {816#true} is VALID [2022-04-28 10:33:41,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #32#return; {816#true} is VALID [2022-04-28 10:33:41,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2022-04-28 10:33:41,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#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(12, 2);call #Ultimate.allocInit(12, 3); {816#true} is VALID [2022-04-28 10:33:41,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {816#true} is VALID [2022-04-28 10:33:41,436 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-28 10:33:41,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129799158] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:41,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:41,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-28 10:33:41,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:41,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [447423109] [2022-04-28 10:33:41,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [447423109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:41,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:41,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:33:41,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61294289] [2022-04-28 10:33:41,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:41,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:33:41,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:41,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,455 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-28 10:33:41,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:33:41,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:41,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:33:41,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:41,456 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:41,574 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 10:33:41,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:33:41,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:33:41,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-04-28 10:33:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-04-28 10:33:41,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 24 transitions. [2022-04-28 10:33:41,599 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-28 10:33:41,601 INFO L225 Difference]: With dead ends: 24 [2022-04-28 10:33:41,601 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 10:33:41,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:33:41,603 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:41,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:41,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 10:33:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-28 10:33:41,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:41,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,616 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,616 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:41,618 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 10:33:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 10:33:41,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:41,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:41,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:33:41,619 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:33:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:41,620 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 10:33:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 10:33:41,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:41,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:41,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:41,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-28 10:33:41,626 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2022-04-28 10:33:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:41,627 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-28 10:33:41,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:41,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-28 10:33:41,648 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-28 10:33:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 10:33:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:33:41,649 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:41,649 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:41,668 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-28 10:33:41,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:41,859 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:41,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2064382877, now seen corresponding path program 9 times [2022-04-28 10:33:41,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:41,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [527752175] [2022-04-28 10:33:41,863 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:41,863 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:41,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2064382877, now seen corresponding path program 10 times [2022-04-28 10:33:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:41,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97679161] [2022-04-28 10:33:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:41,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:41,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:41,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {1081#(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(12, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-28 10:33:41,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-28 10:33:41,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1070#true} {1070#true} #32#return; {1070#true} is VALID [2022-04-28 10:33:41,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:41,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {1081#(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(12, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-28 10:33:41,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-28 10:33:41,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1070#true} #32#return; {1070#true} is VALID [2022-04-28 10:33:41,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {1070#true} call #t~ret5 := main(); {1070#true} is VALID [2022-04-28 10:33:41,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#true} ~a~0 := 6;~a~0 := 0; {1075#(= main_~a~0 0)} is VALID [2022-04-28 10:33:41,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {1075#(= main_~a~0 0)} assume !!(~a~0 < 6); {1075#(= main_~a~0 0)} is VALID [2022-04-28 10:33:41,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {1075#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1076#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:41,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {1076#(<= main_~a~0 1)} assume !!(~a~0 < 6); {1076#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:41,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1077#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:41,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(<= main_~a~0 2)} assume !!(~a~0 < 6); {1077#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:41,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {1077#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1078#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:41,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {1078#(<= main_~a~0 3)} assume !!(~a~0 < 6); {1078#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:41,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {1078#(<= main_~a~0 3)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1079#(<= main_~a~0 4)} is VALID [2022-04-28 10:33:41,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(<= main_~a~0 4)} assume !!(~a~0 < 6); {1079#(<= main_~a~0 4)} is VALID [2022-04-28 10:33:41,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {1079#(<= main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1080#(<= main_~a~0 5)} is VALID [2022-04-28 10:33:41,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {1080#(<= main_~a~0 5)} assume !(~a~0 < 6); {1071#false} is VALID [2022-04-28 10:33:41,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {1071#false} assume 6 == ~a~0; {1071#false} is VALID [2022-04-28 10:33:41,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-28 10:33:41,947 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-28 10:33:41,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:41,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97679161] [2022-04-28 10:33:41,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97679161] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:41,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108348677] [2022-04-28 10:33:41,947 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:33:41,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:41,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:41,948 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-28 10:33:41,958 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-28 10:33:41,985 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:33:41,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:41,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:33:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:41,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:42,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1070#true} is VALID [2022-04-28 10:33:42,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#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(12, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-28 10:33:42,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-28 10:33:42,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1070#true} #32#return; {1070#true} is VALID [2022-04-28 10:33:42,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {1070#true} call #t~ret5 := main(); {1070#true} is VALID [2022-04-28 10:33:42,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#true} ~a~0 := 6;~a~0 := 0; {1100#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:42,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {1100#(<= main_~a~0 0)} assume !!(~a~0 < 6); {1100#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:42,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {1100#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1076#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:42,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {1076#(<= main_~a~0 1)} assume !!(~a~0 < 6); {1076#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:42,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1077#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:42,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(<= main_~a~0 2)} assume !!(~a~0 < 6); {1077#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:42,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {1077#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1078#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:42,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {1078#(<= main_~a~0 3)} assume !!(~a~0 < 6); {1078#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:42,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {1078#(<= main_~a~0 3)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1079#(<= main_~a~0 4)} is VALID [2022-04-28 10:33:42,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(<= main_~a~0 4)} assume !!(~a~0 < 6); {1079#(<= main_~a~0 4)} is VALID [2022-04-28 10:33:42,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {1079#(<= main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1080#(<= main_~a~0 5)} is VALID [2022-04-28 10:33:42,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {1080#(<= main_~a~0 5)} assume !(~a~0 < 6); {1071#false} is VALID [2022-04-28 10:33:42,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {1071#false} assume 6 == ~a~0; {1071#false} is VALID [2022-04-28 10:33:42,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-28 10:33:42,112 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-28 10:33:42,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:42,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-28 10:33:42,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {1071#false} assume 6 == ~a~0; {1071#false} is VALID [2022-04-28 10:33:42,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {1080#(<= main_~a~0 5)} assume !(~a~0 < 6); {1071#false} is VALID [2022-04-28 10:33:42,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {1079#(<= main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1080#(<= main_~a~0 5)} is VALID [2022-04-28 10:33:42,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(<= main_~a~0 4)} assume !!(~a~0 < 6); {1079#(<= main_~a~0 4)} is VALID [2022-04-28 10:33:42,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {1078#(<= main_~a~0 3)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1079#(<= main_~a~0 4)} is VALID [2022-04-28 10:33:42,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {1078#(<= main_~a~0 3)} assume !!(~a~0 < 6); {1078#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:42,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {1077#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1078#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:42,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(<= main_~a~0 2)} assume !!(~a~0 < 6); {1077#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:42,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1077#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:42,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {1076#(<= main_~a~0 1)} assume !!(~a~0 < 6); {1076#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:42,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {1100#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1076#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:42,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {1100#(<= main_~a~0 0)} assume !!(~a~0 < 6); {1100#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:42,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#true} ~a~0 := 6;~a~0 := 0; {1100#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:42,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {1070#true} call #t~ret5 := main(); {1070#true} is VALID [2022-04-28 10:33:42,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1070#true} #32#return; {1070#true} is VALID [2022-04-28 10:33:42,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-28 10:33:42,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#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(12, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-28 10:33:42,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1070#true} is VALID [2022-04-28 10:33:42,229 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-28 10:33:42,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108348677] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:42,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:42,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2022-04-28 10:33:42,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:42,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [527752175] [2022-04-28 10:33:42,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [527752175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:42,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:42,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:33:42,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950285763] [2022-04-28 10:33:42,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:42,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 10:33:42,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:42,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:42,245 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-28 10:33:42,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:33:42,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:42,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:33:42,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:42,246 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:42,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:42,371 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 10:33:42,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:33:42,372 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 10:33:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:42,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2022-04-28 10:33:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2022-04-28 10:33:42,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 25 transitions. [2022-04-28 10:33:42,393 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-28 10:33:42,394 INFO L225 Difference]: With dead ends: 25 [2022-04-28 10:33:42,394 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 10:33:42,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:33:42,395 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:42,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 21 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:42,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 10:33:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 10:33:42,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:42,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:42,408 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:42,408 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:42,409 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 10:33:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 10:33:42,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:42,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:42,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 10:33:42,410 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 10:33:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:42,411 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 10:33:42,411 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 10:33:42,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:42,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:42,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:42,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-28 10:33:42,412 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2022-04-28 10:33:42,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:42,412 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-28 10:33:42,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:42,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-28 10:33:42,430 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-28 10:33:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 10:33:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:33:42,431 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:42,431 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:42,458 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-28 10:33:42,647 WARN L477 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-28 10:33:42,648 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:42,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:42,648 INFO L85 PathProgramCache]: Analyzing trace with hash -401287493, now seen corresponding path program 11 times [2022-04-28 10:33:42,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:42,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [918220017] [2022-04-28 10:33:42,652 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:42,652 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:42,652 INFO L85 PathProgramCache]: Analyzing trace with hash -401287493, now seen corresponding path program 12 times [2022-04-28 10:33:42,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:42,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396803571] [2022-04-28 10:33:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:42,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 10:33:42,665 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 10:33:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 10:33:42,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 10:33:42,684 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 10:33:42,684 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 10:33:42,686 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:33:42,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 10:33:42,690 INFO L356 BasicCegarLoop]: Path program histogram: [12, 2, 2] [2022-04-28 10:33:42,693 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:33:42,702 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:33:42,702 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 10:33:42,702 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 10:33:42,702 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 10:33:42,702 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 10:33:42,702 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 10:33:42,702 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 10:33:42,702 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 10:33:42,702 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 10:33:42,702 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-04-28 10:33:42,702 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-04-28 10:33:42,702 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-04-28 10:33:42,702 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 10:33:42,702 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 10:33:42,702 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2022-04-28 10:33:42,702 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2022-04-28 10:33:42,703 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-28 10:33:42,703 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-28 10:33:42,703 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-28 10:33:42,703 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-04-28 10:33:42,703 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 10:33:42,703 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 10:33:42,703 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:33:42,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:33:42 BoogieIcfgContainer [2022-04-28 10:33:42,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:33:42,705 INFO L158 Benchmark]: Toolchain (without parser) took 5342.67ms. Allocated memory was 194.0MB in the beginning and 260.0MB in the end (delta: 66.1MB). Free memory was 146.1MB in the beginning and 154.6MB in the end (delta: -8.5MB). Peak memory consumption was 58.9MB. Max. memory is 8.0GB. [2022-04-28 10:33:42,705 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 194.0MB. Free memory was 162.2MB in the beginning and 162.1MB in the end (delta: 70.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:33:42,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.83ms. Allocated memory is still 194.0MB. Free memory was 145.9MB in the beginning and 170.5MB in the end (delta: -24.7MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-28 10:33:42,706 INFO L158 Benchmark]: Boogie Preprocessor took 22.88ms. Allocated memory is still 194.0MB. Free memory was 170.5MB in the beginning and 169.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 10:33:42,706 INFO L158 Benchmark]: RCFGBuilder took 257.62ms. Allocated memory is still 194.0MB. Free memory was 169.3MB in the beginning and 159.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-28 10:33:42,706 INFO L158 Benchmark]: TraceAbstraction took 4836.55ms. Allocated memory was 194.0MB in the beginning and 260.0MB in the end (delta: 66.1MB). Free memory was 159.4MB in the beginning and 154.6MB in the end (delta: 4.8MB). Peak memory consumption was 71.8MB. Max. memory is 8.0GB. [2022-04-28 10:33:42,707 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.15ms. Allocated memory is still 194.0MB. Free memory was 162.2MB in the beginning and 162.1MB in the end (delta: 70.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.83ms. Allocated memory is still 194.0MB. Free memory was 145.9MB in the beginning and 170.5MB in the end (delta: -24.7MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.88ms. Allocated memory is still 194.0MB. Free memory was 170.5MB in the beginning and 169.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 257.62ms. Allocated memory is still 194.0MB. Free memory was 169.3MB in the beginning and 159.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 4836.55ms. Allocated memory was 194.0MB in the beginning and 260.0MB in the end (delta: 66.1MB). Free memory was 159.4MB in the beginning and 154.6MB in the end (delta: 4.8MB). Peak memory consumption was 71.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 23]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int a = 6; [L19] a = 0 [L19] COND TRUE a < 6 [L19] ++a [L19] COND TRUE a < 6 [L19] ++a [L19] COND TRUE a < 6 [L19] ++a [L19] COND TRUE a < 6 [L19] ++a [L19] COND TRUE a < 6 [L19] ++a [L19] COND TRUE a < 6 [L19] ++a [L19] COND FALSE !(a < 6) [L22] COND TRUE a == 6 [L23] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 150 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 70 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 151 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-28 10:33:42,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...