/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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:15:12,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:15:12,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:15:12,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:15:12,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:15:12,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:15:12,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:15:12,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:15:12,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:15:12,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:15:12,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:15:12,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:15:12,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:15:12,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:15:12,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:15:12,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:15:12,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:15:12,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:15:12,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:15:12,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:15:12,493 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:15:12,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:15:12,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:15:12,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:15:12,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:15:12,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:15:12,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:15:12,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:15:12,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:15:12,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:15:12,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:15:12,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:15:12,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:15:12,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:15:12,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:15:12,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:15:12,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:15:12,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:15:12,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:15:12,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:15:12,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:15:12,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:15:12,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:15:12,531 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:15:12,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:15:12,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:15:12,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:15:12,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:15:12,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:15:12,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:15:12,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:15:12,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:15:12,534 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:15:12,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:15:12,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:15:12,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:15:12,535 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:15:12,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:15:12,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:15:12,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:15:12,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:15:12,535 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:15:12,535 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:15:12,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:15:12,536 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:15:12,536 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-15 13:15:12,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:15:12,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:15:12,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:15:12,775 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:15:12,775 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:15:12,776 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_6.c [2022-04-15 13:15:12,849 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd0a982a9/ef6049050c994809876baf807edcac70/FLAG592f7ead5 [2022-04-15 13:15:13,192 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:15:13,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_6.c [2022-04-15 13:15:13,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd0a982a9/ef6049050c994809876baf807edcac70/FLAG592f7ead5 [2022-04-15 13:15:13,209 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd0a982a9/ef6049050c994809876baf807edcac70 [2022-04-15 13:15:13,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:15:13,213 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:15:13,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:15:13,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:15:13,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:15:13,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:15:13" (1/1) ... [2022-04-15 13:15:13,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@720a0989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:15:13, skipping insertion in model container [2022-04-15 13:15:13,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:15:13" (1/1) ... [2022-04-15 13:15:13,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:15:13,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:15:13,395 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_6.c[959,972] [2022-04-15 13:15:13,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:15:13,406 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:15:13,421 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_6.c[959,972] [2022-04-15 13:15:13,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:15:13,433 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:15:13,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:15:13 WrapperNode [2022-04-15 13:15:13,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:15:13,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:15:13,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:15:13,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:15:13,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:15:13" (1/1) ... [2022-04-15 13:15:13,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:15:13" (1/1) ... [2022-04-15 13:15:13,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:15:13" (1/1) ... [2022-04-15 13:15:13,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:15:13" (1/1) ... [2022-04-15 13:15:13,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:15:13" (1/1) ... [2022-04-15 13:15:13,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:15:13" (1/1) ... [2022-04-15 13:15:13,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:15:13" (1/1) ... [2022-04-15 13:15:13,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:15:13,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:15:13,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:15:13,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:15:13,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:15:13" (1/1) ... [2022-04-15 13:15:13,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:15:13,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:15:13,492 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-15 13:15:13,501 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-15 13:15:13,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:15:13,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:15:13,525 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:15:13,525 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:15:13,525 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:15:13,525 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:15:13,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:15:13,525 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:15:13,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:15:13,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:15:13,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:15:13,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:15:13,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:15:13,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:15:13,579 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:15:13,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:15:13,693 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:15:13,700 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:15:13,700 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-15 13:15:13,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:15:13 BoogieIcfgContainer [2022-04-15 13:15:13,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:15:13,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:15:13,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:15:13,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:15:13,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:15:13" (1/3) ... [2022-04-15 13:15:13,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55bb982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:15:13, skipping insertion in model container [2022-04-15 13:15:13,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:15:13" (2/3) ... [2022-04-15 13:15:13,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55bb982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:15:13, skipping insertion in model container [2022-04-15 13:15:13,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:15:13" (3/3) ... [2022-04-15 13:15:13,709 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_6.c [2022-04-15 13:15:13,713 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:15:13,713 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:15:13,772 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:15:13,790 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 13:15:13,790 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:15:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 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-15 13:15:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 13:15:13,835 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:15:13,836 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:15:13,836 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:15:13,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:15:13,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1187922237, now seen corresponding path program 1 times [2022-04-15 13:15:13,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:13,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [159611317] [2022-04-15 13:15:13,870 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:15:13,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1187922237, now seen corresponding path program 2 times [2022-04-15 13:15:13,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:15:13,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767807614] [2022-04-15 13:15:13,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:15:13,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:15:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:14,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:15:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:14,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(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); {29#true} is VALID [2022-04-15 13:15:14,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 13:15:14,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #92#return; {29#true} is VALID [2022-04-15 13:15:14,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:15:14,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(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); {29#true} is VALID [2022-04-15 13:15:14,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 13:15:14,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #92#return; {29#true} is VALID [2022-04-15 13:15:14,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret10 := main(); {29#true} is VALID [2022-04-15 13:15:14,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {34#(= main_~a~0 0)} is VALID [2022-04-15 13:15:14,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#(= main_~a~0 0)} assume !(~a~0 < 6); {30#false} is VALID [2022-04-15 13:15:14,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {30#false} is VALID [2022-04-15 13:15:14,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-15 13:15:14,076 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-15 13:15:14,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:15:14,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767807614] [2022-04-15 13:15:14,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767807614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:14,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:14,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:15:14,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:15:14,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [159611317] [2022-04-15 13:15:14,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [159611317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:14,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:14,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:15:14,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203185103] [2022-04-15 13:15:14,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:15:14,087 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-15 13:15:14,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:15:14,091 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-15 13:15:14,122 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-15 13:15:14,122 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:15:14,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:14,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:15:14,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:15:14,156 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 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-15 13:15:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:14,401 INFO L93 Difference]: Finished difference Result 58 states and 94 transitions. [2022-04-15 13:15:14,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:15:14,401 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-15 13:15:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:15:14,403 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-15 13:15:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 13:15:14,417 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-15 13:15:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 13:15:14,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-15 13:15:14,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:15:14,521 INFO L225 Difference]: With dead ends: 58 [2022-04-15 13:15:14,521 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 13:15:14,524 INFO L912 BasicCegarLoop]: 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-15 13:15:14,531 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 56 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:15:14,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 38 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:15:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 13:15:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2022-04-15 13:15:14,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:15:14,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-15 13:15:14,570 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-15 13:15:14,570 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-15 13:15:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:14,573 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-15 13:15:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-15 13:15:14,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:14,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:14,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 33 states. [2022-04-15 13:15:14,575 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 33 states. [2022-04-15 13:15:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:14,578 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-15 13:15:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-15 13:15:14,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:14,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:14,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:15:14,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:15:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-15 13:15:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-15 13:15:14,582 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 9 [2022-04-15 13:15:14,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:15:14,583 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-15 13:15:14,583 INFO L479 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-15 13:15:14,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-15 13:15:14,611 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-15 13:15:14,612 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 13:15:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:15:14,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:15:14,614 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:15:14,614 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:15:14,614 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:15:14,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:15:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1138963186, now seen corresponding path program 1 times [2022-04-15 13:15:14,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:14,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [469712021] [2022-04-15 13:15:14,744 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:15:14,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1831600555, now seen corresponding path program 1 times [2022-04-15 13:15:14,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:15:14,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90737102] [2022-04-15 13:15:14,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:15:14,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:15:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:15:14,776 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:15:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:15:14,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:15:14,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1138963186, now seen corresponding path program 2 times [2022-04-15 13:15:14,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:15:14,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684128148] [2022-04-15 13:15:14,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:15:14,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:15:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:14,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:15:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:14,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {272#(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); {266#true} is VALID [2022-04-15 13:15:14,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume true; {266#true} is VALID [2022-04-15 13:15:14,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {266#true} {266#true} #92#return; {266#true} is VALID [2022-04-15 13:15:14,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:15:14,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {272#(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); {266#true} is VALID [2022-04-15 13:15:14,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2022-04-15 13:15:14,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #92#return; {266#true} is VALID [2022-04-15 13:15:14,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret10 := main(); {266#true} is VALID [2022-04-15 13:15:14,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {266#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {266#true} is VALID [2022-04-15 13:15:14,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#true} assume !!(~a~0 < 6);~b~0 := 0; {271#(= main_~b~0 0)} is VALID [2022-04-15 13:15:14,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {271#(= main_~b~0 0)} assume !(~b~0 < 6); {267#false} is VALID [2022-04-15 13:15:14,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {267#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {267#false} is VALID [2022-04-15 13:15:14,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#false} assume !(~a~0 < 6); {267#false} is VALID [2022-04-15 13:15:14,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {267#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {267#false} is VALID [2022-04-15 13:15:14,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-04-15 13:15:14,917 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-15 13:15:14,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:15:14,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684128148] [2022-04-15 13:15:14,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684128148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:14,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:14,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:15:14,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:15:14,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [469712021] [2022-04-15 13:15:14,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [469712021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:14,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:14,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:15:14,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660025688] [2022-04-15 13:15:14,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:15:14,927 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-15 13:15:14,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:15:14,928 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-15 13:15:14,938 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-15 13:15:14,938 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:15:14,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:14,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:15:14,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:15:14,941 INFO L87 Difference]: Start difference. First operand 22 states and 27 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-15 13:15:15,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:15,049 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-15 13:15:15,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:15:15,049 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-15 13:15:15,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:15:15,050 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-15 13:15:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-15 13:15:15,053 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-15 13:15:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-15 13:15:15,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-04-15 13:15:15,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:15:15,113 INFO L225 Difference]: With dead ends: 47 [2022-04-15 13:15:15,113 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 13:15:15,114 INFO L912 BasicCegarLoop]: 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-15 13:15:15,115 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 47 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:15:15,115 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 31 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:15:15,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 13:15:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2022-04-15 13:15:15,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:15:15,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-15 13:15:15,122 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-15 13:15:15,123 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-15 13:15:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:15,125 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 13:15:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 13:15:15,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:15,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:15,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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 32 states. [2022-04-15 13:15:15,126 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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 32 states. [2022-04-15 13:15:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:15,128 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 13:15:15,128 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 13:15:15,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:15,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:15,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:15:15,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:15:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-15 13:15:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-15 13:15:15,131 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 12 [2022-04-15 13:15:15,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:15:15,131 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-15 13:15:15,131 INFO L479 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-15 13:15:15,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-15 13:15:15,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:15:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 13:15:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:15:15,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:15:15,163 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:15:15,163 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2022-04-15 13:15:15,163 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:15:15,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:15:15,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1811082743, now seen corresponding path program 1 times [2022-04-15 13:15:15,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:15,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1784142706] [2022-04-15 13:15:15,475 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:15:15,476 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:15:15,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1811082743, now seen corresponding path program 2 times [2022-04-15 13:15:15,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:15:15,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092748965] [2022-04-15 13:15:15,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:15:15,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:15:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:15,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:15:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:15,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {487#(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); {481#true} is VALID [2022-04-15 13:15:15,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-15 13:15:15,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {481#true} {481#true} #92#return; {481#true} is VALID [2022-04-15 13:15:15,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:15:15,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {487#(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); {481#true} is VALID [2022-04-15 13:15:15,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-15 13:15:15,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #92#return; {481#true} is VALID [2022-04-15 13:15:15,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret10 := main(); {481#true} is VALID [2022-04-15 13:15:15,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {481#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {481#true} is VALID [2022-04-15 13:15:15,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {481#true} assume !!(~a~0 < 6);~b~0 := 0; {481#true} is VALID [2022-04-15 13:15:15,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {481#true} assume !!(~b~0 < 6);~c~0 := 0; {486#(= main_~c~0 0)} is VALID [2022-04-15 13:15:15,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {486#(= main_~c~0 0)} assume !(~c~0 < 6); {482#false} is VALID [2022-04-15 13:15:15,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {482#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {482#false} is VALID [2022-04-15 13:15:15,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {482#false} assume !(~b~0 < 6); {482#false} is VALID [2022-04-15 13:15:15,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {482#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {482#false} is VALID [2022-04-15 13:15:15,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {482#false} assume !(~a~0 < 6); {482#false} is VALID [2022-04-15 13:15:15,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {482#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {482#false} is VALID [2022-04-15 13:15:15,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-15 13:15:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:15:15,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:15:15,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092748965] [2022-04-15 13:15:15,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092748965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:15,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:15,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:15:15,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:15:15,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1784142706] [2022-04-15 13:15:15,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1784142706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:15,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:15,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:15:15,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230461982] [2022-04-15 13:15:15,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:15:15,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:15:15,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:15:15,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:15,580 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-15 13:15:15,580 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:15:15,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:15,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:15:15,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:15:15,581 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:15,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:15,676 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-15 13:15:15,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:15:15,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:15:15,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:15:15,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-15 13:15:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-15 13:15:15,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2022-04-15 13:15:15,731 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-15 13:15:15,732 INFO L225 Difference]: With dead ends: 47 [2022-04-15 13:15:15,732 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 13:15:15,732 INFO L912 BasicCegarLoop]: 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-15 13:15:15,733 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:15:15,734 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 31 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:15:15,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 13:15:15,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-04-15 13:15:15,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:15:15,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-15 13:15:15,740 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-15 13:15:15,740 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-15 13:15:15,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:15,742 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-04-15 13:15:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-04-15 13:15:15,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:15,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:15,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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 31 states. [2022-04-15 13:15:15,743 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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 31 states. [2022-04-15 13:15:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:15,744 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-04-15 13:15:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-04-15 13:15:15,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:15,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:15,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:15:15,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:15:15,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-15 13:15:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-04-15 13:15:15,746 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2022-04-15 13:15:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:15:15,747 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-04-15 13:15:15,747 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:15,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 29 transitions. [2022-04-15 13:15:15,775 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-15 13:15:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-15 13:15:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 13:15:15,776 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:15:15,776 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:15:15,776 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 13:15:15,777 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:15:15,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:15:15,777 INFO L85 PathProgramCache]: Analyzing trace with hash 602992382, now seen corresponding path program 1 times [2022-04-15 13:15:15,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:15,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1975208822]