/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_2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:33:45,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:33:45,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:33:45,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:33:45,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:33:45,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:33:45,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:33:45,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:33:45,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:33:45,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:33:45,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:33:45,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:33:45,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:33:45,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:33:45,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:33:45,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:33:45,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:33:45,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:33:45,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:33:45,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:33:45,201 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:33:45,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:33:45,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:33:45,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:33:45,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:33:45,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:33:45,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:33:45,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:33:45,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:33:45,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:33:45,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:33:45,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:33:45,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:33:45,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:33:45,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:33:45,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:33:45,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:33:45,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:33:45,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:33:45,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:33:45,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:33:45,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:33:45,215 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:45,225 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:33:45,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:33:45,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:33:45,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:33:45,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:33:45,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:33:45,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:33:45,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:33:45,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:33:45,227 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:33:45,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:33:45,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:33:45,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:33:45,227 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:33:45,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:33:45,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:33:45,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:33:45,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:33:45,228 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:33:45,228 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:33:45,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:33:45,228 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:33:45,228 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:45,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:33:45,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:33:45,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:33:45,426 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:33:45,426 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:33:45,427 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_2.c [2022-04-28 10:33:45,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d73675a1/3cc560f6c46d44a5abbe7f16efcd8114/FLAGd94a8d9d0 [2022-04-28 10:33:45,804 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:33:45,805 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_2.c [2022-04-28 10:33:45,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d73675a1/3cc560f6c46d44a5abbe7f16efcd8114/FLAGd94a8d9d0 [2022-04-28 10:33:45,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d73675a1/3cc560f6c46d44a5abbe7f16efcd8114 [2022-04-28 10:33:45,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:33:45,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:33:45,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:33:45,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:33:45,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:33:45,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:33:45" (1/1) ... [2022-04-28 10:33:45,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7151cda2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:45, skipping insertion in model container [2022-04-28 10:33:45,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:33:45" (1/1) ... [2022-04-28 10:33:45,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:33:45,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:33:45,991 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_2.c[730,743] [2022-04-28 10:33:45,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:33:46,008 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:33:46,018 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_2.c[730,743] [2022-04-28 10:33:46,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:33:46,030 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:33:46,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:46 WrapperNode [2022-04-28 10:33:46,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:33:46,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:33:46,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:33:46,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:33:46,038 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:46" (1/1) ... [2022-04-28 10:33:46,038 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:46" (1/1) ... [2022-04-28 10:33:46,043 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:46" (1/1) ... [2022-04-28 10:33:46,043 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:46" (1/1) ... [2022-04-28 10:33:46,052 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:46" (1/1) ... [2022-04-28 10:33:46,056 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:46" (1/1) ... [2022-04-28 10:33:46,059 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:46" (1/1) ... [2022-04-28 10:33:46,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:33:46,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:33:46,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:33:46,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:33:46,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:46" (1/1) ... [2022-04-28 10:33:46,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:33:46,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:46,084 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:46,092 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:46,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:33:46,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:33:46,111 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:33:46,111 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:33:46,111 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:33:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:33:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:33:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:33:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:33:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:33:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:33:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:33:46,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:33:46,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:33:46,156 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:33:46,157 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:33:46,243 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:33:46,262 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:33:46,262 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 10:33:46,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:33:46 BoogieIcfgContainer [2022-04-28 10:33:46,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:33:46,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:33:46,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:33:46,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:33:46,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:33:45" (1/3) ... [2022-04-28 10:33:46,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1325a9b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:33:46, skipping insertion in model container [2022-04-28 10:33:46,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:46" (2/3) ... [2022-04-28 10:33:46,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1325a9b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:33:46, skipping insertion in model container [2022-04-28 10:33:46,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:33:46" (3/3) ... [2022-04-28 10:33:46,279 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_2.c [2022-04-28 10:33:46,288 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:33:46,288 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:33:46,346 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:33:46,350 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@41521df6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@28f78f67 [2022-04-28 10:33:46,350 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:33:46,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 10:33:46,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:46,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:46,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:46,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:46,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1747983725, now seen corresponding path program 1 times [2022-04-28 10:33:46,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:46,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1514489947] [2022-04-28 10:33:46,408 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:33:46,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1747983725, now seen corresponding path program 2 times [2022-04-28 10:33:46,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:46,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227541461] [2022-04-28 10:33:46,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:46,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:46,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:46,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-28 10:33:46,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 10:33:46,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #44#return; {21#true} is VALID [2022-04-28 10:33:46,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:46,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-28 10:33:46,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 10:33:46,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #44#return; {21#true} is VALID [2022-04-28 10:33:46,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret6 := main(); {21#true} is VALID [2022-04-28 10:33:46,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {26#(= main_~a~0 0)} is VALID [2022-04-28 10:33:46,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#(= main_~a~0 0)} assume !(~a~0 < 6); {22#false} is VALID [2022-04-28 10:33:46,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} assume !(6 == ~a~0 && 6 == ~b~0); {22#false} is VALID [2022-04-28 10:33:46,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-28 10:33:46,581 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:46,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:46,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227541461] [2022-04-28 10:33:46,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227541461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:46,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:46,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:33:46,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:46,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1514489947] [2022-04-28 10:33:46,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1514489947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:46,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:46,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:33:46,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153893933] [2022-04-28 10:33:46,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:46,590 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:46,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:46,593 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:46,609 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:46,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:33:46,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:46,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:33:46,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:33:46,624 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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 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:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:46,734 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-28 10:33:46,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:33:46,734 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:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:46,736 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:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-28 10:33:46,746 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:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-28 10:33:46,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-04-28 10:33:46,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:46,809 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:33:46,809 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 10:33:46,810 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:46,813 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:46,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 26 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:46,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 10:33:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2022-04-28 10:33:46,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:46,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:46,841 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:46,841 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:46,849 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 10:33:46,849 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:33:46,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:46,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:46,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:46,851 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:46,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:46,853 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 10:33:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:33:46,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:46,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:46,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:46,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-28 10:33:46,857 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-04-28 10:33:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:46,858 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-28 10:33:46,858 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:46,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-28 10:33:46,880 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:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 10:33:46,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:33:46,881 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:46,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:46,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:33:46,883 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:46,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:46,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1955520686, now seen corresponding path program 1 times [2022-04-28 10:33:46,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:46,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2132365362] [2022-04-28 10:33:46,908 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:46,908 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:46,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1955520686, now seen corresponding path program 2 times [2022-04-28 10:33:46,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:46,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274974285] [2022-04-28 10:33:46,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:46,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:46,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:46,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(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(11, 2);call #Ultimate.allocInit(12, 3); {162#true} is VALID [2022-04-28 10:33:46,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} assume true; {162#true} is VALID [2022-04-28 10:33:46,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {162#true} {162#true} #44#return; {162#true} is VALID [2022-04-28 10:33:46,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {162#true} call ULTIMATE.init(); {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:46,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(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(11, 2);call #Ultimate.allocInit(12, 3); {162#true} is VALID [2022-04-28 10:33:46,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} assume true; {162#true} is VALID [2022-04-28 10:33:46,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162#true} {162#true} #44#return; {162#true} is VALID [2022-04-28 10:33:46,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {162#true} call #t~ret6 := main(); {162#true} is VALID [2022-04-28 10:33:46,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {162#true} is VALID [2022-04-28 10:33:46,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#true} assume !!(~a~0 < 6);~b~0 := 0; {167#(= main_~b~0 0)} is VALID [2022-04-28 10:33:46,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#(= main_~b~0 0)} assume !(~b~0 < 6); {163#false} is VALID [2022-04-28 10:33:46,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {163#false} is VALID [2022-04-28 10:33:46,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#false} assume !(~a~0 < 6); {163#false} is VALID [2022-04-28 10:33:46,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#false} assume !(6 == ~a~0 && 6 == ~b~0); {163#false} is VALID [2022-04-28 10:33:46,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {163#false} assume !false; {163#false} is VALID [2022-04-28 10:33:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:46,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:46,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274974285] [2022-04-28 10:33:46,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274974285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:46,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:46,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:33:46,985 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:46,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2132365362] [2022-04-28 10:33:47,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2132365362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:47,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:47,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:33:47,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318734621] [2022-04-28 10:33:47,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:47,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 12 [2022-04-28 10:33:47,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:47,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:47,012 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:47,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:33:47,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:47,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:33:47,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:33:47,015 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:47,083 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 10:33:47,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:33:47,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 12 [2022-04-28 10:33:47,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-04-28 10:33:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-04-28 10:33:47,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 25 transitions. [2022-04-28 10:33:47,114 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:47,115 INFO L225 Difference]: With dead ends: 23 [2022-04-28 10:33:47,115 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 10:33:47,115 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:47,118 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:47,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 19 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:47,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 10:33:47,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-28 10:33:47,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:47,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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:47,127 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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:47,127 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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:47,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:47,129 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-28 10:33:47,129 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 10:33:47,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:47,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:47,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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 16 states. [2022-04-28 10:33:47,130 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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 16 states. [2022-04-28 10:33:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:47,132 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-28 10:33:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 10:33:47,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:47,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:47,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:47,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 10:33:47,135 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-28 10:33:47,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:47,135 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 10:33:47,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:47,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 10:33:47,148 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:47,149 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 10:33:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 10:33:47,149 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:47,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:47,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:33:47,151 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:47,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash -686991696, now seen corresponding path program 1 times [2022-04-28 10:33:47,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:47,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1040959806] [2022-04-28 10:33:47,171 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:47,182 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:47,183 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:47,183 INFO L85 PathProgramCache]: Analyzing trace with hash -686991696, now seen corresponding path program 2 times [2022-04-28 10:33:47,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:47,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793510766] [2022-04-28 10:33:47,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:47,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:47,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:47,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {288#(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(11, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-28 10:33:47,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-28 10:33:47,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {281#true} {281#true} #44#return; {281#true} is VALID [2022-04-28 10:33:47,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {288#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:47,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#(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(11, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-28 10:33:47,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-28 10:33:47,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {281#true} {281#true} #44#return; {281#true} is VALID [2022-04-28 10:33:47,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {281#true} call #t~ret6 := main(); {281#true} is VALID [2022-04-28 10:33:47,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {281#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {281#true} is VALID [2022-04-28 10:33:47,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {281#true} assume !!(~a~0 < 6);~b~0 := 0; {286#(= main_~b~0 0)} is VALID [2022-04-28 10:33:47,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {286#(= main_~b~0 0)} assume !!(~b~0 < 6); {286#(= main_~b~0 0)} is VALID [2022-04-28 10:33:47,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {286#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {287#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:47,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {287#(<= main_~b~0 1)} assume !(~b~0 < 6); {282#false} is VALID [2022-04-28 10:33:47,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {282#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {282#false} is VALID [2022-04-28 10:33:47,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#false} assume !(~a~0 < 6); {282#false} is VALID [2022-04-28 10:33:47,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#false} assume !(6 == ~a~0 && 6 == ~b~0); {282#false} is VALID [2022-04-28 10:33:47,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-04-28 10:33:47,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:47,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:47,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793510766] [2022-04-28 10:33:47,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793510766] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:47,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363104494] [2022-04-28 10:33:47,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:33:47,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:47,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:47,258 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:47,259 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:47,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:33:47,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:47,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 10:33:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:47,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:47,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {281#true} is VALID [2022-04-28 10:33:47,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#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(11, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-28 10:33:47,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-28 10:33:47,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {281#true} {281#true} #44#return; {281#true} is VALID [2022-04-28 10:33:47,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {281#true} call #t~ret6 := main(); {281#true} is VALID [2022-04-28 10:33:47,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {281#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {281#true} is VALID [2022-04-28 10:33:47,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {281#true} assume !!(~a~0 < 6);~b~0 := 0; {310#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:47,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {310#(<= main_~b~0 0)} assume !!(~b~0 < 6); {310#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:47,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {287#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:47,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {287#(<= main_~b~0 1)} assume !(~b~0 < 6); {282#false} is VALID [2022-04-28 10:33:47,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {282#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {282#false} is VALID [2022-04-28 10:33:47,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#false} assume !(~a~0 < 6); {282#false} is VALID [2022-04-28 10:33:47,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#false} assume !(6 == ~a~0 && 6 == ~b~0); {282#false} is VALID [2022-04-28 10:33:47,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-04-28 10:33:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:47,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:47,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-04-28 10:33:47,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#false} assume !(6 == ~a~0 && 6 == ~b~0); {282#false} is VALID [2022-04-28 10:33:47,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#false} assume !(~a~0 < 6); {282#false} is VALID [2022-04-28 10:33:47,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {282#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {282#false} is VALID [2022-04-28 10:33:47,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {344#(< main_~b~0 6)} assume !(~b~0 < 6); {282#false} is VALID [2022-04-28 10:33:47,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {348#(< main_~b~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {344#(< main_~b~0 6)} is VALID [2022-04-28 10:33:47,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {348#(< main_~b~0 5)} assume !!(~b~0 < 6); {348#(< main_~b~0 5)} is VALID [2022-04-28 10:33:47,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {281#true} assume !!(~a~0 < 6);~b~0 := 0; {348#(< main_~b~0 5)} is VALID [2022-04-28 10:33:47,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {281#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {281#true} is VALID [2022-04-28 10:33:47,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {281#true} call #t~ret6 := main(); {281#true} is VALID [2022-04-28 10:33:47,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {281#true} {281#true} #44#return; {281#true} is VALID [2022-04-28 10:33:47,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-28 10:33:47,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#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(11, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-28 10:33:47,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {281#true} is VALID [2022-04-28 10:33:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:47,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363104494] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:47,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:47,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 10:33:47,475 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:47,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1040959806] [2022-04-28 10:33:47,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1040959806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:47,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:47,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:33:47,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31989711] [2022-04-28 10:33:47,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:47,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 14 [2022-04-28 10:33:47,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:47,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:47,487 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:47,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:33:47,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:47,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:33:47,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:33:47,488 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:47,545 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 10:33:47,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:33:47,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 14 [2022-04-28 10:33:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:47,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-28 10:33:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-28 10:33:47,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-28 10:33:47,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:47,565 INFO L225 Difference]: With dead ends: 26 [2022-04-28 10:33:47,565 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 10:33:47,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 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:47,569 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:47,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 10:33:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-28 10:33:47,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:47,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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:47,580 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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:47,581 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:47,582 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-28 10:33:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 10:33:47,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:47,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:47,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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 18 states. [2022-04-28 10:33:47,583 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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 18 states. [2022-04-28 10:33:47,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:47,585 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-28 10:33:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 10:33:47,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:47,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:47,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:47,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-28 10:33:47,591 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2022-04-28 10:33:47,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:47,592 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-28 10:33:47,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:47,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-28 10:33:47,606 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:47,606 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 10:33:47,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:33:47,606 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:47,606 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:47,625 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:47,825 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:47,825 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:47,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:47,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1401344370, now seen corresponding path program 3 times [2022-04-28 10:33:47,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:47,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1302664137] [2022-04-28 10:33:47,851 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:47,860 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:47,860 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:47,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1401344370, now seen corresponding path program 4 times [2022-04-28 10:33:47,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:47,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380948102] [2022-04-28 10:33:47,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:47,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:47,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:47,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {508#(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(11, 2);call #Ultimate.allocInit(12, 3); {501#true} is VALID [2022-04-28 10:33:47,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {501#true} assume true; {501#true} is VALID [2022-04-28 10:33:47,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {501#true} {501#true} #44#return; {501#true} is VALID [2022-04-28 10:33:47,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:47,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#(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(11, 2);call #Ultimate.allocInit(12, 3); {501#true} is VALID [2022-04-28 10:33:47,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {501#true} assume true; {501#true} is VALID [2022-04-28 10:33:47,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {501#true} {501#true} #44#return; {501#true} is VALID [2022-04-28 10:33:47,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {501#true} call #t~ret6 := main(); {501#true} is VALID [2022-04-28 10:33:47,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {501#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {506#(= main_~a~0 0)} is VALID [2022-04-28 10:33:47,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#(= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {506#(= main_~a~0 0)} is VALID [2022-04-28 10:33:47,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {506#(= main_~a~0 0)} assume !!(~b~0 < 6); {506#(= main_~a~0 0)} is VALID [2022-04-28 10:33:47,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {506#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {506#(= main_~a~0 0)} is VALID [2022-04-28 10:33:47,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {506#(= main_~a~0 0)} assume !!(~b~0 < 6); {506#(= main_~a~0 0)} is VALID [2022-04-28 10:33:47,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {506#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {506#(= main_~a~0 0)} is VALID [2022-04-28 10:33:47,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {506#(= main_~a~0 0)} assume !(~b~0 < 6); {506#(= main_~a~0 0)} is VALID [2022-04-28 10:33:47,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {506#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {507#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:47,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {507#(<= main_~a~0 1)} assume !(~a~0 < 6); {502#false} is VALID [2022-04-28 10:33:47,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {502#false} assume !(6 == ~a~0 && 6 == ~b~0); {502#false} is VALID [2022-04-28 10:33:47,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-04-28 10:33:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:33:47,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:47,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380948102] [2022-04-28 10:33:47,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380948102] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:47,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880878022] [2022-04-28 10:33:47,898 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:33:47,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:47,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:47,899 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:47,900 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:47,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:33:47,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:47,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 10:33:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:47,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:47,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {501#true} is VALID [2022-04-28 10:33:47,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {501#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(11, 2);call #Ultimate.allocInit(12, 3); {501#true} is VALID [2022-04-28 10:33:47,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {501#true} assume true; {501#true} is VALID [2022-04-28 10:33:47,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {501#true} {501#true} #44#return; {501#true} is VALID [2022-04-28 10:33:47,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {501#true} call #t~ret6 := main(); {501#true} is VALID [2022-04-28 10:33:47,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {501#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {501#true} is VALID [2022-04-28 10:33:47,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {501#true} assume !!(~a~0 < 6);~b~0 := 0; {530#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:47,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {530#(<= main_~b~0 0)} assume !!(~b~0 < 6); {530#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:47,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {530#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {537#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:47,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {537#(<= main_~b~0 1)} assume !!(~b~0 < 6); {537#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:47,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {537#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {544#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:47,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#(<= main_~b~0 2)} assume !(~b~0 < 6); {502#false} is VALID [2022-04-28 10:33:47,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {502#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {502#false} is VALID [2022-04-28 10:33:47,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#false} assume !(~a~0 < 6); {502#false} is VALID [2022-04-28 10:33:47,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {502#false} assume !(6 == ~a~0 && 6 == ~b~0); {502#false} is VALID [2022-04-28 10:33:47,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-04-28 10:33:47,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:47,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:48,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-04-28 10:33:48,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {502#false} assume !(6 == ~a~0 && 6 == ~b~0); {502#false} is VALID [2022-04-28 10:33:48,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#false} assume !(~a~0 < 6); {502#false} is VALID [2022-04-28 10:33:48,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {502#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {502#false} is VALID [2022-04-28 10:33:48,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {572#(< main_~b~0 6)} assume !(~b~0 < 6); {502#false} is VALID [2022-04-28 10:33:48,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {576#(< main_~b~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {572#(< main_~b~0 6)} is VALID [2022-04-28 10:33:48,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {576#(< main_~b~0 5)} assume !!(~b~0 < 6); {576#(< main_~b~0 5)} is VALID [2022-04-28 10:33:48,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {583#(< main_~b~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {576#(< main_~b~0 5)} is VALID [2022-04-28 10:33:48,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {583#(< main_~b~0 4)} assume !!(~b~0 < 6); {583#(< main_~b~0 4)} is VALID [2022-04-28 10:33:48,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {501#true} assume !!(~a~0 < 6);~b~0 := 0; {583#(< main_~b~0 4)} is VALID [2022-04-28 10:33:48,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {501#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {501#true} is VALID [2022-04-28 10:33:48,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {501#true} call #t~ret6 := main(); {501#true} is VALID [2022-04-28 10:33:48,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {501#true} {501#true} #44#return; {501#true} is VALID [2022-04-28 10:33:48,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {501#true} assume true; {501#true} is VALID [2022-04-28 10:33:48,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {501#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(11, 2);call #Ultimate.allocInit(12, 3); {501#true} is VALID [2022-04-28 10:33:48,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {501#true} is VALID [2022-04-28 10:33:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:48,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880878022] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:48,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:48,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-28 10:33:48,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:48,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1302664137] [2022-04-28 10:33:48,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1302664137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:48,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:48,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:33:48,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704305993] [2022-04-28 10:33:48,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:48,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 16 [2022-04-28 10:33:48,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:48,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:48,098 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:48,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:33:48,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:48,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:33:48,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:33:48,099 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:48,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,171 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-28 10:33:48,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:33:48,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 16 [2022-04-28 10:33:48,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-28 10:33:48,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:48,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-28 10:33:48,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-28 10:33:48,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:48,192 INFO L225 Difference]: With dead ends: 33 [2022-04-28 10:33:48,192 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 10:33:48,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:33:48,194 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:48,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 10:33:48,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-04-28 10:33:48,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:48,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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:48,206 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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:48,207 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,208 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-28 10:33:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-28 10:33:48,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:48,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:48,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 30 states. [2022-04-28 10:33:48,209 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 30 states. [2022-04-28 10:33:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,210 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-28 10:33:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-28 10:33:48,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:48,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:48,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:48,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-28 10:33:48,211 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2022-04-28 10:33:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:48,211 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-28 10:33:48,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:48,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-28 10:33:48,229 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:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 10:33:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:33:48,230 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:48,230 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:48,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 10:33:48,443 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:48,443 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:48,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1986231757, now seen corresponding path program 5 times [2022-04-28 10:33:48,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:48,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1445760582] [2022-04-28 10:33:48,563 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:48,570 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:48,570 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:48,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1986231757, now seen corresponding path program 6 times [2022-04-28 10:33:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:48,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688849613] [2022-04-28 10:33:48,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:48,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:48,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:48,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {796#(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(11, 2);call #Ultimate.allocInit(12, 3); {788#true} is VALID [2022-04-28 10:33:48,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#true} assume true; {788#true} is VALID [2022-04-28 10:33:48,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {788#true} {788#true} #44#return; {788#true} is VALID [2022-04-28 10:33:48,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {788#true} call ULTIMATE.init(); {796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:48,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {796#(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(11, 2);call #Ultimate.allocInit(12, 3); {788#true} is VALID [2022-04-28 10:33:48,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} assume true; {788#true} is VALID [2022-04-28 10:33:48,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {788#true} {788#true} #44#return; {788#true} is VALID [2022-04-28 10:33:48,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {788#true} call #t~ret6 := main(); {788#true} is VALID [2022-04-28 10:33:48,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {788#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {788#true} is VALID [2022-04-28 10:33:48,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {788#true} assume !!(~a~0 < 6);~b~0 := 0; {793#(= main_~b~0 0)} is VALID [2022-04-28 10:33:48,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {793#(= main_~b~0 0)} assume !!(~b~0 < 6); {793#(= main_~b~0 0)} is VALID [2022-04-28 10:33:48,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {793#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {794#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:48,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {794#(<= main_~b~0 1)} assume !!(~b~0 < 6); {794#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:48,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {794#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {795#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:48,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {795#(<= main_~b~0 2)} assume !(~b~0 < 6); {789#false} is VALID [2022-04-28 10:33:48,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {789#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {789#false} is VALID [2022-04-28 10:33:48,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {789#false} assume !!(~a~0 < 6);~b~0 := 0; {789#false} is VALID [2022-04-28 10:33:48,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {789#false} assume !!(~b~0 < 6); {789#false} is VALID [2022-04-28 10:33:48,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {789#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {789#false} is VALID [2022-04-28 10:33:48,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {789#false} assume !!(~b~0 < 6); {789#false} is VALID [2022-04-28 10:33:48,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {789#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {789#false} is VALID [2022-04-28 10:33:48,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {789#false} assume !(~b~0 < 6); {789#false} is VALID [2022-04-28 10:33:48,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {789#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {789#false} is VALID [2022-04-28 10:33:48,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {789#false} assume !(~a~0 < 6); {789#false} is VALID [2022-04-28 10:33:48,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {789#false} assume !(6 == ~a~0 && 6 == ~b~0); {789#false} is VALID [2022-04-28 10:33:48,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {789#false} assume !false; {789#false} is VALID [2022-04-28 10:33:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:33:48,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:48,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688849613] [2022-04-28 10:33:48,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688849613] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:48,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648611929] [2022-04-28 10:33:48,628 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:33:48,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:48,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:48,629 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:48,631 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:48,657 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:33:48,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:48,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 10:33:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:48,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:48,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {788#true} call ULTIMATE.init(); {788#true} is VALID [2022-04-28 10:33:48,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#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(11, 2);call #Ultimate.allocInit(12, 3); {788#true} is VALID [2022-04-28 10:33:48,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} assume true; {788#true} is VALID [2022-04-28 10:33:48,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {788#true} {788#true} #44#return; {788#true} is VALID [2022-04-28 10:33:48,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {788#true} call #t~ret6 := main(); {788#true} is VALID [2022-04-28 10:33:48,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {788#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {815#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:48,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {815#(<= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {815#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:48,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {815#(<= main_~a~0 0)} assume !!(~b~0 < 6); {815#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:48,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {815#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {815#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:48,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {815#(<= main_~a~0 0)} assume !!(~b~0 < 6); {815#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:48,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {815#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {815#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:48,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {815#(<= main_~a~0 0)} assume !(~b~0 < 6); {815#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:48,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {815#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {837#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:48,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {837#(<= main_~a~0 1)} assume !!(~a~0 < 6);~b~0 := 0; {837#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:48,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {837#(<= main_~a~0 1)} assume !!(~b~0 < 6); {837#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:48,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {837#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {837#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:48,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {837#(<= main_~a~0 1)} assume !!(~b~0 < 6); {837#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:48,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {837#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {837#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:48,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {837#(<= main_~a~0 1)} assume !(~b~0 < 6); {837#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:48,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {837#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {859#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:48,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {859#(<= main_~a~0 2)} assume !(~a~0 < 6); {789#false} is VALID [2022-04-28 10:33:48,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {789#false} assume !(6 == ~a~0 && 6 == ~b~0); {789#false} is VALID [2022-04-28 10:33:48,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {789#false} assume !false; {789#false} is VALID [2022-04-28 10:33:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 10:33:48,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:48,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {789#false} assume !false; {789#false} is VALID [2022-04-28 10:33:48,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {789#false} assume !(6 == ~a~0 && 6 == ~b~0); {789#false} is VALID [2022-04-28 10:33:48,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {875#(< main_~a~0 6)} assume !(~a~0 < 6); {789#false} is VALID [2022-04-28 10:33:48,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {879#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {875#(< main_~a~0 6)} is VALID [2022-04-28 10:33:48,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {879#(< main_~a~0 5)} assume !(~b~0 < 6); {879#(< main_~a~0 5)} is VALID [2022-04-28 10:33:48,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {879#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {879#(< main_~a~0 5)} is VALID [2022-04-28 10:33:48,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {879#(< main_~a~0 5)} assume !!(~b~0 < 6); {879#(< main_~a~0 5)} is VALID [2022-04-28 10:33:48,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {879#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {879#(< main_~a~0 5)} is VALID [2022-04-28 10:33:48,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {879#(< main_~a~0 5)} assume !!(~b~0 < 6); {879#(< main_~a~0 5)} is VALID [2022-04-28 10:33:48,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {879#(< main_~a~0 5)} assume !!(~a~0 < 6);~b~0 := 0; {879#(< main_~a~0 5)} is VALID [2022-04-28 10:33:48,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {901#(< main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {879#(< main_~a~0 5)} is VALID [2022-04-28 10:33:48,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {901#(< main_~a~0 4)} assume !(~b~0 < 6); {901#(< main_~a~0 4)} is VALID [2022-04-28 10:33:48,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {901#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {901#(< main_~a~0 4)} is VALID [2022-04-28 10:33:48,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {901#(< main_~a~0 4)} assume !!(~b~0 < 6); {901#(< main_~a~0 4)} is VALID [2022-04-28 10:33:48,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {901#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {901#(< main_~a~0 4)} is VALID [2022-04-28 10:33:48,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {901#(< main_~a~0 4)} assume !!(~b~0 < 6); {901#(< main_~a~0 4)} is VALID [2022-04-28 10:33:48,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {901#(< main_~a~0 4)} assume !!(~a~0 < 6);~b~0 := 0; {901#(< main_~a~0 4)} is VALID [2022-04-28 10:33:48,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {788#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {901#(< main_~a~0 4)} is VALID [2022-04-28 10:33:48,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {788#true} call #t~ret6 := main(); {788#true} is VALID [2022-04-28 10:33:48,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {788#true} {788#true} #44#return; {788#true} is VALID [2022-04-28 10:33:48,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} assume true; {788#true} is VALID [2022-04-28 10:33:48,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#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(11, 2);call #Ultimate.allocInit(12, 3); {788#true} is VALID [2022-04-28 10:33:48,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {788#true} call ULTIMATE.init(); {788#true} is VALID [2022-04-28 10:33:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 10:33:48,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648611929] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:48,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:48,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-28 10:33:48,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:48,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1445760582] [2022-04-28 10:33:48,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1445760582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:48,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:48,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:33:48,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553446505] [2022-04-28 10:33:48,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:48,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 23 [2022-04-28 10:33:48,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:48,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:48,941 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:48,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:33:48,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:48,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:33:48,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:33:48,941 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:49,036 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-28 10:33:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:33:49,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 23 [2022-04-28 10:33:49,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-28 10:33:49,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-28 10:33:49,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2022-04-28 10:33:49,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:49,063 INFO L225 Difference]: With dead ends: 42 [2022-04-28 10:33:49,063 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 10:33:49,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:33:49,064 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:49,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:49,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 10:33:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-04-28 10:33:49,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:49,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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:49,077 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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:49,077 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:49,078 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 10:33:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 10:33:49,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:49,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:49,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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 30 states. [2022-04-28 10:33:49,078 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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 30 states. [2022-04-28 10:33:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:49,079 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 10:33:49,079 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 10:33:49,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:49,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:49,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:49,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-28 10:33:49,081 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2022-04-28 10:33:49,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:49,081 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-28 10:33:49,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:49,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-28 10:33:49,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-28 10:33:49,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:33:49,102 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:49,102 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:49,121 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:49,319 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:49,319 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:49,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:49,320 INFO L85 PathProgramCache]: Analyzing trace with hash -7293261, now seen corresponding path program 7 times [2022-04-28 10:33:49,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:49,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1909299073] [2022-04-28 10:33:49,387 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:49,401 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:49,401 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:49,401 INFO L85 PathProgramCache]: Analyzing trace with hash -7293261, now seen corresponding path program 8 times [2022-04-28 10:33:49,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:49,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103808916] [2022-04-28 10:33:49,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:49,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:49,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:49,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {1155#(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(11, 2);call #Ultimate.allocInit(12, 3); {1146#true} is VALID [2022-04-28 10:33:49,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {1146#true} assume true; {1146#true} is VALID [2022-04-28 10:33:49,456 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1146#true} {1146#true} #44#return; {1146#true} is VALID [2022-04-28 10:33:49,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {1146#true} call ULTIMATE.init(); {1155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:49,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#(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(11, 2);call #Ultimate.allocInit(12, 3); {1146#true} is VALID [2022-04-28 10:33:49,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {1146#true} assume true; {1146#true} is VALID [2022-04-28 10:33:49,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1146#true} {1146#true} #44#return; {1146#true} is VALID [2022-04-28 10:33:49,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {1146#true} call #t~ret6 := main(); {1146#true} is VALID [2022-04-28 10:33:49,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {1146#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {1146#true} is VALID [2022-04-28 10:33:49,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {1146#true} assume !!(~a~0 < 6);~b~0 := 0; {1151#(= main_~b~0 0)} is VALID [2022-04-28 10:33:49,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {1151#(= main_~b~0 0)} assume !!(~b~0 < 6); {1151#(= main_~b~0 0)} is VALID [2022-04-28 10:33:49,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {1151#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1152#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:49,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {1152#(<= main_~b~0 1)} assume !!(~b~0 < 6); {1152#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:49,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {1152#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1153#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:49,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {1153#(<= main_~b~0 2)} assume !!(~b~0 < 6); {1153#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:49,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {1153#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1154#(<= main_~b~0 3)} is VALID [2022-04-28 10:33:49,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(<= main_~b~0 3)} assume !(~b~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {1147#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1147#false} is VALID [2022-04-28 10:33:49,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {1147#false} assume !!(~a~0 < 6);~b~0 := 0; {1147#false} is VALID [2022-04-28 10:33:49,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-28 10:33:49,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-28 10:33:49,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-28 10:33:49,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {1147#false} assume !(~b~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {1147#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1147#false} is VALID [2022-04-28 10:33:49,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {1147#false} assume !(~a~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {1147#false} assume !(6 == ~a~0 && 6 == ~b~0); {1147#false} is VALID [2022-04-28 10:33:49,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {1147#false} assume !false; {1147#false} is VALID [2022-04-28 10:33:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:33:49,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:49,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103808916] [2022-04-28 10:33:49,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103808916] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:49,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718707711] [2022-04-28 10:33:49,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:33:49,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:49,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:49,464 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:49,465 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:49,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:33:49,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:49,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 10:33:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:49,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:49,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {1146#true} call ULTIMATE.init(); {1146#true} is VALID [2022-04-28 10:33:49,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {1146#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(11, 2);call #Ultimate.allocInit(12, 3); {1146#true} is VALID [2022-04-28 10:33:49,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {1146#true} assume true; {1146#true} is VALID [2022-04-28 10:33:49,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1146#true} {1146#true} #44#return; {1146#true} is VALID [2022-04-28 10:33:49,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {1146#true} call #t~ret6 := main(); {1146#true} is VALID [2022-04-28 10:33:49,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {1146#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {1146#true} is VALID [2022-04-28 10:33:49,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {1146#true} assume !!(~a~0 < 6);~b~0 := 0; {1177#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:49,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {1177#(<= main_~b~0 0)} assume !!(~b~0 < 6); {1177#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:49,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {1177#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1152#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:49,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {1152#(<= main_~b~0 1)} assume !!(~b~0 < 6); {1152#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:49,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {1152#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1153#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:49,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {1153#(<= main_~b~0 2)} assume !!(~b~0 < 6); {1153#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:49,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {1153#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1154#(<= main_~b~0 3)} is VALID [2022-04-28 10:33:49,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(<= main_~b~0 3)} assume !(~b~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {1147#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1147#false} is VALID [2022-04-28 10:33:49,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {1147#false} assume !!(~a~0 < 6);~b~0 := 0; {1147#false} is VALID [2022-04-28 10:33:49,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-28 10:33:49,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-28 10:33:49,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-28 10:33:49,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {1147#false} assume !(~b~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {1147#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1147#false} is VALID [2022-04-28 10:33:49,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {1147#false} assume !(~a~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {1147#false} assume !(6 == ~a~0 && 6 == ~b~0); {1147#false} is VALID [2022-04-28 10:33:49,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {1147#false} assume !false; {1147#false} is VALID [2022-04-28 10:33:49,584 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:33:49,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:49,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {1147#false} assume !false; {1147#false} is VALID [2022-04-28 10:33:49,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {1147#false} assume !(6 == ~a~0 && 6 == ~b~0); {1147#false} is VALID [2022-04-28 10:33:49,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {1147#false} assume !(~a~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {1147#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1147#false} is VALID [2022-04-28 10:33:49,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {1147#false} assume !(~b~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-28 10:33:49,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-28 10:33:49,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {1147#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1147#false} is VALID [2022-04-28 10:33:49,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {1147#false} assume !!(~b~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {1147#false} assume !!(~a~0 < 6);~b~0 := 0; {1147#false} is VALID [2022-04-28 10:33:49,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {1147#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1147#false} is VALID [2022-04-28 10:33:49,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {1277#(< main_~b~0 6)} assume !(~b~0 < 6); {1147#false} is VALID [2022-04-28 10:33:49,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {1281#(< main_~b~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1277#(< main_~b~0 6)} is VALID [2022-04-28 10:33:49,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {1281#(< main_~b~0 5)} assume !!(~b~0 < 6); {1281#(< main_~b~0 5)} is VALID [2022-04-28 10:33:49,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {1154#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1281#(< main_~b~0 5)} is VALID [2022-04-28 10:33:49,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {1154#(<= main_~b~0 3)} assume !!(~b~0 < 6); {1154#(<= main_~b~0 3)} is VALID [2022-04-28 10:33:49,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {1153#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1154#(<= main_~b~0 3)} is VALID [2022-04-28 10:33:49,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {1153#(<= main_~b~0 2)} assume !!(~b~0 < 6); {1153#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:49,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {1146#true} assume !!(~a~0 < 6);~b~0 := 0; {1153#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:49,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {1146#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {1146#true} is VALID [2022-04-28 10:33:49,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {1146#true} call #t~ret6 := main(); {1146#true} is VALID [2022-04-28 10:33:49,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1146#true} {1146#true} #44#return; {1146#true} is VALID [2022-04-28 10:33:49,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {1146#true} assume true; {1146#true} is VALID [2022-04-28 10:33:49,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {1146#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(11, 2);call #Ultimate.allocInit(12, 3); {1146#true} is VALID [2022-04-28 10:33:49,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {1146#true} call ULTIMATE.init(); {1146#true} is VALID [2022-04-28 10:33:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:33:49,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718707711] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:49,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:49,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-28 10:33:49,691 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:49,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1909299073] [2022-04-28 10:33:49,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1909299073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:49,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:49,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:33:49,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516920745] [2022-04-28 10:33:49,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:49,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 27 [2022-04-28 10:33:49,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:49,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:49,706 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:49,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:33:49,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:49,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:33:49,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:49,706 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:49,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:49,798 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-28 10:33:49,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:33:49,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 27 [2022-04-28 10:33:49,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-28 10:33:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-28 10:33:49,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-28 10:33:49,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:49,820 INFO L225 Difference]: With dead ends: 48 [2022-04-28 10:33:49,820 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 10:33:49,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:33:49,821 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:49,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 24 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:49,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 10:33:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-28 10:33:49,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:49,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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:49,839 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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:49,839 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:49,840 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 10:33:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 10:33:49,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:49,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:49,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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 34 states. [2022-04-28 10:33:49,841 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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 34 states. [2022-04-28 10:33:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:49,842 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 10:33:49,842 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 10:33:49,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:49,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:49,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:49,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-28 10:33:49,843 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 27 [2022-04-28 10:33:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:49,843 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-28 10:33:49,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:49,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2022-04-28 10:33:49,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-28 10:33:49,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:33:49,869 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:49,869 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:49,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 10:33:50,079 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:50,079 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:50,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:50,080 INFO L85 PathProgramCache]: Analyzing trace with hash 648956467, now seen corresponding path program 9 times [2022-04-28 10:33:50,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:50,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2085618895] [2022-04-28 10:33:50,158 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:50,170 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:50,170 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:50,170 INFO L85 PathProgramCache]: Analyzing trace with hash 648956467, now seen corresponding path program 10 times [2022-04-28 10:33:50,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:50,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421639073] [2022-04-28 10:33:50,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:50,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:50,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:50,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {1566#(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(11, 2);call #Ultimate.allocInit(12, 3); {1556#true} is VALID [2022-04-28 10:33:50,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {1556#true} assume true; {1556#true} is VALID [2022-04-28 10:33:50,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1556#true} {1556#true} #44#return; {1556#true} is VALID [2022-04-28 10:33:50,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {1556#true} call ULTIMATE.init(); {1566#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:50,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#(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(11, 2);call #Ultimate.allocInit(12, 3); {1556#true} is VALID [2022-04-28 10:33:50,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {1556#true} assume true; {1556#true} is VALID [2022-04-28 10:33:50,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1556#true} {1556#true} #44#return; {1556#true} is VALID [2022-04-28 10:33:50,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {1556#true} call #t~ret6 := main(); {1556#true} is VALID [2022-04-28 10:33:50,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {1556#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {1556#true} is VALID [2022-04-28 10:33:50,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {1556#true} assume !!(~a~0 < 6);~b~0 := 0; {1561#(= main_~b~0 0)} is VALID [2022-04-28 10:33:50,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {1561#(= main_~b~0 0)} assume !!(~b~0 < 6); {1561#(= main_~b~0 0)} is VALID [2022-04-28 10:33:50,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {1561#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1562#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:50,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {1562#(<= main_~b~0 1)} assume !!(~b~0 < 6); {1562#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:50,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {1562#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1563#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:50,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {1563#(<= main_~b~0 2)} assume !!(~b~0 < 6); {1563#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:50,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {1563#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1564#(<= main_~b~0 3)} is VALID [2022-04-28 10:33:50,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {1564#(<= main_~b~0 3)} assume !!(~b~0 < 6); {1564#(<= main_~b~0 3)} is VALID [2022-04-28 10:33:50,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {1564#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1565#(<= main_~b~0 4)} is VALID [2022-04-28 10:33:50,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {1565#(<= main_~b~0 4)} assume !(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {1557#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1557#false} is VALID [2022-04-28 10:33:50,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {1557#false} assume !!(~a~0 < 6);~b~0 := 0; {1557#false} is VALID [2022-04-28 10:33:50,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-28 10:33:50,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-28 10:33:50,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-28 10:33:50,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-28 10:33:50,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {1557#false} assume !(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {1557#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1557#false} is VALID [2022-04-28 10:33:50,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {1557#false} assume !(~a~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {1557#false} assume !(6 == ~a~0 && 6 == ~b~0); {1557#false} is VALID [2022-04-28 10:33:50,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {1557#false} assume !false; {1557#false} is VALID [2022-04-28 10:33:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:33:50,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:50,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421639073] [2022-04-28 10:33:50,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421639073] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:50,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241383094] [2022-04-28 10:33:50,226 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:33:50,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:50,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:50,227 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:50,228 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:50,269 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:33:50,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:50,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 10:33:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:50,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:50,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {1556#true} call ULTIMATE.init(); {1556#true} is VALID [2022-04-28 10:33:50,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {1556#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(11, 2);call #Ultimate.allocInit(12, 3); {1556#true} is VALID [2022-04-28 10:33:50,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {1556#true} assume true; {1556#true} is VALID [2022-04-28 10:33:50,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1556#true} {1556#true} #44#return; {1556#true} is VALID [2022-04-28 10:33:50,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {1556#true} call #t~ret6 := main(); {1556#true} is VALID [2022-04-28 10:33:50,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {1556#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {1556#true} is VALID [2022-04-28 10:33:50,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {1556#true} assume !!(~a~0 < 6);~b~0 := 0; {1588#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:50,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {1588#(<= main_~b~0 0)} assume !!(~b~0 < 6); {1588#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:50,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {1588#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1562#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:50,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {1562#(<= main_~b~0 1)} assume !!(~b~0 < 6); {1562#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:50,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {1562#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1563#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:50,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {1563#(<= main_~b~0 2)} assume !!(~b~0 < 6); {1563#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:50,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {1563#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1564#(<= main_~b~0 3)} is VALID [2022-04-28 10:33:50,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {1564#(<= main_~b~0 3)} assume !!(~b~0 < 6); {1564#(<= main_~b~0 3)} is VALID [2022-04-28 10:33:50,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {1564#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1565#(<= main_~b~0 4)} is VALID [2022-04-28 10:33:50,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {1565#(<= main_~b~0 4)} assume !(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {1557#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1557#false} is VALID [2022-04-28 10:33:50,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {1557#false} assume !!(~a~0 < 6);~b~0 := 0; {1557#false} is VALID [2022-04-28 10:33:50,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-28 10:33:50,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-28 10:33:50,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-28 10:33:50,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-28 10:33:50,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {1557#false} assume !(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {1557#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1557#false} is VALID [2022-04-28 10:33:50,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {1557#false} assume !(~a~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {1557#false} assume !(6 == ~a~0 && 6 == ~b~0); {1557#false} is VALID [2022-04-28 10:33:50,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {1557#false} assume !false; {1557#false} is VALID [2022-04-28 10:33:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:33:50,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:50,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {1557#false} assume !false; {1557#false} is VALID [2022-04-28 10:33:50,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {1557#false} assume !(6 == ~a~0 && 6 == ~b~0); {1557#false} is VALID [2022-04-28 10:33:50,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {1557#false} assume !(~a~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {1557#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1557#false} is VALID [2022-04-28 10:33:50,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {1557#false} assume !(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-28 10:33:50,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-28 10:33:50,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-28 10:33:50,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {1557#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1557#false} is VALID [2022-04-28 10:33:50,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {1557#false} assume !!(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {1557#false} assume !!(~a~0 < 6);~b~0 := 0; {1557#false} is VALID [2022-04-28 10:33:50,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {1557#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1557#false} is VALID [2022-04-28 10:33:50,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {1706#(< main_~b~0 6)} assume !(~b~0 < 6); {1557#false} is VALID [2022-04-28 10:33:50,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {1565#(<= main_~b~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1706#(< main_~b~0 6)} is VALID [2022-04-28 10:33:50,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {1565#(<= main_~b~0 4)} assume !!(~b~0 < 6); {1565#(<= main_~b~0 4)} is VALID [2022-04-28 10:33:50,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {1564#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1565#(<= main_~b~0 4)} is VALID [2022-04-28 10:33:50,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {1564#(<= main_~b~0 3)} assume !!(~b~0 < 6); {1564#(<= main_~b~0 3)} is VALID [2022-04-28 10:33:50,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {1563#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1564#(<= main_~b~0 3)} is VALID [2022-04-28 10:33:50,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {1563#(<= main_~b~0 2)} assume !!(~b~0 < 6); {1563#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:50,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {1562#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1563#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:50,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {1562#(<= main_~b~0 1)} assume !!(~b~0 < 6); {1562#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:50,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {1556#true} assume !!(~a~0 < 6);~b~0 := 0; {1562#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:50,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {1556#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {1556#true} is VALID [2022-04-28 10:33:50,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {1556#true} call #t~ret6 := main(); {1556#true} is VALID [2022-04-28 10:33:50,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1556#true} {1556#true} #44#return; {1556#true} is VALID [2022-04-28 10:33:50,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {1556#true} assume true; {1556#true} is VALID [2022-04-28 10:33:50,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {1556#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(11, 2);call #Ultimate.allocInit(12, 3); {1556#true} is VALID [2022-04-28 10:33:50,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {1556#true} call ULTIMATE.init(); {1556#true} is VALID [2022-04-28 10:33:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:33:50,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241383094] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:50,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:50,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-28 10:33:50,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:50,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2085618895] [2022-04-28 10:33:50,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2085618895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:50,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:50,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:33:50,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606977533] [2022-04-28 10:33:50,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:50,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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 31 [2022-04-28 10:33:50,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:50,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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:50,537 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:50,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:33:50,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:50,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:33:50,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:50,538 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:50,654 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-04-28 10:33:50,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:33:50,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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 31 [2022-04-28 10:33:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-28 10:33:50,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-28 10:33:50,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2022-04-28 10:33:50,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:50,674 INFO L225 Difference]: With dead ends: 54 [2022-04-28 10:33:50,674 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 10:33:50,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 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:50,674 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:50,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 10:33:50,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-28 10:33:50,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:50,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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:50,694 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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:50,694 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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:50,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:50,695 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-28 10:33:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-28 10:33:50,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:50,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:50,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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 38 states. [2022-04-28 10:33:50,696 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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 38 states. [2022-04-28 10:33:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:50,697 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-28 10:33:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-28 10:33:50,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:50,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:50,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:50,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-28 10:33:50,698 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2022-04-28 10:33:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:50,698 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-28 10:33:50,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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:50,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-28 10:33:50,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 10:33:50,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:33:50,723 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:50,723 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:50,745 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:50,924 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:50,924 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:50,924 INFO L85 PathProgramCache]: Analyzing trace with hash 96599219, now seen corresponding path program 11 times [2022-04-28 10:33:50,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:50,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [491952529] [2022-04-28 10:33:50,984 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:51,005 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:51,005 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:51,005 INFO L85 PathProgramCache]: Analyzing trace with hash 96599219, now seen corresponding path program 12 times [2022-04-28 10:33:51,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:51,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117183252] [2022-04-28 10:33:51,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:51,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:51,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:51,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {2031#(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(11, 2);call #Ultimate.allocInit(12, 3); {2020#true} is VALID [2022-04-28 10:33:51,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-04-28 10:33:51,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2020#true} {2020#true} #44#return; {2020#true} is VALID [2022-04-28 10:33:51,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {2020#true} call ULTIMATE.init(); {2031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:51,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {2031#(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(11, 2);call #Ultimate.allocInit(12, 3); {2020#true} is VALID [2022-04-28 10:33:51,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-04-28 10:33:51,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2020#true} {2020#true} #44#return; {2020#true} is VALID [2022-04-28 10:33:51,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {2020#true} call #t~ret6 := main(); {2020#true} is VALID [2022-04-28 10:33:51,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {2020#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {2020#true} is VALID [2022-04-28 10:33:51,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {2020#true} assume !!(~a~0 < 6);~b~0 := 0; {2025#(= main_~b~0 0)} is VALID [2022-04-28 10:33:51,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {2025#(= main_~b~0 0)} assume !!(~b~0 < 6); {2025#(= main_~b~0 0)} is VALID [2022-04-28 10:33:51,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {2025#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2026#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:51,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {2026#(<= main_~b~0 1)} assume !!(~b~0 < 6); {2026#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:51,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {2026#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2027#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:51,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {2027#(<= main_~b~0 2)} assume !!(~b~0 < 6); {2027#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:51,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {2027#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2028#(<= main_~b~0 3)} is VALID [2022-04-28 10:33:51,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {2028#(<= main_~b~0 3)} assume !!(~b~0 < 6); {2028#(<= main_~b~0 3)} is VALID [2022-04-28 10:33:51,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {2028#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2029#(<= main_~b~0 4)} is VALID [2022-04-28 10:33:51,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {2029#(<= main_~b~0 4)} assume !!(~b~0 < 6); {2029#(<= main_~b~0 4)} is VALID [2022-04-28 10:33:51,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {2029#(<= main_~b~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2030#(<= main_~b~0 5)} is VALID [2022-04-28 10:33:51,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {2030#(<= main_~b~0 5)} assume !(~b~0 < 6); {2021#false} is VALID [2022-04-28 10:33:51,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {2021#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2021#false} is VALID [2022-04-28 10:33:51,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {2021#false} assume !!(~a~0 < 6);~b~0 := 0; {2021#false} is VALID [2022-04-28 10:33:51,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {2021#false} assume !!(~b~0 < 6); {2021#false} is VALID [2022-04-28 10:33:51,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {2021#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2021#false} is VALID [2022-04-28 10:33:51,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {2021#false} assume !!(~b~0 < 6); {2021#false} is VALID [2022-04-28 10:33:51,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {2021#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2021#false} is VALID [2022-04-28 10:33:51,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {2021#false} assume !!(~b~0 < 6); {2021#false} is VALID [2022-04-28 10:33:51,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {2021#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2021#false} is VALID [2022-04-28 10:33:51,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {2021#false} assume !!(~b~0 < 6); {2021#false} is VALID [2022-04-28 10:33:51,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {2021#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2021#false} is VALID [2022-04-28 10:33:51,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {2021#false} assume !!(~b~0 < 6); {2021#false} is VALID [2022-04-28 10:33:51,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {2021#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2021#false} is VALID [2022-04-28 10:33:51,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {2021#false} assume !(~b~0 < 6); {2021#false} is VALID [2022-04-28 10:33:51,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {2021#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2021#false} is VALID [2022-04-28 10:33:51,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {2021#false} assume !(~a~0 < 6); {2021#false} is VALID [2022-04-28 10:33:51,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {2021#false} assume !(6 == ~a~0 && 6 == ~b~0); {2021#false} is VALID [2022-04-28 10:33:51,105 INFO L290 TraceCheckUtils]: 34: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2022-04-28 10:33:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 10:33:51,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:51,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117183252] [2022-04-28 10:33:51,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117183252] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:51,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369879440] [2022-04-28 10:33:51,106 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:33:51,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:51,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:51,116 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:33:51,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 10:33:51,149 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:33:51,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:51,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 10:33:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:51,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:51,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {2020#true} call ULTIMATE.init(); {2020#true} is VALID [2022-04-28 10:33:51,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {2020#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(11, 2);call #Ultimate.allocInit(12, 3); {2020#true} is VALID [2022-04-28 10:33:51,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-04-28 10:33:51,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2020#true} {2020#true} #44#return; {2020#true} is VALID [2022-04-28 10:33:51,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {2020#true} call #t~ret6 := main(); {2020#true} is VALID [2022-04-28 10:33:51,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {2020#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {2050#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:51,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {2050#(<= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {2050#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:51,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {2050#(<= main_~a~0 0)} assume !!(~b~0 < 6); {2050#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:51,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {2050#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2050#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:51,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {2050#(<= main_~a~0 0)} assume !!(~b~0 < 6); {2050#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:51,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {2050#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2050#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:51,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {2050#(<= main_~a~0 0)} assume !!(~b~0 < 6); {2050#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:51,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {2050#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2050#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:51,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {2050#(<= main_~a~0 0)} assume !!(~b~0 < 6); {2050#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:51,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {2050#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2050#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:51,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {2050#(<= main_~a~0 0)} assume !!(~b~0 < 6); {2050#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:51,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {2050#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2050#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:51,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {2050#(<= main_~a~0 0)} assume !(~b~0 < 6); {2050#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:51,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {2050#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2090#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:51,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {2090#(<= main_~a~0 1)} assume !!(~a~0 < 6);~b~0 := 0; {2090#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:51,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {2090#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2090#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:51,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {2090#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2090#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:51,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {2090#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2090#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:51,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {2090#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2090#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:51,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {2090#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2090#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:51,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {2090#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2090#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:51,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {2090#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2090#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:51,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {2090#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2090#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:51,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {2090#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2090#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:51,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {2090#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2090#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:51,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {2090#(<= main_~a~0 1)} assume !(~b~0 < 6); {2090#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:51,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {2090#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2130#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:51,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {2130#(<= main_~a~0 2)} assume !(~a~0 < 6); {2021#false} is VALID [2022-04-28 10:33:51,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {2021#false} assume !(6 == ~a~0 && 6 == ~b~0); {2021#false} is VALID [2022-04-28 10:33:51,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2022-04-28 10:33:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-28 10:33:51,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:51,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2022-04-28 10:33:51,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {2021#false} assume !(6 == ~a~0 && 6 == ~b~0); {2021#false} is VALID [2022-04-28 10:33:51,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {2146#(< main_~a~0 6)} assume !(~a~0 < 6); {2021#false} is VALID [2022-04-28 10:33:51,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {2150#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2146#(< main_~a~0 6)} is VALID [2022-04-28 10:33:51,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {2150#(< main_~a~0 5)} assume !(~b~0 < 6); {2150#(< main_~a~0 5)} is VALID [2022-04-28 10:33:51,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {2150#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2150#(< main_~a~0 5)} is VALID [2022-04-28 10:33:51,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {2150#(< main_~a~0 5)} assume !!(~b~0 < 6); {2150#(< main_~a~0 5)} is VALID [2022-04-28 10:33:51,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {2150#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2150#(< main_~a~0 5)} is VALID [2022-04-28 10:33:51,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {2150#(< main_~a~0 5)} assume !!(~b~0 < 6); {2150#(< main_~a~0 5)} is VALID [2022-04-28 10:33:51,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {2150#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2150#(< main_~a~0 5)} is VALID [2022-04-28 10:33:51,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {2150#(< main_~a~0 5)} assume !!(~b~0 < 6); {2150#(< main_~a~0 5)} is VALID [2022-04-28 10:33:51,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {2150#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2150#(< main_~a~0 5)} is VALID [2022-04-28 10:33:51,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {2150#(< main_~a~0 5)} assume !!(~b~0 < 6); {2150#(< main_~a~0 5)} is VALID [2022-04-28 10:33:51,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {2150#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2150#(< main_~a~0 5)} is VALID [2022-04-28 10:33:51,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {2150#(< main_~a~0 5)} assume !!(~b~0 < 6); {2150#(< main_~a~0 5)} is VALID [2022-04-28 10:33:51,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {2150#(< main_~a~0 5)} assume !!(~a~0 < 6);~b~0 := 0; {2150#(< main_~a~0 5)} is VALID [2022-04-28 10:33:51,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {2190#(< main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2150#(< main_~a~0 5)} is VALID [2022-04-28 10:33:51,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {2190#(< main_~a~0 4)} assume !(~b~0 < 6); {2190#(< main_~a~0 4)} is VALID [2022-04-28 10:33:51,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {2190#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2190#(< main_~a~0 4)} is VALID [2022-04-28 10:33:51,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {2190#(< main_~a~0 4)} assume !!(~b~0 < 6); {2190#(< main_~a~0 4)} is VALID [2022-04-28 10:33:51,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {2190#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2190#(< main_~a~0 4)} is VALID [2022-04-28 10:33:51,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {2190#(< main_~a~0 4)} assume !!(~b~0 < 6); {2190#(< main_~a~0 4)} is VALID [2022-04-28 10:33:51,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {2190#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2190#(< main_~a~0 4)} is VALID [2022-04-28 10:33:51,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {2190#(< main_~a~0 4)} assume !!(~b~0 < 6); {2190#(< main_~a~0 4)} is VALID [2022-04-28 10:33:51,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {2190#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2190#(< main_~a~0 4)} is VALID [2022-04-28 10:33:51,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {2190#(< main_~a~0 4)} assume !!(~b~0 < 6); {2190#(< main_~a~0 4)} is VALID [2022-04-28 10:33:51,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {2190#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2190#(< main_~a~0 4)} is VALID [2022-04-28 10:33:51,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {2190#(< main_~a~0 4)} assume !!(~b~0 < 6); {2190#(< main_~a~0 4)} is VALID [2022-04-28 10:33:51,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {2190#(< main_~a~0 4)} assume !!(~a~0 < 6);~b~0 := 0; {2190#(< main_~a~0 4)} is VALID [2022-04-28 10:33:51,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {2020#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {2190#(< main_~a~0 4)} is VALID [2022-04-28 10:33:51,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {2020#true} call #t~ret6 := main(); {2020#true} is VALID [2022-04-28 10:33:51,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2020#true} {2020#true} #44#return; {2020#true} is VALID [2022-04-28 10:33:51,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {2020#true} assume true; {2020#true} is VALID [2022-04-28 10:33:51,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {2020#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(11, 2);call #Ultimate.allocInit(12, 3); {2020#true} is VALID [2022-04-28 10:33:51,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {2020#true} call ULTIMATE.init(); {2020#true} is VALID [2022-04-28 10:33:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-28 10:33:51,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369879440] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:51,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:51,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2022-04-28 10:33:51,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:51,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [491952529] [2022-04-28 10:33:51,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [491952529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:51,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:51,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:33:51,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689245151] [2022-04-28 10:33:51,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:51,464 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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 35 [2022-04-28 10:33:51,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:51,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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:51,483 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:51,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:33:51,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:51,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:33:51,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:33:51,483 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:51,619 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-04-28 10:33:51,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:33:51,619 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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 35 [2022-04-28 10:33:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-28 10:33:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-28 10:33:51,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-28 10:33:51,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:51,643 INFO L225 Difference]: With dead ends: 58 [2022-04-28 10:33:51,643 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 10:33:51,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:33:51,644 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:51,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 29 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 10:33:51,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-28 10:33:51,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:51,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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:51,672 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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:51,672 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:51,673 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-28 10:33:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-28 10:33:51,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:51,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:51,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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 40 states. [2022-04-28 10:33:51,674 INFO L87 Difference]: Start difference. First operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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 40 states. [2022-04-28 10:33:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:51,675 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-28 10:33:51,675 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-28 10:33:51,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:51,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:51,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:51,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-04-28 10:33:51,676 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 35 [2022-04-28 10:33:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:51,676 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-04-28 10:33:51,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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:51,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 42 transitions. [2022-04-28 10:33:51,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-28 10:33:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:33:51,718 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:51,718 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:51,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 10:33:51,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:51,923 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:51,924 INFO L85 PathProgramCache]: Analyzing trace with hash 455642675, now seen corresponding path program 13 times [2022-04-28 10:33:51,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:51,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1155929870] [2022-04-28 10:33:51,997 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:52,020 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:52,020 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:52,021 INFO L85 PathProgramCache]: Analyzing trace with hash 455642675, now seen corresponding path program 14 times [2022-04-28 10:33:52,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:52,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059007860] [2022-04-28 10:33:52,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:52,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:52,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:52,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {2543#(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(11, 2);call #Ultimate.allocInit(12, 3); {2535#true} is VALID [2022-04-28 10:33:52,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {2535#true} assume true; {2535#true} is VALID [2022-04-28 10:33:52,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2535#true} {2535#true} #44#return; {2535#true} is VALID [2022-04-28 10:33:52,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {2535#true} call ULTIMATE.init(); {2543#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:52,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {2543#(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(11, 2);call #Ultimate.allocInit(12, 3); {2535#true} is VALID [2022-04-28 10:33:52,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {2535#true} assume true; {2535#true} is VALID [2022-04-28 10:33:52,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2535#true} {2535#true} #44#return; {2535#true} is VALID [2022-04-28 10:33:52,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {2535#true} call #t~ret6 := main(); {2535#true} is VALID [2022-04-28 10:33:52,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {2535#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {2540#(= main_~a~0 0)} is VALID [2022-04-28 10:33:52,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {2540#(= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {2540#(= main_~a~0 0)} is VALID [2022-04-28 10:33:52,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {2540#(= main_~a~0 0)} assume !!(~b~0 < 6); {2540#(= main_~a~0 0)} is VALID [2022-04-28 10:33:52,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {2540#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2540#(= main_~a~0 0)} is VALID [2022-04-28 10:33:52,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {2540#(= main_~a~0 0)} assume !!(~b~0 < 6); {2540#(= main_~a~0 0)} is VALID [2022-04-28 10:33:52,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {2540#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2540#(= main_~a~0 0)} is VALID [2022-04-28 10:33:52,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {2540#(= main_~a~0 0)} assume !!(~b~0 < 6); {2540#(= main_~a~0 0)} is VALID [2022-04-28 10:33:52,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {2540#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2540#(= main_~a~0 0)} is VALID [2022-04-28 10:33:52,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {2540#(= main_~a~0 0)} assume !!(~b~0 < 6); {2540#(= main_~a~0 0)} is VALID [2022-04-28 10:33:52,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {2540#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2540#(= main_~a~0 0)} is VALID [2022-04-28 10:33:52,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {2540#(= main_~a~0 0)} assume !!(~b~0 < 6); {2540#(= main_~a~0 0)} is VALID [2022-04-28 10:33:52,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {2540#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2540#(= main_~a~0 0)} is VALID [2022-04-28 10:33:52,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {2540#(= main_~a~0 0)} assume !!(~b~0 < 6); {2540#(= main_~a~0 0)} is VALID [2022-04-28 10:33:52,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {2540#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2540#(= main_~a~0 0)} is VALID [2022-04-28 10:33:52,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {2540#(= main_~a~0 0)} assume !(~b~0 < 6); {2540#(= main_~a~0 0)} is VALID [2022-04-28 10:33:52,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {2540#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {2541#(<= main_~a~0 1)} assume !!(~a~0 < 6);~b~0 := 0; {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {2541#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {2541#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {2541#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {2541#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {2541#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {2541#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {2541#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {2541#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {2541#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {2541#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {2541#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {2541#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {2541#(<= main_~a~0 1)} assume !(~b~0 < 6); {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {2541#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2542#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:52,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {2542#(<= main_~a~0 2)} assume !(~a~0 < 6); {2536#false} is VALID [2022-04-28 10:33:52,105 INFO L290 TraceCheckUtils]: 37: Hoare triple {2536#false} assume !(6 == ~a~0 && 6 == ~b~0); {2536#false} is VALID [2022-04-28 10:33:52,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {2536#false} assume !false; {2536#false} is VALID [2022-04-28 10:33:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 10:33:52,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:52,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059007860] [2022-04-28 10:33:52,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059007860] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:52,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769634394] [2022-04-28 10:33:52,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:33:52,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:52,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:52,107 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:33:52,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 10:33:52,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:33:52,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:52,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 10:33:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:52,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:52,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {2535#true} call ULTIMATE.init(); {2535#true} is VALID [2022-04-28 10:33:52,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {2535#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(11, 2);call #Ultimate.allocInit(12, 3); {2535#true} is VALID [2022-04-28 10:33:52,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {2535#true} assume true; {2535#true} is VALID [2022-04-28 10:33:52,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2535#true} {2535#true} #44#return; {2535#true} is VALID [2022-04-28 10:33:52,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {2535#true} call #t~ret6 := main(); {2535#true} is VALID [2022-04-28 10:33:52,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {2535#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {2562#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:52,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {2562#(<= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {2562#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:52,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {2562#(<= main_~a~0 0)} assume !!(~b~0 < 6); {2562#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:52,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {2562#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2562#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:52,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {2562#(<= main_~a~0 0)} assume !!(~b~0 < 6); {2562#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:52,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {2562#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2562#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:52,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {2562#(<= main_~a~0 0)} assume !!(~b~0 < 6); {2562#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:52,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {2562#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2562#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:52,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {2562#(<= main_~a~0 0)} assume !!(~b~0 < 6); {2562#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:52,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {2562#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2562#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:52,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {2562#(<= main_~a~0 0)} assume !!(~b~0 < 6); {2562#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:52,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {2562#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2562#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:52,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {2562#(<= main_~a~0 0)} assume !!(~b~0 < 6); {2562#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:52,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {2562#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2562#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:52,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {2562#(<= main_~a~0 0)} assume !(~b~0 < 6); {2562#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:52,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {2562#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {2541#(<= main_~a~0 1)} assume !!(~a~0 < 6);~b~0 := 0; {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {2541#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {2541#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {2541#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {2541#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {2541#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {2541#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {2541#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {2541#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {2541#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {2541#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {2541#(<= main_~a~0 1)} assume !!(~b~0 < 6); {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {2541#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,271 INFO L290 TraceCheckUtils]: 34: Hoare triple {2541#(<= main_~a~0 1)} assume !(~b~0 < 6); {2541#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:52,271 INFO L290 TraceCheckUtils]: 35: Hoare triple {2541#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2542#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:52,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {2542#(<= main_~a~0 2)} assume !(~a~0 < 6); {2536#false} is VALID [2022-04-28 10:33:52,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {2536#false} assume !(6 == ~a~0 && 6 == ~b~0); {2536#false} is VALID [2022-04-28 10:33:52,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {2536#false} assume !false; {2536#false} is VALID [2022-04-28 10:33:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 10:33:52,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:52,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {2536#false} assume !false; {2536#false} is VALID [2022-04-28 10:33:52,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {2536#false} assume !(6 == ~a~0 && 6 == ~b~0); {2536#false} is VALID [2022-04-28 10:33:52,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {2668#(< main_~a~0 6)} assume !(~a~0 < 6); {2536#false} is VALID [2022-04-28 10:33:52,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {2672#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2668#(< main_~a~0 6)} is VALID [2022-04-28 10:33:52,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {2672#(< main_~a~0 5)} assume !(~b~0 < 6); {2672#(< main_~a~0 5)} is VALID [2022-04-28 10:33:52,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {2672#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2672#(< main_~a~0 5)} is VALID [2022-04-28 10:33:52,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {2672#(< main_~a~0 5)} assume !!(~b~0 < 6); {2672#(< main_~a~0 5)} is VALID [2022-04-28 10:33:52,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {2672#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2672#(< main_~a~0 5)} is VALID [2022-04-28 10:33:52,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {2672#(< main_~a~0 5)} assume !!(~b~0 < 6); {2672#(< main_~a~0 5)} is VALID [2022-04-28 10:33:52,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {2672#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2672#(< main_~a~0 5)} is VALID [2022-04-28 10:33:52,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {2672#(< main_~a~0 5)} assume !!(~b~0 < 6); {2672#(< main_~a~0 5)} is VALID [2022-04-28 10:33:52,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {2672#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2672#(< main_~a~0 5)} is VALID [2022-04-28 10:33:52,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {2672#(< main_~a~0 5)} assume !!(~b~0 < 6); {2672#(< main_~a~0 5)} is VALID [2022-04-28 10:33:52,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {2672#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2672#(< main_~a~0 5)} is VALID [2022-04-28 10:33:52,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {2672#(< main_~a~0 5)} assume !!(~b~0 < 6); {2672#(< main_~a~0 5)} is VALID [2022-04-28 10:33:52,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {2672#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2672#(< main_~a~0 5)} is VALID [2022-04-28 10:33:52,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {2672#(< main_~a~0 5)} assume !!(~b~0 < 6); {2672#(< main_~a~0 5)} is VALID [2022-04-28 10:33:52,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {2672#(< main_~a~0 5)} assume !!(~a~0 < 6);~b~0 := 0; {2672#(< main_~a~0 5)} is VALID [2022-04-28 10:33:52,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {2718#(< main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2672#(< main_~a~0 5)} is VALID [2022-04-28 10:33:52,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {2718#(< main_~a~0 4)} assume !(~b~0 < 6); {2718#(< main_~a~0 4)} is VALID [2022-04-28 10:33:52,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {2718#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2718#(< main_~a~0 4)} is VALID [2022-04-28 10:33:52,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {2718#(< main_~a~0 4)} assume !!(~b~0 < 6); {2718#(< main_~a~0 4)} is VALID [2022-04-28 10:33:52,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {2718#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2718#(< main_~a~0 4)} is VALID [2022-04-28 10:33:52,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {2718#(< main_~a~0 4)} assume !!(~b~0 < 6); {2718#(< main_~a~0 4)} is VALID [2022-04-28 10:33:52,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {2718#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2718#(< main_~a~0 4)} is VALID [2022-04-28 10:33:52,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {2718#(< main_~a~0 4)} assume !!(~b~0 < 6); {2718#(< main_~a~0 4)} is VALID [2022-04-28 10:33:52,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {2718#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2718#(< main_~a~0 4)} is VALID [2022-04-28 10:33:52,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {2718#(< main_~a~0 4)} assume !!(~b~0 < 6); {2718#(< main_~a~0 4)} is VALID [2022-04-28 10:33:52,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {2718#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2718#(< main_~a~0 4)} is VALID [2022-04-28 10:33:52,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {2718#(< main_~a~0 4)} assume !!(~b~0 < 6); {2718#(< main_~a~0 4)} is VALID [2022-04-28 10:33:52,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {2718#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2718#(< main_~a~0 4)} is VALID [2022-04-28 10:33:52,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {2718#(< main_~a~0 4)} assume !!(~b~0 < 6); {2718#(< main_~a~0 4)} is VALID [2022-04-28 10:33:52,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {2718#(< main_~a~0 4)} assume !!(~a~0 < 6);~b~0 := 0; {2718#(< main_~a~0 4)} is VALID [2022-04-28 10:33:52,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {2535#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {2718#(< main_~a~0 4)} is VALID [2022-04-28 10:33:52,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {2535#true} call #t~ret6 := main(); {2535#true} is VALID [2022-04-28 10:33:52,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2535#true} {2535#true} #44#return; {2535#true} is VALID [2022-04-28 10:33:52,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {2535#true} assume true; {2535#true} is VALID [2022-04-28 10:33:52,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {2535#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(11, 2);call #Ultimate.allocInit(12, 3); {2535#true} is VALID [2022-04-28 10:33:52,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {2535#true} call ULTIMATE.init(); {2535#true} is VALID [2022-04-28 10:33:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 10:33:52,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769634394] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:52,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:52,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 10:33:52,440 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:52,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1155929870] [2022-04-28 10:33:52,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1155929870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:52,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:52,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:33:52,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258309226] [2022-04-28 10:33:52,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:52,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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 39 [2022-04-28 10:33:52,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:52,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:52,454 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:52,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:33:52,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:52,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:33:52,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:52,454 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:52,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:52,609 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-04-28 10:33:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:33:52,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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 39 [2022-04-28 10:33:52,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 10:33:52,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 10:33:52,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-28 10:33:52,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:52,633 INFO L225 Difference]: With dead ends: 72 [2022-04-28 10:33:52,633 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 10:33:52,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:33:52,634 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:52,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 29 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 10:33:52,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2022-04-28 10:33:52,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:52,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 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:52,678 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 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:52,678 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 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:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:52,679 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-28 10:33:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-28 10:33:52,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:52,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:52,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 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 69 states. [2022-04-28 10:33:52,680 INFO L87 Difference]: Start difference. First operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 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 69 states. [2022-04-28 10:33:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:52,681 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-28 10:33:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-28 10:33:52,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:52,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:52,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:52,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 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:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-04-28 10:33:52,683 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 39 [2022-04-28 10:33:52,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:52,683 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-04-28 10:33:52,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:52,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2022-04-28 10:33:52,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-04-28 10:33:52,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 10:33:52,727 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:52,727 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:52,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 10:33:52,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:52,948 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:52,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:52,948 INFO L85 PathProgramCache]: Analyzing trace with hash 130610022, now seen corresponding path program 15 times [2022-04-28 10:33:52,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:52,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1289520974] [2022-04-28 10:33:53,006 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:53,039 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:53,039 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:53,039 INFO L85 PathProgramCache]: Analyzing trace with hash 130610022, now seen corresponding path program 16 times [2022-04-28 10:33:53,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:53,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161020627] [2022-04-28 10:33:53,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:53,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:53,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:53,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {3188#(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(11, 2);call #Ultimate.allocInit(12, 3); {3179#true} is VALID [2022-04-28 10:33:53,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-28 10:33:53,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3179#true} {3179#true} #44#return; {3179#true} is VALID [2022-04-28 10:33:53,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {3179#true} call ULTIMATE.init(); {3188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:53,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {3188#(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(11, 2);call #Ultimate.allocInit(12, 3); {3179#true} is VALID [2022-04-28 10:33:53,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-28 10:33:53,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3179#true} {3179#true} #44#return; {3179#true} is VALID [2022-04-28 10:33:53,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {3179#true} call #t~ret6 := main(); {3179#true} is VALID [2022-04-28 10:33:53,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {3179#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {3184#(= main_~a~0 0)} is VALID [2022-04-28 10:33:53,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {3184#(= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {3184#(= main_~a~0 0)} is VALID [2022-04-28 10:33:53,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {3184#(= main_~a~0 0)} assume !!(~b~0 < 6); {3184#(= main_~a~0 0)} is VALID [2022-04-28 10:33:53,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3184#(= main_~a~0 0)} is VALID [2022-04-28 10:33:53,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#(= main_~a~0 0)} assume !!(~b~0 < 6); {3184#(= main_~a~0 0)} is VALID [2022-04-28 10:33:53,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {3184#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3184#(= main_~a~0 0)} is VALID [2022-04-28 10:33:53,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {3184#(= main_~a~0 0)} assume !!(~b~0 < 6); {3184#(= main_~a~0 0)} is VALID [2022-04-28 10:33:53,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {3184#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3184#(= main_~a~0 0)} is VALID [2022-04-28 10:33:53,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {3184#(= main_~a~0 0)} assume !!(~b~0 < 6); {3184#(= main_~a~0 0)} is VALID [2022-04-28 10:33:53,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {3184#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3184#(= main_~a~0 0)} is VALID [2022-04-28 10:33:53,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {3184#(= main_~a~0 0)} assume !!(~b~0 < 6); {3184#(= main_~a~0 0)} is VALID [2022-04-28 10:33:53,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {3184#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3184#(= main_~a~0 0)} is VALID [2022-04-28 10:33:53,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {3184#(= main_~a~0 0)} assume !!(~b~0 < 6); {3184#(= main_~a~0 0)} is VALID [2022-04-28 10:33:53,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {3184#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3184#(= main_~a~0 0)} is VALID [2022-04-28 10:33:53,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {3184#(= main_~a~0 0)} assume !(~b~0 < 6); {3184#(= main_~a~0 0)} is VALID [2022-04-28 10:33:53,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {3184#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {3185#(<= main_~a~0 1)} assume !!(~a~0 < 6);~b~0 := 0; {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {3185#(<= main_~a~0 1)} assume !!(~b~0 < 6); {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {3185#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {3185#(<= main_~a~0 1)} assume !!(~b~0 < 6); {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {3185#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {3185#(<= main_~a~0 1)} assume !!(~b~0 < 6); {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {3185#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {3185#(<= main_~a~0 1)} assume !!(~b~0 < 6); {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {3185#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {3185#(<= main_~a~0 1)} assume !!(~b~0 < 6); {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {3185#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {3185#(<= main_~a~0 1)} assume !!(~b~0 < 6); {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {3185#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {3185#(<= main_~a~0 1)} assume !(~b~0 < 6); {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {3185#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~a~0 < 6);~b~0 := 0; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,102 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,102 INFO L290 TraceCheckUtils]: 39: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,103 INFO L290 TraceCheckUtils]: 42: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,103 INFO L290 TraceCheckUtils]: 43: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,103 INFO L290 TraceCheckUtils]: 44: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,103 INFO L290 TraceCheckUtils]: 45: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,104 INFO L290 TraceCheckUtils]: 47: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,104 INFO L290 TraceCheckUtils]: 48: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,104 INFO L290 TraceCheckUtils]: 49: Hoare triple {3186#(<= main_~a~0 2)} assume !(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {3186#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {3187#(<= main_~a~0 3)} assume !(~a~0 < 6); {3180#false} is VALID [2022-04-28 10:33:53,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {3180#false} assume !(6 == ~a~0 && 6 == ~b~0); {3180#false} is VALID [2022-04-28 10:33:53,105 INFO L290 TraceCheckUtils]: 53: Hoare triple {3180#false} assume !false; {3180#false} is VALID [2022-04-28 10:33:53,105 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-04-28 10:33:53,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:53,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161020627] [2022-04-28 10:33:53,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161020627] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:53,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134594099] [2022-04-28 10:33:53,106 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:33:53,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:53,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:53,107 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:33:53,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 10:33:53,142 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:33:53,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:53,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 10:33:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:53,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:53,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {3179#true} call ULTIMATE.init(); {3179#true} is VALID [2022-04-28 10:33:53,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {3179#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(11, 2);call #Ultimate.allocInit(12, 3); {3179#true} is VALID [2022-04-28 10:33:53,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-28 10:33:53,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3179#true} {3179#true} #44#return; {3179#true} is VALID [2022-04-28 10:33:53,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {3179#true} call #t~ret6 := main(); {3179#true} is VALID [2022-04-28 10:33:53,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {3179#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {3207#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:53,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {3207#(<= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {3207#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:53,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {3207#(<= main_~a~0 0)} assume !!(~b~0 < 6); {3207#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:53,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {3207#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3207#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:53,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {3207#(<= main_~a~0 0)} assume !!(~b~0 < 6); {3207#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:53,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {3207#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3207#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:53,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {3207#(<= main_~a~0 0)} assume !!(~b~0 < 6); {3207#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:53,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {3207#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3207#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:53,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {3207#(<= main_~a~0 0)} assume !!(~b~0 < 6); {3207#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:53,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {3207#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3207#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:53,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {3207#(<= main_~a~0 0)} assume !!(~b~0 < 6); {3207#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:53,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {3207#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3207#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:53,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {3207#(<= main_~a~0 0)} assume !!(~b~0 < 6); {3207#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:53,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {3207#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3207#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:53,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {3207#(<= main_~a~0 0)} assume !(~b~0 < 6); {3207#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:53,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {3207#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {3185#(<= main_~a~0 1)} assume !!(~a~0 < 6);~b~0 := 0; {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {3185#(<= main_~a~0 1)} assume !!(~b~0 < 6); {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {3185#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {3185#(<= main_~a~0 1)} assume !!(~b~0 < 6); {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {3185#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {3185#(<= main_~a~0 1)} assume !!(~b~0 < 6); {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {3185#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {3185#(<= main_~a~0 1)} assume !!(~b~0 < 6); {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {3185#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {3185#(<= main_~a~0 1)} assume !!(~b~0 < 6); {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {3185#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {3185#(<= main_~a~0 1)} assume !!(~b~0 < 6); {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {3185#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {3185#(<= main_~a~0 1)} assume !(~b~0 < 6); {3185#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:53,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {3185#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~a~0 < 6);~b~0 := 0; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,363 INFO L290 TraceCheckUtils]: 43: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,364 INFO L290 TraceCheckUtils]: 44: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,364 INFO L290 TraceCheckUtils]: 45: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,364 INFO L290 TraceCheckUtils]: 46: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,365 INFO L290 TraceCheckUtils]: 48: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,365 INFO L290 TraceCheckUtils]: 49: Hoare triple {3186#(<= main_~a~0 2)} assume !(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,365 INFO L290 TraceCheckUtils]: 50: Hoare triple {3186#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,366 INFO L290 TraceCheckUtils]: 51: Hoare triple {3187#(<= main_~a~0 3)} assume !(~a~0 < 6); {3180#false} is VALID [2022-04-28 10:33:53,366 INFO L290 TraceCheckUtils]: 52: Hoare triple {3180#false} assume !(6 == ~a~0 && 6 == ~b~0); {3180#false} is VALID [2022-04-28 10:33:53,366 INFO L290 TraceCheckUtils]: 53: Hoare triple {3180#false} assume !false; {3180#false} is VALID [2022-04-28 10:33:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-04-28 10:33:53,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:53,584 INFO L290 TraceCheckUtils]: 53: Hoare triple {3180#false} assume !false; {3180#false} is VALID [2022-04-28 10:33:53,585 INFO L290 TraceCheckUtils]: 52: Hoare triple {3180#false} assume !(6 == ~a~0 && 6 == ~b~0); {3180#false} is VALID [2022-04-28 10:33:53,585 INFO L290 TraceCheckUtils]: 51: Hoare triple {3358#(< main_~a~0 6)} assume !(~a~0 < 6); {3180#false} is VALID [2022-04-28 10:33:53,585 INFO L290 TraceCheckUtils]: 50: Hoare triple {3362#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3358#(< main_~a~0 6)} is VALID [2022-04-28 10:33:53,585 INFO L290 TraceCheckUtils]: 49: Hoare triple {3362#(< main_~a~0 5)} assume !(~b~0 < 6); {3362#(< main_~a~0 5)} is VALID [2022-04-28 10:33:53,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {3362#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3362#(< main_~a~0 5)} is VALID [2022-04-28 10:33:53,586 INFO L290 TraceCheckUtils]: 47: Hoare triple {3362#(< main_~a~0 5)} assume !!(~b~0 < 6); {3362#(< main_~a~0 5)} is VALID [2022-04-28 10:33:53,586 INFO L290 TraceCheckUtils]: 46: Hoare triple {3362#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3362#(< main_~a~0 5)} is VALID [2022-04-28 10:33:53,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {3362#(< main_~a~0 5)} assume !!(~b~0 < 6); {3362#(< main_~a~0 5)} is VALID [2022-04-28 10:33:53,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {3362#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3362#(< main_~a~0 5)} is VALID [2022-04-28 10:33:53,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {3362#(< main_~a~0 5)} assume !!(~b~0 < 6); {3362#(< main_~a~0 5)} is VALID [2022-04-28 10:33:53,587 INFO L290 TraceCheckUtils]: 42: Hoare triple {3362#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3362#(< main_~a~0 5)} is VALID [2022-04-28 10:33:53,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {3362#(< main_~a~0 5)} assume !!(~b~0 < 6); {3362#(< main_~a~0 5)} is VALID [2022-04-28 10:33:53,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {3362#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3362#(< main_~a~0 5)} is VALID [2022-04-28 10:33:53,588 INFO L290 TraceCheckUtils]: 39: Hoare triple {3362#(< main_~a~0 5)} assume !!(~b~0 < 6); {3362#(< main_~a~0 5)} is VALID [2022-04-28 10:33:53,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {3362#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3362#(< main_~a~0 5)} is VALID [2022-04-28 10:33:53,589 INFO L290 TraceCheckUtils]: 37: Hoare triple {3362#(< main_~a~0 5)} assume !!(~b~0 < 6); {3362#(< main_~a~0 5)} is VALID [2022-04-28 10:33:53,589 INFO L290 TraceCheckUtils]: 36: Hoare triple {3362#(< main_~a~0 5)} assume !!(~a~0 < 6);~b~0 := 0; {3362#(< main_~a~0 5)} is VALID [2022-04-28 10:33:53,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {3187#(<= main_~a~0 3)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3362#(< main_~a~0 5)} is VALID [2022-04-28 10:33:53,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {3187#(<= main_~a~0 3)} assume !(~b~0 < 6); {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {3187#(<= main_~a~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {3187#(<= main_~a~0 3)} assume !!(~b~0 < 6); {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {3187#(<= main_~a~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {3187#(<= main_~a~0 3)} assume !!(~b~0 < 6); {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {3187#(<= main_~a~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {3187#(<= main_~a~0 3)} assume !!(~b~0 < 6); {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {3187#(<= main_~a~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {3187#(<= main_~a~0 3)} assume !!(~b~0 < 6); {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {3187#(<= main_~a~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {3187#(<= main_~a~0 3)} assume !!(~b~0 < 6); {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {3187#(<= main_~a~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {3187#(<= main_~a~0 3)} assume !!(~b~0 < 6); {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {3187#(<= main_~a~0 3)} assume !!(~a~0 < 6);~b~0 := 0; {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {3186#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3187#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:53,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {3186#(<= main_~a~0 2)} assume !(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {3186#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~b~0 < 6); {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {3186#(<= main_~a~0 2)} assume !!(~a~0 < 6);~b~0 := 0; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {3179#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {3186#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:53,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {3179#true} call #t~ret6 := main(); {3179#true} is VALID [2022-04-28 10:33:53,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3179#true} {3179#true} #44#return; {3179#true} is VALID [2022-04-28 10:33:53,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {3179#true} assume true; {3179#true} is VALID [2022-04-28 10:33:53,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {3179#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(11, 2);call #Ultimate.allocInit(12, 3); {3179#true} is VALID [2022-04-28 10:33:53,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {3179#true} call ULTIMATE.init(); {3179#true} is VALID [2022-04-28 10:33:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-04-28 10:33:53,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134594099] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:53,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:53,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-28 10:33:53,599 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:53,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1289520974] [2022-04-28 10:33:53,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1289520974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:53,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:53,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:33:53,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538567510] [2022-04-28 10:33:53,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:53,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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 54 [2022-04-28 10:33:53,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:53,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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:53,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:53,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:33:53,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:53,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:33:53,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:53,634 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:53,835 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2022-04-28 10:33:53,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:33:53,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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 54 [2022-04-28 10:33:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-04-28 10:33:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-04-28 10:33:53,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 37 transitions. [2022-04-28 10:33:53,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:53,863 INFO L225 Difference]: With dead ends: 87 [2022-04-28 10:33:53,863 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 10:33:53,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:33:53,863 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:53,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 29 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 10:33:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2022-04-28 10:33:53,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:53,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 70 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 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:53,948 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 70 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 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:53,949 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 70 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 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:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:53,950 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-04-28 10:33:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-04-28 10:33:53,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:53,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:53,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 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 84 states. [2022-04-28 10:33:53,951 INFO L87 Difference]: Start difference. First operand has 70 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 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 84 states. [2022-04-28 10:33:53,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:53,952 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-04-28 10:33:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-04-28 10:33:53,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:53,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:53,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:53,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 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:53,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-04-28 10:33:53,954 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 54 [2022-04-28 10:33:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:53,954 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-04-28 10:33:53,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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:53,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 74 transitions. [2022-04-28 10:33:54,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-04-28 10:33:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 10:33:54,020 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:54,021 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:54,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 10:33:54,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 10:33:54,223 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:54,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:54,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1010753069, now seen corresponding path program 17 times [2022-04-28 10:33:54,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:54,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [670673304] [2022-04-28 10:33:54,295 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:54,325 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:54,325 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:54,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1010753069, now seen corresponding path program 18 times [2022-04-28 10:33:54,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:54,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376011651] [2022-04-28 10:33:54,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:54,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:54,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:54,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {4015#(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(11, 2);call #Ultimate.allocInit(12, 3); {4005#true} is VALID [2022-04-28 10:33:54,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {4005#true} assume true; {4005#true} is VALID [2022-04-28 10:33:54,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4005#true} {4005#true} #44#return; {4005#true} is VALID [2022-04-28 10:33:54,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {4005#true} call ULTIMATE.init(); {4015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:54,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {4015#(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(11, 2);call #Ultimate.allocInit(12, 3); {4005#true} is VALID [2022-04-28 10:33:54,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {4005#true} assume true; {4005#true} is VALID [2022-04-28 10:33:54,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4005#true} {4005#true} #44#return; {4005#true} is VALID [2022-04-28 10:33:54,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {4005#true} call #t~ret6 := main(); {4005#true} is VALID [2022-04-28 10:33:54,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {4005#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {4010#(= main_~a~0 0)} is VALID [2022-04-28 10:33:54,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {4010#(= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {4010#(= main_~a~0 0)} is VALID [2022-04-28 10:33:54,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {4010#(= main_~a~0 0)} assume !!(~b~0 < 6); {4010#(= main_~a~0 0)} is VALID [2022-04-28 10:33:54,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {4010#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4010#(= main_~a~0 0)} is VALID [2022-04-28 10:33:54,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {4010#(= main_~a~0 0)} assume !!(~b~0 < 6); {4010#(= main_~a~0 0)} is VALID [2022-04-28 10:33:54,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {4010#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4010#(= main_~a~0 0)} is VALID [2022-04-28 10:33:54,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {4010#(= main_~a~0 0)} assume !!(~b~0 < 6); {4010#(= main_~a~0 0)} is VALID [2022-04-28 10:33:54,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {4010#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4010#(= main_~a~0 0)} is VALID [2022-04-28 10:33:54,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {4010#(= main_~a~0 0)} assume !!(~b~0 < 6); {4010#(= main_~a~0 0)} is VALID [2022-04-28 10:33:54,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {4010#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4010#(= main_~a~0 0)} is VALID [2022-04-28 10:33:54,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {4010#(= main_~a~0 0)} assume !!(~b~0 < 6); {4010#(= main_~a~0 0)} is VALID [2022-04-28 10:33:54,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {4010#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4010#(= main_~a~0 0)} is VALID [2022-04-28 10:33:54,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {4010#(= main_~a~0 0)} assume !!(~b~0 < 6); {4010#(= main_~a~0 0)} is VALID [2022-04-28 10:33:54,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {4010#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4010#(= main_~a~0 0)} is VALID [2022-04-28 10:33:54,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {4010#(= main_~a~0 0)} assume !(~b~0 < 6); {4010#(= main_~a~0 0)} is VALID [2022-04-28 10:33:54,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {4010#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4011#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:54,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {4011#(<= main_~a~0 1)} assume !!(~a~0 < 6);~b~0 := 0; {4011#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:54,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {4011#(<= main_~a~0 1)} assume !!(~b~0 < 6); {4011#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:54,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {4011#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4011#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:54,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {4011#(<= main_~a~0 1)} assume !!(~b~0 < 6); {4011#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:54,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {4011#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4011#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:54,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {4011#(<= main_~a~0 1)} assume !!(~b~0 < 6); {4011#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:54,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {4011#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4011#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:54,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {4011#(<= main_~a~0 1)} assume !!(~b~0 < 6); {4011#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:54,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {4011#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4011#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:54,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {4011#(<= main_~a~0 1)} assume !!(~b~0 < 6); {4011#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:54,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {4011#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4011#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:54,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {4011#(<= main_~a~0 1)} assume !!(~b~0 < 6); {4011#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:54,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {4011#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4011#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:54,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {4011#(<= main_~a~0 1)} assume !(~b~0 < 6); {4011#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:54,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {4011#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4012#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:54,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {4012#(<= main_~a~0 2)} assume !!(~a~0 < 6);~b~0 := 0; {4012#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:54,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {4012#(<= main_~a~0 2)} assume !!(~b~0 < 6); {4012#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:54,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {4012#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4012#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:54,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {4012#(<= main_~a~0 2)} assume !!(~b~0 < 6); {4012#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:54,422 INFO L290 TraceCheckUtils]: 40: Hoare triple {4012#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4012#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:54,422 INFO L290 TraceCheckUtils]: 41: Hoare triple {4012#(<= main_~a~0 2)} assume !!(~b~0 < 6); {4012#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:54,422 INFO L290 TraceCheckUtils]: 42: Hoare triple {4012#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4012#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:54,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {4012#(<= main_~a~0 2)} assume !!(~b~0 < 6); {4012#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:54,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {4012#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4012#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:54,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {4012#(<= main_~a~0 2)} assume !!(~b~0 < 6); {4012#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:54,423 INFO L290 TraceCheckUtils]: 46: Hoare triple {4012#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4012#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:54,423 INFO L290 TraceCheckUtils]: 47: Hoare triple {4012#(<= main_~a~0 2)} assume !!(~b~0 < 6); {4012#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:54,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {4012#(<= main_~a~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4012#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:54,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {4012#(<= main_~a~0 2)} assume !(~b~0 < 6); {4012#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:54,424 INFO L290 TraceCheckUtils]: 50: Hoare triple {4012#(<= main_~a~0 2)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4013#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:54,424 INFO L290 TraceCheckUtils]: 51: Hoare triple {4013#(<= main_~a~0 3)} assume !!(~a~0 < 6);~b~0 := 0; {4013#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:54,425 INFO L290 TraceCheckUtils]: 52: Hoare triple {4013#(<= main_~a~0 3)} assume !!(~b~0 < 6); {4013#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:54,425 INFO L290 TraceCheckUtils]: 53: Hoare triple {4013#(<= main_~a~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4013#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:54,425 INFO L290 TraceCheckUtils]: 54: Hoare triple {4013#(<= main_~a~0 3)} assume !!(~b~0 < 6); {4013#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:54,425 INFO L290 TraceCheckUtils]: 55: Hoare triple {4013#(<= main_~a~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4013#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:54,426 INFO L290 TraceCheckUtils]: 56: Hoare triple {4013#(<= main_~a~0 3)} assume !!(~b~0 < 6); {4013#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:54,426 INFO L290 TraceCheckUtils]: 57: Hoare triple {4013#(<= main_~a~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4013#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:54,426 INFO L290 TraceCheckUtils]: 58: Hoare triple {4013#(<= main_~a~0 3)} assume !!(~b~0 < 6); {4013#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:54,426 INFO L290 TraceCheckUtils]: 59: Hoare triple {4013#(<= main_~a~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4013#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:54,426 INFO L290 TraceCheckUtils]: 60: Hoare triple {4013#(<= main_~a~0 3)} assume !!(~b~0 < 6); {4013#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:54,427 INFO L290 TraceCheckUtils]: 61: Hoare triple {4013#(<= main_~a~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4013#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:54,427 INFO L290 TraceCheckUtils]: 62: Hoare triple {4013#(<= main_~a~0 3)} assume !!(~b~0 < 6); {4013#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:54,427 INFO L290 TraceCheckUtils]: 63: Hoare triple {4013#(<= main_~a~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4013#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:54,427 INFO L290 TraceCheckUtils]: 64: Hoare triple {4013#(<= main_~a~0 3)} assume !(~b~0 < 6); {4013#(<= main_~a~0 3)} is VALID [2022-04-28 10:33:54,428 INFO L290 TraceCheckUtils]: 65: Hoare triple {4013#(<= main_~a~0 3)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4014#(<= main_~a~0 4)} is VALID [2022-04-28 10:33:54,428 INFO L290 TraceCheckUtils]: 66: Hoare triple {4014#(<= main_~a~0 4)} assume !(~a~0 < 6); {4006#false} is VALID [2022-04-28 10:33:54,428 INFO L290 TraceCheckUtils]: 67: Hoare triple {4006#false} assume !(6 == ~a~0 && 6 == ~b~0); {4006#false} is VALID [2022-04-28 10:33:54,428 INFO L290 TraceCheckUtils]: 68: Hoare triple {4006#false} assume !false; {4006#false} is VALID [2022-04-28 10:33:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 526 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 10:33:54,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:54,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376011651] [2022-04-28 10:33:54,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376011651] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:54,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055397010] [2022-04-28 10:33:54,429 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:33:54,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:54,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:54,430 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:33:54,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 10:33:54,481 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-04-28 10:33:54,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:54,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:33:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:54,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:54,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {4005#true} call ULTIMATE.init(); {4005#true} is VALID [2022-04-28 10:33:54,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {4005#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(11, 2);call #Ultimate.allocInit(12, 3); {4005#true} is VALID [2022-04-28 10:33:54,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {4005#true} assume true; {4005#true} is VALID [2022-04-28 10:33:54,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4005#true} {4005#true} #44#return; {4005#true} is VALID [2022-04-28 10:33:54,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {4005#true} call #t~ret6 := main(); {4005#true} is VALID [2022-04-28 10:33:54,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {4005#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {4005#true} is VALID [2022-04-28 10:33:54,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {4005#true} assume !!(~a~0 < 6);~b~0 := 0; {4005#true} is VALID [2022-04-28 10:33:54,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {4005#true} assume !(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {4005#true} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {4005#true} assume !!(~a~0 < 6);~b~0 := 0; {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {4005#true} assume !(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {4005#true} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4005#true} is VALID [2022-04-28 10:33:54,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {4005#true} assume !!(~a~0 < 6);~b~0 := 0; {4005#true} is VALID [2022-04-28 10:33:54,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,778 INFO L290 TraceCheckUtils]: 43: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,778 INFO L290 TraceCheckUtils]: 44: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,778 INFO L290 TraceCheckUtils]: 45: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,778 INFO L290 TraceCheckUtils]: 46: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,778 INFO L290 TraceCheckUtils]: 47: Hoare triple {4005#true} assume !!(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,778 INFO L290 TraceCheckUtils]: 48: Hoare triple {4005#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4005#true} is VALID [2022-04-28 10:33:54,778 INFO L290 TraceCheckUtils]: 49: Hoare triple {4005#true} assume !(~b~0 < 6); {4005#true} is VALID [2022-04-28 10:33:54,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {4005#true} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4005#true} is VALID [2022-04-28 10:33:54,787 INFO L290 TraceCheckUtils]: 51: Hoare triple {4005#true} assume !!(~a~0 < 6);~b~0 := 0; {4172#(< main_~a~0 6)} is VALID [2022-04-28 10:33:54,787 INFO L290 TraceCheckUtils]: 52: Hoare triple {4172#(< main_~a~0 6)} assume !!(~b~0 < 6); {4172#(< main_~a~0 6)} is VALID [2022-04-28 10:33:54,788 INFO L290 TraceCheckUtils]: 53: Hoare triple {4172#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4172#(< main_~a~0 6)} is VALID [2022-04-28 10:33:54,788 INFO L290 TraceCheckUtils]: 54: Hoare triple {4172#(< main_~a~0 6)} assume !!(~b~0 < 6); {4172#(< main_~a~0 6)} is VALID [2022-04-28 10:33:54,788 INFO L290 TraceCheckUtils]: 55: Hoare triple {4172#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4172#(< main_~a~0 6)} is VALID [2022-04-28 10:33:54,788 INFO L290 TraceCheckUtils]: 56: Hoare triple {4172#(< main_~a~0 6)} assume !!(~b~0 < 6); {4172#(< main_~a~0 6)} is VALID [2022-04-28 10:33:54,789 INFO L290 TraceCheckUtils]: 57: Hoare triple {4172#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4172#(< main_~a~0 6)} is VALID [2022-04-28 10:33:54,789 INFO L290 TraceCheckUtils]: 58: Hoare triple {4172#(< main_~a~0 6)} assume !!(~b~0 < 6); {4172#(< main_~a~0 6)} is VALID [2022-04-28 10:33:54,789 INFO L290 TraceCheckUtils]: 59: Hoare triple {4172#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4172#(< main_~a~0 6)} is VALID [2022-04-28 10:33:54,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {4172#(< main_~a~0 6)} assume !!(~b~0 < 6); {4172#(< main_~a~0 6)} is VALID [2022-04-28 10:33:54,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {4172#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4172#(< main_~a~0 6)} is VALID [2022-04-28 10:33:54,790 INFO L290 TraceCheckUtils]: 62: Hoare triple {4172#(< main_~a~0 6)} assume !!(~b~0 < 6); {4206#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-28 10:33:54,791 INFO L290 TraceCheckUtils]: 63: Hoare triple {4206#(and (< main_~b~0 6) (< main_~a~0 6))} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4210#(and (< main_~b~0 7) (< main_~a~0 6))} is VALID [2022-04-28 10:33:54,791 INFO L290 TraceCheckUtils]: 64: Hoare triple {4210#(and (< main_~b~0 7) (< main_~a~0 6))} assume !(~b~0 < 6); {4214#(and (< main_~b~0 7) (< main_~a~0 6) (not (< main_~b~0 6)))} is VALID [2022-04-28 10:33:54,791 INFO L290 TraceCheckUtils]: 65: Hoare triple {4214#(and (< main_~b~0 7) (< main_~a~0 6) (not (< main_~b~0 6)))} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4218#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)))} is VALID [2022-04-28 10:33:54,792 INFO L290 TraceCheckUtils]: 66: Hoare triple {4218#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)))} assume !(~a~0 < 6); {4222#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)) (not (< main_~a~0 6)))} is VALID [2022-04-28 10:33:54,792 INFO L290 TraceCheckUtils]: 67: Hoare triple {4222#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)) (not (< main_~a~0 6)))} assume !(6 == ~a~0 && 6 == ~b~0); {4006#false} is VALID [2022-04-28 10:33:54,792 INFO L290 TraceCheckUtils]: 68: Hoare triple {4006#false} assume !false; {4006#false} is VALID [2022-04-28 10:33:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2022-04-28 10:33:54,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:33:54,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055397010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:54,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:33:54,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-04-28 10:33:54,793 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:54,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [670673304] [2022-04-28 10:33:54,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [670673304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:54,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:54,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:33:54,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078533521] [2022-04-28 10:33:54,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:54,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 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 69 [2022-04-28 10:33:54,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:54,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 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:54,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:54,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:33:54,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:54,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:33:54,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:33:54,805 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 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:55,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:55,017 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2022-04-28 10:33:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:33:55,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 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 69 [2022-04-28 10:33:55,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 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:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2022-04-28 10:33:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 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:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2022-04-28 10:33:55,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 16 transitions. [2022-04-28 10:33:55,030 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:55,031 INFO L225 Difference]: With dead ends: 70 [2022-04-28 10:33:55,031 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:33:55,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:33:55,032 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:55,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 31 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:33:55,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:33:55,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:55,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:33:55,032 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:33:55,032 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:33:55,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:55,033 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:33:55,033 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:33:55,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:55,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:55,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:33:55,033 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:33:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:55,033 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:33:55,033 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:33:55,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:55,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:55,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:55,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:55,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:33:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:33:55,033 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2022-04-28 10:33:55,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:55,033 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:33:55,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 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:55,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:33:55,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:33:55,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:55,035 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:33:55,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 10:33:55,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:55,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:33:56,102 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-28 10:33:56,103 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-28 10:33:56,103 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-28 10:33:56,103 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:33:56,103 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 10:33:56,103 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:33:56,103 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:33:56,103 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 10:33:56,103 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:33:56,103 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:33:56,103 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 15 29) the Hoare annotation is: true [2022-04-28 10:33:56,103 INFO L902 garLoopResultBuilder]: At program point L25-1(lines 25 27) the Hoare annotation is: true [2022-04-28 10:33:56,103 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 23) the Hoare annotation is: (and (<= main_~b~0 5) (< main_~a~0 6)) [2022-04-28 10:33:56,103 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 23) the Hoare annotation is: (and (< main_~b~0 7) (< main_~a~0 6)) [2022-04-28 10:33:56,103 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 15 29) the Hoare annotation is: true [2022-04-28 10:33:56,104 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 26) the Hoare annotation is: false [2022-04-28 10:33:56,104 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 15 29) the Hoare annotation is: true [2022-04-28 10:33:56,104 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: false [2022-04-28 10:33:56,104 INFO L895 garLoopResultBuilder]: At program point L20-2(lines 20 24) the Hoare annotation is: (and (< main_~b~0 7) (< main_~a~0 6) (not (< main_~b~0 6))) [2022-04-28 10:33:56,104 INFO L895 garLoopResultBuilder]: At program point L20-3(lines 20 24) the Hoare annotation is: (and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6))) [2022-04-28 10:33:56,104 INFO L895 garLoopResultBuilder]: At program point L20-4(lines 15 29) the Hoare annotation is: (and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)) (not (< main_~a~0 6))) [2022-04-28 10:33:56,106 INFO L356 BasicCegarLoop]: Path program histogram: [18, 2, 2] [2022-04-28 10:33:56,107 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:33:56,109 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:33:56,120 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 10:33:56,126 INFO L163 areAnnotationChecker]: CFG has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:33:56,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:33:56 BoogieIcfgContainer [2022-04-28 10:33:56,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:33:56,138 INFO L158 Benchmark]: Toolchain (without parser) took 10314.43ms. Allocated memory was 183.5MB in the beginning and 264.2MB in the end (delta: 80.7MB). Free memory was 135.3MB in the beginning and 149.8MB in the end (delta: -14.5MB). Peak memory consumption was 127.7MB. Max. memory is 8.0GB. [2022-04-28 10:33:56,138 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:33:56,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.32ms. Allocated memory is still 183.5MB. Free memory was 135.1MB in the beginning and 160.1MB in the end (delta: -25.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 10:33:56,138 INFO L158 Benchmark]: Boogie Preprocessor took 29.80ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 158.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 10:33:56,138 INFO L158 Benchmark]: RCFGBuilder took 201.63ms. Allocated memory is still 183.5MB. Free memory was 158.9MB in the beginning and 149.0MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 10:33:56,139 INFO L158 Benchmark]: TraceAbstraction took 9872.70ms. Allocated memory was 183.5MB in the beginning and 264.2MB in the end (delta: 80.7MB). Free memory was 148.4MB in the beginning and 149.8MB in the end (delta: -1.5MB). Peak memory consumption was 141.7MB. Max. memory is 8.0GB. [2022-04-28 10:33:56,139 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.11ms. Allocated memory is still 183.5MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.32ms. Allocated memory is still 183.5MB. Free memory was 135.1MB in the beginning and 160.1MB in the end (delta: -25.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.80ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 158.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 201.63ms. Allocated memory is still 183.5MB. Free memory was 158.9MB in the beginning and 149.0MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9872.70ms. Allocated memory was 183.5MB in the beginning and 264.2MB in the end (delta: 80.7MB). Free memory was 148.4MB in the beginning and 149.8MB in the end (delta: -1.5MB). Peak memory consumption was 141.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 26]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 11, TraceHistogramMax: 24, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 218 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 218 mSDsluCounter, 288 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 258 IncrementalHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 131 mSDtfsCounter, 258 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 651 GetRequests, 531 SyntacticMatches, 3 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=10, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 45 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 85 NumberOfFragments, 70 HoareAnnotationTreeSize, 18 FomulaSimplifications, 217 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 18 FomulaSimplificationsInter, 1257 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: b < 7 && a < 6 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (a < 7 && b < 7) && !(b < 6) - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 10:33:56,161 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...