/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-simple/nested_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:08:33,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:08:33,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:08:33,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:08:33,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:08:33,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:08:33,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:08:33,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:08:33,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:08:33,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:08:33,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:08:33,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:08:33,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:08:33,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:08:33,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:08:33,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:08:33,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:08:33,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:08:33,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:08:33,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:08:33,870 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:08:33,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:08:33,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:08:33,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:08:33,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:08:33,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:08:33,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:08:33,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:08:33,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:08:33,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:08:33,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:08:33,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:08:33,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:08:33,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:08:33,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:08:33,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:08:33,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:08:33,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:08:33,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:08:33,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:08:33,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:08:33,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:08:33,886 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:08:33,896 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:08:33,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:08:33,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:08:33,898 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:08:33,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:08:33,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:08:33,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:08:33,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:08:33,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:08:33,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:08:33,899 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:08:33,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:08:33,899 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:08:33,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:08:33,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:08:33,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:08:33,900 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:08:33,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:08:33,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:08:33,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:08:33,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:08:33,900 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:08:33,900 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:08:33,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:08:33,900 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:08:33,900 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 04:08:34,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:08:34,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:08:34,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:08:34,111 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:08:34,112 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:08:34,113 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_5.c [2022-04-28 04:08:34,180 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567cc223c/f761a003d5b947878cd40813d2970451/FLAGb71ae80c9 [2022-04-28 04:08:34,517 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:08:34,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_5.c [2022-04-28 04:08:34,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567cc223c/f761a003d5b947878cd40813d2970451/FLAGb71ae80c9 [2022-04-28 04:08:34,961 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567cc223c/f761a003d5b947878cd40813d2970451 [2022-04-28 04:08:34,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:08:34,963 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:08:34,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:08:34,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:08:34,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:08:34,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:08:34" (1/1) ... [2022-04-28 04:08:34,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b15d127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:34, skipping insertion in model container [2022-04-28 04:08:34,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:08:34" (1/1) ... [2022-04-28 04:08:34,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:08:34,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:08:35,123 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_5.c[899,912] [2022-04-28 04:08:35,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:08:35,133 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:08:35,143 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_5.c[899,912] [2022-04-28 04:08:35,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:08:35,155 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:08:35,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:35 WrapperNode [2022-04-28 04:08:35,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:08:35,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:08:35,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:08:35,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:08:35,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:35" (1/1) ... [2022-04-28 04:08:35,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:35" (1/1) ... [2022-04-28 04:08:35,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:35" (1/1) ... [2022-04-28 04:08:35,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:35" (1/1) ... [2022-04-28 04:08:35,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:35" (1/1) ... [2022-04-28 04:08:35,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:35" (1/1) ... [2022-04-28 04:08:35,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:35" (1/1) ... [2022-04-28 04:08:35,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:08:35,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:08:35,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:08:35,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:08:35,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:35" (1/1) ... [2022-04-28 04:08:35,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:08:35,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:08:35,226 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 04:08:35,250 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 04:08:35,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:08:35,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:08:35,270 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:08:35,270 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:08:35,270 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:08:35,270 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:08:35,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:08:35,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:08:35,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:08:35,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:08:35,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:08:35,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:08:35,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:08:35,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:08:35,319 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:08:35,320 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:08:35,416 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:08:35,421 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:08:35,422 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-28 04:08:35,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:08:35 BoogieIcfgContainer [2022-04-28 04:08:35,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:08:35,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:08:35,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:08:35,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:08:35,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:08:34" (1/3) ... [2022-04-28 04:08:35,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d49ca0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:08:35, skipping insertion in model container [2022-04-28 04:08:35,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:08:35" (2/3) ... [2022-04-28 04:08:35,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d49ca0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:08:35, skipping insertion in model container [2022-04-28 04:08:35,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:08:35" (3/3) ... [2022-04-28 04:08:35,429 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_5.c [2022-04-28 04:08:35,439 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:08:35,439 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:08:35,475 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:08:35,479 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@4a316e9d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@289624d6 [2022-04-28 04:08:35,480 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:08:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 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 04:08:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 04:08:35,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:35,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:35,491 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:35,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:35,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1327885715, now seen corresponding path program 1 times [2022-04-28 04:08:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:35,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1799284333] [2022-04-28 04:08:35,508 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:08:35,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1327885715, now seen corresponding path program 2 times [2022-04-28 04:08:35,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:35,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970079162] [2022-04-28 04:08:35,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:35,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:35,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:35,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(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); {27#true} is VALID [2022-04-28 04:08:35,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 04:08:35,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #80#return; {27#true} is VALID [2022-04-28 04:08:35,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:35,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(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); {27#true} is VALID [2022-04-28 04:08:35,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 04:08:35,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #80#return; {27#true} is VALID [2022-04-28 04:08:35,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret9 := main(); {27#true} is VALID [2022-04-28 04:08:35,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {27#true} is VALID [2022-04-28 04:08:35,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-28 04:08:35,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {28#false} is VALID [2022-04-28 04:08:35,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 04:08:35,632 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 04:08:35,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:35,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970079162] [2022-04-28 04:08:35,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970079162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:35,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:35,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:08:35,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:35,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1799284333] [2022-04-28 04:08:35,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1799284333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:35,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:35,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:08:35,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429621118] [2022-04-28 04:08:35,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:35,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 04:08:35,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:35,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:35,655 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 04:08:35,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:08:35,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:35,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:08:35,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:08:35,672 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:35,742 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2022-04-28 04:08:35,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:08:35,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 04:08:35,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-04-28 04:08:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:35,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-04-28 04:08:35,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-04-28 04:08:35,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:35,850 INFO L225 Difference]: With dead ends: 42 [2022-04-28 04:08:35,851 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 04:08:35,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:08:35,859 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:35,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:08:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 04:08:35,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 04:08:35,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:35,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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 04:08:35,895 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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 04:08:35,896 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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 04:08:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:35,900 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-04-28 04:08:35,900 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-28 04:08:35,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:35,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:35,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 04:08:35,902 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 04:08:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:35,904 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-04-28 04:08:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-28 04:08:35,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:35,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:35,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:35,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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 04:08:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-04-28 04:08:35,908 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2022-04-28 04:08:35,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:35,909 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-04-28 04:08:35,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:35,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 23 transitions. [2022-04-28 04:08:35,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:35,938 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-28 04:08:35,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 04:08:35,938 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:35,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:35,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:08:35,940 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:35,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:35,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1327937609, now seen corresponding path program 1 times [2022-04-28 04:08:35,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:35,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [288261356] [2022-04-28 04:08:35,953 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:08:35,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1327937609, now seen corresponding path program 2 times [2022-04-28 04:08:35,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:35,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238982608] [2022-04-28 04:08:35,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:35,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:36,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:36,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {201#(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); {195#true} is VALID [2022-04-28 04:08:36,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#true} assume true; {195#true} is VALID [2022-04-28 04:08:36,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {195#true} {195#true} #80#return; {195#true} is VALID [2022-04-28 04:08:36,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {195#true} call ULTIMATE.init(); {201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:36,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#(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); {195#true} is VALID [2022-04-28 04:08:36,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#true} assume true; {195#true} is VALID [2022-04-28 04:08:36,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195#true} {195#true} #80#return; {195#true} is VALID [2022-04-28 04:08:36,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {195#true} call #t~ret9 := main(); {195#true} is VALID [2022-04-28 04:08:36,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {195#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {200#(= main_~a~0 0)} is VALID [2022-04-28 04:08:36,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {200#(= main_~a~0 0)} assume !(~a~0 < 6); {196#false} is VALID [2022-04-28 04:08:36,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {196#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {196#false} is VALID [2022-04-28 04:08:36,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {196#false} assume !false; {196#false} is VALID [2022-04-28 04:08:36,034 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 04:08:36,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:36,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238982608] [2022-04-28 04:08:36,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238982608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:36,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:36,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:36,035 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:36,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [288261356] [2022-04-28 04:08:36,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [288261356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:36,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:36,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:36,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345698369] [2022-04-28 04:08:36,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:36,036 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 04:08:36,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:36,036 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 04:08:36,045 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 04:08:36,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 04:08:36,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:36,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 04:08:36,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 04:08:36,047 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:36,126 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 04:08:36,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 04:08:36,127 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 04:08:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:36,127 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 04:08:36,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-28 04:08:36,130 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 04:08:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-28 04:08:36,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2022-04-28 04:08:36,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:36,165 INFO L225 Difference]: With dead ends: 32 [2022-04-28 04:08:36,166 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 04:08:36,166 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 04:08:36,169 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:36,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 28 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:08:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 04:08:36,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-04-28 04:08:36,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:36,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 04:08:36,180 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 04:08:36,180 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 04:08:36,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:36,182 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-28 04:08:36,182 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-28 04:08:36,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:36,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:36,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 29 states. [2022-04-28 04:08:36,183 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 29 states. [2022-04-28 04:08:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:36,185 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-28 04:08:36,185 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-28 04:08:36,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:36,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:36,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:36,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 04:08:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-28 04:08:36,189 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 9 [2022-04-28 04:08:36,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:36,189 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-28 04:08:36,190 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 04:08:36,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2022-04-28 04:08:36,212 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 04:08:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-28 04:08:36,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:08:36,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:36,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:36,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:08:36,216 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:36,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:36,217 INFO L85 PathProgramCache]: Analyzing trace with hash 365342218, now seen corresponding path program 1 times [2022-04-28 04:08:36,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:36,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1857329989] [2022-04-28 04:08:36,325 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:36,325 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:36,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1785733815, now seen corresponding path program 1 times [2022-04-28 04:08:36,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:36,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699123542] [2022-04-28 04:08:36,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:36,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:36,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:36,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {374#(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); {368#true} is VALID [2022-04-28 04:08:36,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-28 04:08:36,437 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {368#true} {368#true} #80#return; {368#true} is VALID [2022-04-28 04:08:36,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {368#true} call ULTIMATE.init(); {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:36,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {374#(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); {368#true} is VALID [2022-04-28 04:08:36,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-28 04:08:36,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {368#true} {368#true} #80#return; {368#true} is VALID [2022-04-28 04:08:36,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {368#true} call #t~ret9 := main(); {368#true} is VALID [2022-04-28 04:08:36,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {373#(= main_~a~0 0)} is VALID [2022-04-28 04:08:36,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {373#(= main_~a~0 0)} [84] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_4| |v_main_#t~pre4_3|))) (or (and (= v_main_~b~0_10 v_main_~b~0_9) .cse0 (= v_main_~a~0_10 v_main_~a~0_9)) (and (= v_main_~b~0_9 v_main_~b~0_10) .cse0 (= v_main_~a~0_9 v_main_~a~0_10)))) InVars {main_~b~0=v_main_~b~0_10, main_#t~pre4=|v_main_#t~pre4_4|, main_~a~0=v_main_~a~0_10} OutVars{main_~b~0=v_main_~b~0_9, main_#t~pre4=|v_main_#t~pre4_3|, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_#t~pre4, main_~a~0] {373#(= main_~a~0 0)} is VALID [2022-04-28 04:08:36,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {373#(= main_~a~0 0)} [83] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {369#false} is VALID [2022-04-28 04:08:36,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {369#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {369#false} is VALID [2022-04-28 04:08:36,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {369#false} assume !false; {369#false} is VALID [2022-04-28 04:08:36,440 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 04:08:36,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:36,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699123542] [2022-04-28 04:08:36,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699123542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:36,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:36,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:36,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:36,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1857329989] [2022-04-28 04:08:36,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1857329989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:36,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:36,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:08:36,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507149561] [2022-04-28 04:08:36,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:36,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 04:08:36,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:36,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 04:08:36,475 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 04:08:36,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:08:36,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:36,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:08:36,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:08:36,476 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 04:08:36,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:36,638 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-28 04:08:36,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:08:36,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 04:08:36,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 04:08:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-28 04:08:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 04:08:36,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-28 04:08:36,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-28 04:08:36,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:36,695 INFO L225 Difference]: With dead ends: 50 [2022-04-28 04:08:36,695 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 04:08:36,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:08:36,698 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 74 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:36,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 26 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:08:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 04:08:36,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 21. [2022-04-28 04:08:36,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:36,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 04:08:36,710 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 04:08:36,710 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 04:08:36,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:36,715 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-04-28 04:08:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-28 04:08:36,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:36,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:36,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 37 states. [2022-04-28 04:08:36,716 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 37 states. [2022-04-28 04:08:36,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:36,719 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-04-28 04:08:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-28 04:08:36,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:36,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:36,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:36,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 04:08:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-04-28 04:08:36,721 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2022-04-28 04:08:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:36,721 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-04-28 04:08:36,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 04:08:36,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 25 transitions. [2022-04-28 04:08:36,742 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 04:08:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-28 04:08:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 04:08:36,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:36,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:36,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 04:08:36,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:36,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:36,744 INFO L85 PathProgramCache]: Analyzing trace with hash -903990269, now seen corresponding path program 1 times [2022-04-28 04:08:36,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:36,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [220632657] [2022-04-28 04:08:36,779 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:36,855 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:36,855 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:36,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1785795319, now seen corresponding path program 1 times [2022-04-28 04:08:36,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:36,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171515150] [2022-04-28 04:08:36,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:36,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:36,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:36,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {604#(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); {598#true} is VALID [2022-04-28 04:08:36,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {598#true} assume true; {598#true} is VALID [2022-04-28 04:08:36,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {598#true} {598#true} #80#return; {598#true} is VALID [2022-04-28 04:08:36,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {598#true} call ULTIMATE.init(); {604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:36,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {604#(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); {598#true} is VALID [2022-04-28 04:08:36,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {598#true} assume true; {598#true} is VALID [2022-04-28 04:08:36,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {598#true} {598#true} #80#return; {598#true} is VALID [2022-04-28 04:08:36,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {598#true} call #t~ret9 := main(); {598#true} is VALID [2022-04-28 04:08:36,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {598#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {603#(= main_~a~0 0)} is VALID [2022-04-28 04:08:36,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {603#(= main_~a~0 0)} [86] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_10| |v_main_#t~pre5_9|)) (.cse1 (= |v_main_#t~pre4_9| |v_main_#t~pre4_8|)) (.cse2 (= v_main_~a~0_16 v_main_~a~0_15)) (.cse3 (= v_main_~b~0_23 v_main_~b~0_21))) (or (and .cse0 (= v_main_~c~0_16 v_main_~c~0_15) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= v_main_~c~0_15 v_main_~c~0_16) .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_16, main_~b~0=v_main_~b~0_23, main_#t~pre4=|v_main_#t~pre4_9|, main_#t~pre5=|v_main_#t~pre5_10|, main_~a~0=v_main_~a~0_16} OutVars{main_~c~0=v_main_~c~0_15, main_~b~0=v_main_~b~0_21, main_#t~pre4=|v_main_#t~pre4_8|, main_#t~pre5=|v_main_#t~pre5_9|, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0] {603#(= main_~a~0 0)} is VALID [2022-04-28 04:08:36,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {603#(= main_~a~0 0)} [85] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {599#false} is VALID [2022-04-28 04:08:36,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {599#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {599#false} is VALID [2022-04-28 04:08:36,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {599#false} assume !false; {599#false} is VALID [2022-04-28 04:08:36,899 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 04:08:36,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:36,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171515150] [2022-04-28 04:08:36,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171515150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:36,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:36,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:36,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:36,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [220632657] [2022-04-28 04:08:36,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [220632657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:36,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:36,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:08:36,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134118497] [2022-04-28 04:08:36,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:36,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 04:08:36,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:36,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:36,950 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 04:08:36,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:08:36,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:36,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:08:36,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:08:36,952 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:37,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:37,094 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 04:08:37,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:08:37,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 04:08:37,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:37,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:37,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-28 04:08:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-28 04:08:37,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-04-28 04:08:37,145 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 04:08:37,147 INFO L225 Difference]: With dead ends: 56 [2022-04-28 04:08:37,147 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 04:08:37,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:08:37,148 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 95 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:37,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 24 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:08:37,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 04:08:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 22. [2022-04-28 04:08:37,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:37,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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 04:08:37,154 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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 04:08:37,154 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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 04:08:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:37,158 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-04-28 04:08:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-04-28 04:08:37,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:37,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:37,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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 43 states. [2022-04-28 04:08:37,158 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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 43 states. [2022-04-28 04:08:37,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:37,160 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-04-28 04:08:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-04-28 04:08:37,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:37,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:37,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:37,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:37,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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 04:08:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-28 04:08:37,167 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2022-04-28 04:08:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:37,167 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-28 04:08:37,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:37,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 26 transitions. [2022-04-28 04:08:37,189 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 04:08:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-28 04:08:37,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 04:08:37,189 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:37,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:37,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 04:08:37,190 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:37,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:37,190 INFO L85 PathProgramCache]: Analyzing trace with hash 761147182, now seen corresponding path program 1 times [2022-04-28 04:08:37,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:37,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1698879827] [2022-04-28 04:08:37,222 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:37,259 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:37,338 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:37,339 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1785856823, now seen corresponding path program 1 times [2022-04-28 04:08:37,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:37,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182574943] [2022-04-28 04:08:37,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:37,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:37,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:37,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {863#(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); {857#true} is VALID [2022-04-28 04:08:37,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {857#true} assume true; {857#true} is VALID [2022-04-28 04:08:37,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {857#true} {857#true} #80#return; {857#true} is VALID [2022-04-28 04:08:37,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {857#true} call ULTIMATE.init(); {863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:37,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {863#(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); {857#true} is VALID [2022-04-28 04:08:37,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {857#true} assume true; {857#true} is VALID [2022-04-28 04:08:37,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {857#true} {857#true} #80#return; {857#true} is VALID [2022-04-28 04:08:37,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {857#true} call #t~ret9 := main(); {857#true} is VALID [2022-04-28 04:08:37,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {857#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {862#(= main_~a~0 0)} is VALID [2022-04-28 04:08:37,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {862#(= main_~a~0 0)} [88] L23-3-->L23-4_primed: Formula: (and (= |v_main_#t~pre6_16| |v_main_#t~pre6_15|) (= |v_main_#t~pre5_16| |v_main_#t~pre5_15|) (= v_main_~a~0_22 v_main_~a~0_21) (= |v_main_#t~pre4_14| |v_main_#t~pre4_13|) (= v_main_~d~0_22 v_main_~d~0_21) (= v_main_~c~0_36 v_main_~c~0_34) (= v_main_~b~0_31 v_main_~b~0_29)) InVars {main_~c~0=v_main_~c~0_36, main_~d~0=v_main_~d~0_22, main_~b~0=v_main_~b~0_31, main_#t~pre4=|v_main_#t~pre4_14|, main_#t~pre5=|v_main_#t~pre5_16|, main_~a~0=v_main_~a~0_22, main_#t~pre6=|v_main_#t~pre6_16|} OutVars{main_~c~0=v_main_~c~0_34, main_~d~0=v_main_~d~0_21, main_~b~0=v_main_~b~0_29, main_#t~pre4=|v_main_#t~pre4_13|, main_#t~pre5=|v_main_#t~pre5_15|, main_~a~0=v_main_~a~0_21, main_#t~pre6=|v_main_#t~pre6_15|} AuxVars[] AssignedVars[main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {862#(= main_~a~0 0)} is VALID [2022-04-28 04:08:37,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {862#(= main_~a~0 0)} [87] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {858#false} is VALID [2022-04-28 04:08:37,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {858#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {858#false} is VALID [2022-04-28 04:08:37,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {858#false} assume !false; {858#false} is VALID [2022-04-28 04:08:37,405 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 04:08:37,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:37,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182574943] [2022-04-28 04:08:37,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182574943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:37,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:37,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:37,444 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:37,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1698879827] [2022-04-28 04:08:37,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1698879827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:37,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:37,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:08:37,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168169336] [2022-04-28 04:08:37,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:37,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 18 [2022-04-28 04:08:37,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:37,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 04:08:37,454 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 04:08:37,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:08:37,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:37,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:08:37,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:08:37,455 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 04:08:37,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:37,613 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2022-04-28 04:08:37,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:08:37,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 18 [2022-04-28 04:08:37,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 04:08:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-28 04:08:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 04:08:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-28 04:08:37,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-28 04:08:37,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:37,668 INFO L225 Difference]: With dead ends: 60 [2022-04-28 04:08:37,668 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 04:08:37,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:08:37,670 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 100 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:37,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 27 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:08:37,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 04:08:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 23. [2022-04-28 04:08:37,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:37,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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-28 04:08:37,674 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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-28 04:08:37,675 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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-28 04:08:37,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:37,676 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-28 04:08:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-04-28 04:08:37,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:37,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:37,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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 47 states. [2022-04-28 04:08:37,677 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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 47 states. [2022-04-28 04:08:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:37,678 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-28 04:08:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-04-28 04:08:37,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:37,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:37,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:37,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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-28 04:08:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-28 04:08:37,679 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2022-04-28 04:08:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:37,680 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-28 04:08:37,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 04:08:37,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-28 04:08:37,704 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 04:08:37,705 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 04:08:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 04:08:37,718 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:37,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:37,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 04:08:37,718 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:37,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:37,719 INFO L85 PathProgramCache]: Analyzing trace with hash 317096575, now seen corresponding path program 1 times [2022-04-28 04:08:37,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:37,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1203177430] [2022-04-28 04:08:37,774 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:37,796 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:37,828 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:37,854 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:37,882 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:37,968 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:37,969 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:37,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1785918327, now seen corresponding path program 1 times [2022-04-28 04:08:37,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:37,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358309947] [2022-04-28 04:08:37,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:37,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:37,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:37,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {1143#(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); {1137#true} is VALID [2022-04-28 04:08:37,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-28 04:08:37,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1137#true} {1137#true} #80#return; {1137#true} is VALID [2022-04-28 04:08:37,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:37,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {1143#(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); {1137#true} is VALID [2022-04-28 04:08:37,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-28 04:08:38,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1137#true} {1137#true} #80#return; {1137#true} is VALID [2022-04-28 04:08:38,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {1137#true} call #t~ret9 := main(); {1137#true} is VALID [2022-04-28 04:08:38,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {1137#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {1142#(= main_~a~0 0)} is VALID [2022-04-28 04:08:38,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {1142#(= main_~a~0 0)} [90] L23-3-->L23-4_primed: Formula: (and (= |v_main_#t~pre4_19| |v_main_#t~pre4_18|) (= |v_main_#t~pre7_32| |v_main_#t~pre7_31|) (= |v_main_#t~pre5_22| |v_main_#t~pre5_21|) (= |v_main_#t~pre6_33| |v_main_#t~pre6_32|) (= v_main_~a~0_28 v_main_~a~0_27) (= v_main_~d~0_59 v_main_~d~0_57) (= v_main_~b~0_39 v_main_~b~0_37) (= v_main_~c~0_56 v_main_~c~0_54) (= v_main_~e~0_38 v_main_~e~0_37)) InVars {main_~e~0=v_main_~e~0_38, main_#t~pre7=|v_main_#t~pre7_32|, main_~c~0=v_main_~c~0_56, main_~d~0=v_main_~d~0_59, main_~b~0=v_main_~b~0_39, main_#t~pre4=|v_main_#t~pre4_19|, main_#t~pre5=|v_main_#t~pre5_22|, main_~a~0=v_main_~a~0_28, main_#t~pre6=|v_main_#t~pre6_33|} OutVars{main_~e~0=v_main_~e~0_37, main_#t~pre7=|v_main_#t~pre7_31|, main_~c~0=v_main_~c~0_54, main_~d~0=v_main_~d~0_57, main_~b~0=v_main_~b~0_37, main_#t~pre4=|v_main_#t~pre4_18|, main_#t~pre5=|v_main_#t~pre5_21|, main_~a~0=v_main_~a~0_27, main_#t~pre6=|v_main_#t~pre6_32|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1142#(= main_~a~0 0)} is VALID [2022-04-28 04:08:38,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {1142#(= main_~a~0 0)} [89] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {1138#false} is VALID [2022-04-28 04:08:38,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {1138#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {1138#false} is VALID [2022-04-28 04:08:38,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-28 04:08:38,001 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 04:08:38,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:38,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358309947] [2022-04-28 04:08:38,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358309947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:38,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:38,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:38,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:38,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1203177430] [2022-04-28 04:08:38,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1203177430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:38,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:38,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:08:38,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991296913] [2022-04-28 04:08:38,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:38,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 21 [2022-04-28 04:08:38,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:38,051 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), 7 states have internal predecessors, (18), 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 04:08:38,066 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 04:08:38,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:08:38,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:38,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:08:38,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:08:38,067 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 04:08:38,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:38,275 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2022-04-28 04:08:38,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:08:38,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 21 [2022-04-28 04:08:38,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 04:08:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-28 04:08:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 04:08:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-28 04:08:38,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-28 04:08:38,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:38,333 INFO L225 Difference]: With dead ends: 62 [2022-04-28 04:08:38,333 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 04:08:38,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:08:38,334 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 123 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:38,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 20 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:08:38,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 04:08:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 24. [2022-04-28 04:08:38,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:38,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 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-28 04:08:38,338 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 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-28 04:08:38,338 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 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-28 04:08:38,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:38,339 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2022-04-28 04:08:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-04-28 04:08:38,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:38,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:38,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 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 49 states. [2022-04-28 04:08:38,340 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 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 49 states. [2022-04-28 04:08:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:38,341 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2022-04-28 04:08:38,341 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-04-28 04:08:38,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:38,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:38,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:38,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 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-28 04:08:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-28 04:08:38,342 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 21 [2022-04-28 04:08:38,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:38,342 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-28 04:08:38,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 04:08:38,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 28 transitions. [2022-04-28 04:08:38,369 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-28 04:08:38,369 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-28 04:08:38,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 04:08:38,370 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:38,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:38,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 04:08:38,370 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:38,371 INFO L85 PathProgramCache]: Analyzing trace with hash 720998685, now seen corresponding path program 1 times [2022-04-28 04:08:38,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:38,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1643253512] [2022-04-28 04:08:42,478 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:42,568 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:44,391 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:44,455 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:44,498 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:46,684 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:46,761 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:46,804 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:50,890 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:50,946 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:50,986 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:51,033 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:51,157 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:51,158 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:51,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1785979831, now seen corresponding path program 1 times [2022-04-28 04:08:51,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:51,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712957911] [2022-04-28 04:08:51,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:51,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:51,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:51,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {1436#(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); {1430#true} is VALID [2022-04-28 04:08:51,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-04-28 04:08:51,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1430#true} {1430#true} #80#return; {1430#true} is VALID [2022-04-28 04:08:51,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {1430#true} call ULTIMATE.init(); {1436#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:51,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {1436#(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); {1430#true} is VALID [2022-04-28 04:08:51,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-04-28 04:08:51,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1430#true} {1430#true} #80#return; {1430#true} is VALID [2022-04-28 04:08:51,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {1430#true} call #t~ret9 := main(); {1430#true} is VALID [2022-04-28 04:08:51,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {1430#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {1435#(= main_~a~0 0)} is VALID [2022-04-28 04:08:51,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {1435#(= main_~a~0 0)} [92] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_47 v_main_~b~0_45)) (.cse1 (= |v_main_#t~pre4_24| |v_main_#t~pre4_23|)) (.cse2 (= |v_main_#t~pre8_53| |v_main_#t~pre8_52|)) (.cse3 (= |v_main_#t~pre5_28| |v_main_#t~pre5_27|)) (.cse4 (= v_main_~c~0_76 v_main_~c~0_74)) (.cse5 (= v_main_~e~0_97 v_main_~e~0_95)) (.cse6 (= v_main_~d~0_96 v_main_~d~0_94)) (.cse7 (= |v_main_#t~pre7_65| |v_main_#t~pre7_64|)) (.cse8 (= v_main_~a~0_34 v_main_~a~0_33))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_49| |v_main_#t~pre6_50|) .cse5 .cse6 .cse7 .cse8) (and .cse0 (= |v_main_#t~pre6_50| |v_main_#t~pre6_49|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) InVars {main_~e~0=v_main_~e~0_97, main_#t~pre7=|v_main_#t~pre7_65|, main_~c~0=v_main_~c~0_76, main_#t~pre8=|v_main_#t~pre8_53|, main_~d~0=v_main_~d~0_96, main_~b~0=v_main_~b~0_47, main_#t~pre4=|v_main_#t~pre4_24|, main_#t~pre5=|v_main_#t~pre5_28|, main_~a~0=v_main_~a~0_34, main_#t~pre6=|v_main_#t~pre6_50|} OutVars{main_~e~0=v_main_~e~0_95, main_#t~pre7=|v_main_#t~pre7_64|, main_~c~0=v_main_~c~0_74, main_#t~pre8=|v_main_#t~pre8_52|, main_~d~0=v_main_~d~0_94, main_~b~0=v_main_~b~0_45, main_#t~pre4=|v_main_#t~pre4_23|, main_#t~pre5=|v_main_#t~pre5_27|, main_~a~0=v_main_~a~0_33, main_#t~pre6=|v_main_#t~pre6_49|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1435#(= main_~a~0 0)} is VALID [2022-04-28 04:08:51,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {1435#(= main_~a~0 0)} [91] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-28 04:08:51,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {1431#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {1431#false} is VALID [2022-04-28 04:08:51,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {1431#false} assume !false; {1431#false} is VALID [2022-04-28 04:08:51,192 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 04:08:51,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:51,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712957911] [2022-04-28 04:08:51,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712957911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:51,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:51,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:51,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:51,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1643253512] [2022-04-28 04:08:51,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1643253512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:51,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:51,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:08:51,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462592495] [2022-04-28 04:08:51,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:51,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 04:08:51,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:51,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 04:08:51,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:51,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 04:08:51,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:51,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 04:08:51,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:08:51,291 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 04:08:51,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:51,526 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-04-28 04:08:51,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:08:51,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 04:08:51,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 04:08:51,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2022-04-28 04:08:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 04:08:51,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2022-04-28 04:08:51,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 83 transitions. [2022-04-28 04:08:51,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:51,589 INFO L225 Difference]: With dead ends: 64 [2022-04-28 04:08:51,589 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 04:08:51,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2022-04-28 04:08:51,590 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 115 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:51,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 25 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:08:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 04:08:51,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 26. [2022-04-28 04:08:51,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:51,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 26 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 04:08:51,595 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 26 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 04:08:51,595 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 26 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 04:08:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:51,596 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-28 04:08:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-28 04:08:51,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:51,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:51,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 51 states. [2022-04-28 04:08:51,597 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 51 states. [2022-04-28 04:08:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:51,598 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-28 04:08:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-28 04:08:51,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:51,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:51,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:51,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 04:08:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-28 04:08:51,599 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 23 [2022-04-28 04:08:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:51,599 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-28 04:08:51,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 04:08:51,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2022-04-28 04:08:51,626 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 04:08:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 04:08:51,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 04:08:51,626 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:51,627 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:51,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 04:08:51,627 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:51,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:51,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1971097541, now seen corresponding path program 2 times [2022-04-28 04:08:51,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:51,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [333715347] [2022-04-28 04:08:51,772 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:51,911 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:52,053 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:52,182 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:52,284 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:52,284 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:52,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1786041335, now seen corresponding path program 1 times [2022-04-28 04:08:52,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:52,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035043705] [2022-04-28 04:08:52,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:52,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:52,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:52,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {1744#(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); {1738#true} is VALID [2022-04-28 04:08:52,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {1738#true} assume true; {1738#true} is VALID [2022-04-28 04:08:52,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1738#true} {1738#true} #80#return; {1738#true} is VALID [2022-04-28 04:08:52,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {1738#true} call ULTIMATE.init(); {1744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:52,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {1744#(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); {1738#true} is VALID [2022-04-28 04:08:52,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {1738#true} assume true; {1738#true} is VALID [2022-04-28 04:08:52,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1738#true} {1738#true} #80#return; {1738#true} is VALID [2022-04-28 04:08:52,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {1738#true} call #t~ret9 := main(); {1738#true} is VALID [2022-04-28 04:08:52,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {1738#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {1743#(= main_~a~0 0)} is VALID [2022-04-28 04:08:52,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {1743#(= main_~a~0 0)} [94] L23-3-->L23-4_primed: Formula: (and (= |v_main_#t~pre5_34| |v_main_#t~pre5_33|) (= |v_main_#t~pre6_57| |v_main_#t~pre6_56|) (= v_main_~a~0_40 v_main_~a~0_39) (= v_main_~b~0_55 v_main_~b~0_53) (= |v_main_#t~pre7_73| |v_main_#t~pre7_72|) (= |v_main_#t~pre4_29| |v_main_#t~pre4_28|) (= v_main_~e~0_138 v_main_~e~0_135) (= v_main_~d~0_108 v_main_~d~0_106) (= v_main_~c~0_86 v_main_~c~0_84) (= |v_main_#t~pre8_87| |v_main_#t~pre8_85|)) InVars {main_~e~0=v_main_~e~0_138, main_#t~pre7=|v_main_#t~pre7_73|, main_~c~0=v_main_~c~0_86, main_#t~pre8=|v_main_#t~pre8_87|, main_~d~0=v_main_~d~0_108, main_~b~0=v_main_~b~0_55, main_#t~pre4=|v_main_#t~pre4_29|, main_#t~pre5=|v_main_#t~pre5_34|, main_~a~0=v_main_~a~0_40, main_#t~pre6=|v_main_#t~pre6_57|} OutVars{main_~e~0=v_main_~e~0_135, main_#t~pre7=|v_main_#t~pre7_72|, main_~c~0=v_main_~c~0_84, main_#t~pre8=|v_main_#t~pre8_85|, main_~d~0=v_main_~d~0_106, main_~b~0=v_main_~b~0_53, main_#t~pre4=|v_main_#t~pre4_28|, main_#t~pre5=|v_main_#t~pre5_33|, main_~a~0=v_main_~a~0_39, main_#t~pre6=|v_main_#t~pre6_56|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1743#(= main_~a~0 0)} is VALID [2022-04-28 04:08:52,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {1743#(= main_~a~0 0)} [93] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {1739#false} is VALID [2022-04-28 04:08:52,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {1739#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {1739#false} is VALID [2022-04-28 04:08:52,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {1739#false} assume !false; {1739#false} is VALID [2022-04-28 04:08:52,318 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 04:08:52,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:52,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035043705] [2022-04-28 04:08:52,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035043705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:52,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:52,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:52,425 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:52,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [333715347] [2022-04-28 04:08:52,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [333715347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:52,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:52,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 04:08:52,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521574141] [2022-04-28 04:08:52,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:52,426 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 25 [2022-04-28 04:08:52,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:52,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 04:08:52,445 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 04:08:52,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 04:08:52,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:52,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 04:08:52,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:08:52,446 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 04:08:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:52,746 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-28 04:08:52,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 04:08:52,746 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 25 [2022-04-28 04:08:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 04:08:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-28 04:08:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 04:08:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-28 04:08:52,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 85 transitions. [2022-04-28 04:08:52,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:52,808 INFO L225 Difference]: With dead ends: 66 [2022-04-28 04:08:52,808 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 04:08:52,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2022-04-28 04:08:52,809 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 116 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:52,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 30 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:08:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 04:08:52,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 28. [2022-04-28 04:08:52,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:52,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 04:08:52,814 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 04:08:52,814 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 04:08:52,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:52,816 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-04-28 04:08:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-28 04:08:52,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:52,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:52,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 53 states. [2022-04-28 04:08:52,816 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 53 states. [2022-04-28 04:08:52,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:52,817 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-04-28 04:08:52,817 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-28 04:08:52,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:52,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:52,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:52,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:52,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 04:08:52,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-28 04:08:52,818 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2022-04-28 04:08:52,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:52,818 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-28 04:08:52,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 04:08:52,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-28 04:08:52,851 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 04:08:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 04:08:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 04:08:52,851 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:52,851 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:52,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 04:08:52,852 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash 789708761, now seen corresponding path program 3 times [2022-04-28 04:08:52,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:52,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [530235703] [2022-04-28 04:08:56,954 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:57,025 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:01,109 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:01,162 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:05,241 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:05,306 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:07,914 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:08,029 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:08,029 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:08,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1786102839, now seen corresponding path program 1 times [2022-04-28 04:09:08,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:08,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430178098] [2022-04-28 04:09:08,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:08,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:08,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:08,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {2067#(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); {2061#true} is VALID [2022-04-28 04:09:08,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {2061#true} assume true; {2061#true} is VALID [2022-04-28 04:09:08,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2061#true} {2061#true} #80#return; {2061#true} is VALID [2022-04-28 04:09:08,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {2061#true} call ULTIMATE.init(); {2067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:08,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {2067#(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); {2061#true} is VALID [2022-04-28 04:09:08,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {2061#true} assume true; {2061#true} is VALID [2022-04-28 04:09:08,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2061#true} {2061#true} #80#return; {2061#true} is VALID [2022-04-28 04:09:08,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {2061#true} call #t~ret9 := main(); {2061#true} is VALID [2022-04-28 04:09:08,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {2061#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {2066#(= main_~a~0 0)} is VALID [2022-04-28 04:09:08,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {2066#(= main_~a~0 0)} [96] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_120 v_main_~d~0_118)) (.cse1 (= v_main_~e~0_184 v_main_~e~0_180)) (.cse2 (= |v_main_#t~pre6_64| |v_main_#t~pre6_63|)) (.cse3 (= |v_main_#t~pre4_34| |v_main_#t~pre4_33|)) (.cse4 (= v_main_~c~0_96 v_main_~c~0_94)) (.cse5 (= |v_main_#t~pre7_81| |v_main_#t~pre7_80|)) (.cse6 (= |v_main_#t~pre8_125| |v_main_#t~pre8_122|)) (.cse7 (= v_main_~a~0_46 v_main_~a~0_45)) (.cse8 (= v_main_~b~0_63 v_main_~b~0_61))) (or (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre5_40| |v_main_#t~pre5_39|) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (= |v_main_#t~pre5_39| |v_main_#t~pre5_40|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) InVars {main_~e~0=v_main_~e~0_184, main_#t~pre7=|v_main_#t~pre7_81|, main_~c~0=v_main_~c~0_96, main_#t~pre8=|v_main_#t~pre8_125|, main_~d~0=v_main_~d~0_120, main_~b~0=v_main_~b~0_63, main_#t~pre4=|v_main_#t~pre4_34|, main_#t~pre5=|v_main_#t~pre5_40|, main_~a~0=v_main_~a~0_46, main_#t~pre6=|v_main_#t~pre6_64|} OutVars{main_~e~0=v_main_~e~0_180, main_#t~pre7=|v_main_#t~pre7_80|, main_~c~0=v_main_~c~0_94, main_#t~pre8=|v_main_#t~pre8_122|, main_~d~0=v_main_~d~0_118, main_~b~0=v_main_~b~0_61, main_#t~pre4=|v_main_#t~pre4_33|, main_#t~pre5=|v_main_#t~pre5_39|, main_~a~0=v_main_~a~0_45, main_#t~pre6=|v_main_#t~pre6_63|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2066#(= main_~a~0 0)} is VALID [2022-04-28 04:09:08,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {2066#(= main_~a~0 0)} [95] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {2062#false} is VALID [2022-04-28 04:09:08,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {2062#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {2062#false} is VALID [2022-04-28 04:09:08,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {2062#false} assume !false; {2062#false} is VALID [2022-04-28 04:09:08,080 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 04:09:08,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:08,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430178098] [2022-04-28 04:09:08,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430178098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:08,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:08,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:08,201 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:08,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [530235703] [2022-04-28 04:09:08,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [530235703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:08,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:08,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 04:09:08,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727144395] [2022-04-28 04:09:08,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:08,202 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 04:09:08,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:08,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 04:09:08,220 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 04:09:08,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 04:09:08,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:08,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 04:09:08,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:09:08,221 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 04:09:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:08,540 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-04-28 04:09:08,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 04:09:08,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 04:09:08,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:08,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 04:09:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2022-04-28 04:09:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 04:09:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2022-04-28 04:09:08,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 87 transitions. [2022-04-28 04:09:08,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:08,609 INFO L225 Difference]: With dead ends: 68 [2022-04-28 04:09:08,609 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 04:09:08,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2022-04-28 04:09:08,610 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 102 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:08,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 30 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:09:08,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 04:09:08,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2022-04-28 04:09:08,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:08,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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 04:09:08,616 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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 04:09:08,616 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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 04:09:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:08,617 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-28 04:09:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-28 04:09:08,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:08,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:08,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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 55 states. [2022-04-28 04:09:08,618 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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 55 states. [2022-04-28 04:09:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:08,619 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-28 04:09:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-28 04:09:08,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:08,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:08,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:08,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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 04:09:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-28 04:09:08,620 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 27 [2022-04-28 04:09:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:08,620 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-28 04:09:08,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 04:09:08,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2022-04-28 04:09:08,659 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 04:09:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-28 04:09:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 04:09:08,659 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:08,659 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:08,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 04:09:08,660 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:08,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:08,660 INFO L85 PathProgramCache]: Analyzing trace with hash -365223945, now seen corresponding path program 4 times [2022-04-28 04:09:08,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:08,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2088224773] [2022-04-28 04:09:10,840 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:10,891 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:12,986 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:13,045 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:17,123 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:17,190 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:20,631 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:20,737 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:20,737 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:20,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1786164343, now seen corresponding path program 1 times [2022-04-28 04:09:20,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:20,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516375332] [2022-04-28 04:09:20,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:20,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:20,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:20,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {2405#(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); {2399#true} is VALID [2022-04-28 04:09:20,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {2399#true} assume true; {2399#true} is VALID [2022-04-28 04:09:20,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2399#true} {2399#true} #80#return; {2399#true} is VALID [2022-04-28 04:09:20,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {2399#true} call ULTIMATE.init(); {2405#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:20,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {2405#(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); {2399#true} is VALID [2022-04-28 04:09:20,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {2399#true} assume true; {2399#true} is VALID [2022-04-28 04:09:20,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2399#true} {2399#true} #80#return; {2399#true} is VALID [2022-04-28 04:09:20,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {2399#true} call #t~ret9 := main(); {2399#true} is VALID [2022-04-28 04:09:20,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {2399#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {2404#(= main_~a~0 0)} is VALID [2022-04-28 04:09:20,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {2404#(= main_~a~0 0)} [98] L23-3-->L23-4_primed: Formula: (and (= |v_main_#t~pre8_167| |v_main_#t~pre8_163|) (= |v_main_#t~pre6_71| |v_main_#t~pre6_70|) (= |v_main_#t~pre4_39| |v_main_#t~pre4_38|) (= v_main_~c~0_106 v_main_~c~0_104) (= v_main_~a~0_52 v_main_~a~0_51) (= |v_main_#t~pre7_89| |v_main_#t~pre7_88|) (= v_main_~b~0_71 v_main_~b~0_69) (= v_main_~e~0_235 v_main_~e~0_230) (= v_main_~d~0_132 v_main_~d~0_130) (= |v_main_#t~pre5_46| |v_main_#t~pre5_45|)) InVars {main_~e~0=v_main_~e~0_235, main_#t~pre7=|v_main_#t~pre7_89|, main_~c~0=v_main_~c~0_106, main_#t~pre8=|v_main_#t~pre8_167|, main_~d~0=v_main_~d~0_132, main_~b~0=v_main_~b~0_71, main_#t~pre4=|v_main_#t~pre4_39|, main_#t~pre5=|v_main_#t~pre5_46|, main_~a~0=v_main_~a~0_52, main_#t~pre6=|v_main_#t~pre6_71|} OutVars{main_~e~0=v_main_~e~0_230, main_#t~pre7=|v_main_#t~pre7_88|, main_~c~0=v_main_~c~0_104, main_#t~pre8=|v_main_#t~pre8_163|, main_~d~0=v_main_~d~0_130, main_~b~0=v_main_~b~0_69, main_#t~pre4=|v_main_#t~pre4_38|, main_#t~pre5=|v_main_#t~pre5_45|, main_~a~0=v_main_~a~0_51, main_#t~pre6=|v_main_#t~pre6_70|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2404#(= main_~a~0 0)} is VALID [2022-04-28 04:09:20,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {2404#(= main_~a~0 0)} [97] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {2400#false} is VALID [2022-04-28 04:09:20,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {2400#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {2400#false} is VALID [2022-04-28 04:09:20,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {2400#false} assume !false; {2400#false} is VALID [2022-04-28 04:09:20,789 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 04:09:20,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:20,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516375332] [2022-04-28 04:09:20,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516375332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:20,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:20,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:20,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:20,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2088224773] [2022-04-28 04:09:20,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2088224773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:20,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:20,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 04:09:20,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682553949] [2022-04-28 04:09:20,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:20,940 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 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 29 [2022-04-28 04:09:20,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:20,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 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 04:09:20,959 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 04:09:20,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 04:09:20,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:20,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 04:09:20,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:09:20,960 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 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 04:09:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:21,316 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2022-04-28 04:09:21,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 04:09:21,316 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 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 29 [2022-04-28 04:09:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 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 04:09:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2022-04-28 04:09:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 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 04:09:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2022-04-28 04:09:21,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 89 transitions. [2022-04-28 04:09:21,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:21,389 INFO L225 Difference]: With dead ends: 70 [2022-04-28 04:09:21,390 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 04:09:21,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2022-04-28 04:09:21,391 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 115 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:21,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 25 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:09:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 04:09:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2022-04-28 04:09:21,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:21,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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 04:09:21,397 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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 04:09:21,397 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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 04:09:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:21,398 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2022-04-28 04:09:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2022-04-28 04:09:21,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:21,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:21,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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 57 states. [2022-04-28 04:09:21,399 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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 57 states. [2022-04-28 04:09:21,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:21,399 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2022-04-28 04:09:21,399 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2022-04-28 04:09:21,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:21,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:21,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:21,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:21,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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 04:09:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-28 04:09:21,401 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 29 [2022-04-28 04:09:21,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:21,401 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-28 04:09:21,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 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 04:09:21,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-28 04:09:21,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:21,452 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-28 04:09:21,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 04:09:21,454 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:21,454 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:21,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 04:09:21,455 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:21,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:21,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2140975253, now seen corresponding path program 5 times [2022-04-28 04:09:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:21,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1433782962] [2022-04-28 04:09:25,559 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:25,609 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:28,180 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:28,234 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:32,318 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:32,372 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:34,573 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:34,623 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:34,746 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:34,747 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:34,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1786225847, now seen corresponding path program 1 times [2022-04-28 04:09:34,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:34,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769775207] [2022-04-28 04:09:34,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:34,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:34,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:34,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {2758#(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); {2752#true} is VALID [2022-04-28 04:09:34,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {2752#true} assume true; {2752#true} is VALID [2022-04-28 04:09:34,780 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2752#true} {2752#true} #80#return; {2752#true} is VALID [2022-04-28 04:09:34,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {2752#true} call ULTIMATE.init(); {2758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:34,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {2758#(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); {2752#true} is VALID [2022-04-28 04:09:34,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {2752#true} assume true; {2752#true} is VALID [2022-04-28 04:09:34,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2752#true} {2752#true} #80#return; {2752#true} is VALID [2022-04-28 04:09:34,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {2752#true} call #t~ret9 := main(); {2752#true} is VALID [2022-04-28 04:09:34,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {2752#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {2757#(= main_~a~0 0)} is VALID [2022-04-28 04:09:34,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {2757#(= main_~a~0 0)} [100] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_97| |v_main_#t~pre7_96|)) (.cse1 (= v_main_~d~0_144 v_main_~d~0_142)) (.cse2 (= v_main_~c~0_116 v_main_~c~0_114)) (.cse3 (= v_main_~b~0_79 v_main_~b~0_77)) (.cse4 (= |v_main_#t~pre6_78| |v_main_#t~pre6_77|)) (.cse5 (= |v_main_#t~pre4_44| |v_main_#t~pre4_43|)) (.cse6 (= |v_main_#t~pre5_52| |v_main_#t~pre5_51|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre8_213| |v_main_#t~pre8_208|) (= v_main_~e~0_291 v_main_~e~0_285) .cse6 (= v_main_~a~0_58 v_main_~a~0_57)) (and .cse0 .cse1 .cse2 (= v_main_~e~0_285 v_main_~e~0_291) .cse3 (= v_main_~a~0_57 v_main_~a~0_58) .cse4 .cse5 (= |v_main_#t~pre8_208| |v_main_#t~pre8_213|) .cse6))) InVars {main_~e~0=v_main_~e~0_291, main_#t~pre7=|v_main_#t~pre7_97|, main_~c~0=v_main_~c~0_116, main_#t~pre8=|v_main_#t~pre8_213|, main_~d~0=v_main_~d~0_144, main_~b~0=v_main_~b~0_79, main_#t~pre4=|v_main_#t~pre4_44|, main_#t~pre5=|v_main_#t~pre5_52|, main_~a~0=v_main_~a~0_58, main_#t~pre6=|v_main_#t~pre6_78|} OutVars{main_~e~0=v_main_~e~0_285, main_#t~pre7=|v_main_#t~pre7_96|, main_~c~0=v_main_~c~0_114, main_#t~pre8=|v_main_#t~pre8_208|, main_~d~0=v_main_~d~0_142, main_~b~0=v_main_~b~0_77, main_#t~pre4=|v_main_#t~pre4_43|, main_#t~pre5=|v_main_#t~pre5_51|, main_~a~0=v_main_~a~0_57, main_#t~pre6=|v_main_#t~pre6_77|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2757#(= main_~a~0 0)} is VALID [2022-04-28 04:09:34,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {2757#(= main_~a~0 0)} [99] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {2753#false} is VALID [2022-04-28 04:09:34,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {2753#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {2753#false} is VALID [2022-04-28 04:09:34,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {2753#false} assume !false; {2753#false} is VALID [2022-04-28 04:09:34,783 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 04:09:34,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:34,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769775207] [2022-04-28 04:09:34,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769775207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:34,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:34,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:34,968 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:34,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1433782962] [2022-04-28 04:09:34,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1433782962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:34,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:34,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 04:09:34,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274677529] [2022-04-28 04:09:34,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:34,969 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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 04:09:34,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:34,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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 04:09:34,994 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 04:09:34,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 04:09:34,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:34,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 04:09:34,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:09:34,995 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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 04:09:35,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:35,434 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2022-04-28 04:09:35,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 04:09:35,434 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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 04:09:35,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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 04:09:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 91 transitions. [2022-04-28 04:09:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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 04:09:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 91 transitions. [2022-04-28 04:09:35,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 91 transitions. [2022-04-28 04:09:35,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:35,505 INFO L225 Difference]: With dead ends: 72 [2022-04-28 04:09:35,505 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 04:09:35,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2022-04-28 04:09:35,506 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 108 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:35,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 30 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:09:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 04:09:35,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2022-04-28 04:09:35,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:35,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 34 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 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 04:09:35,514 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 34 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 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 04:09:35,514 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 34 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 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 04:09:35,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:35,516 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-28 04:09:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-28 04:09:35,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:35,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:35,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 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 59 states. [2022-04-28 04:09:35,516 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 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 59 states. [2022-04-28 04:09:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:35,517 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-28 04:09:35,517 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-28 04:09:35,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:35,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:35,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:35,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:35,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 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 04:09:35,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-28 04:09:35,518 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 31 [2022-04-28 04:09:35,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:35,518 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-28 04:09:35,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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 04:09:35,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-28 04:09:35,560 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 04:09:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-28 04:09:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 04:09:35,560 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:35,560 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:35,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 04:09:35,561 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:35,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:35,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1121751475, now seen corresponding path program 6 times [2022-04-28 04:09:35,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:35,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1424685935] [2022-04-28 04:09:39,697 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:39,753 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:42,560 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:42,601 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:46,671 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:46,718 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:50,785 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:50,833 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:50,960 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:50,961 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:50,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1786287351, now seen corresponding path program 1 times [2022-04-28 04:09:50,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:50,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030713744] [2022-04-28 04:09:50,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:50,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:50,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:50,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {3126#(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); {3120#true} is VALID [2022-04-28 04:09:50,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {3120#true} assume true; {3120#true} is VALID [2022-04-28 04:09:50,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3120#true} {3120#true} #80#return; {3120#true} is VALID [2022-04-28 04:09:50,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {3120#true} call ULTIMATE.init(); {3126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:50,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {3126#(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); {3120#true} is VALID [2022-04-28 04:09:50,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {3120#true} assume true; {3120#true} is VALID [2022-04-28 04:09:50,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3120#true} {3120#true} #80#return; {3120#true} is VALID [2022-04-28 04:09:50,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {3120#true} call #t~ret9 := main(); {3120#true} is VALID [2022-04-28 04:09:50,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {3120#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {3125#(= main_~a~0 0)} is VALID [2022-04-28 04:09:50,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {3125#(= main_~a~0 0)} [102] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_126 v_main_~c~0_124)) (.cse1 (= |v_main_#t~pre7_105| |v_main_#t~pre7_104|)) (.cse2 (= v_main_~b~0_87 v_main_~b~0_85)) (.cse3 (= v_main_~d~0_156 v_main_~d~0_154)) (.cse4 (= |v_main_#t~pre5_58| |v_main_#t~pre5_57|)) (.cse5 (= |v_main_#t~pre6_85| |v_main_#t~pre6_84|)) (.cse6 (= |v_main_#t~pre4_49| |v_main_#t~pre4_48|)) (.cse7 (= v_main_~a~0_64 v_main_~a~0_63))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~e~0_352 v_main_~e~0_345) .cse5 .cse6 .cse7 (= |v_main_#t~pre8_263| |v_main_#t~pre8_257|)) (and .cse0 (= v_main_~e~0_345 v_main_~e~0_352) (= |v_main_#t~pre8_257| |v_main_#t~pre8_263|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_352, main_#t~pre7=|v_main_#t~pre7_105|, main_~c~0=v_main_~c~0_126, main_#t~pre8=|v_main_#t~pre8_263|, main_~d~0=v_main_~d~0_156, main_~b~0=v_main_~b~0_87, main_#t~pre4=|v_main_#t~pre4_49|, main_#t~pre5=|v_main_#t~pre5_58|, main_~a~0=v_main_~a~0_64, main_#t~pre6=|v_main_#t~pre6_85|} OutVars{main_~e~0=v_main_~e~0_345, main_#t~pre7=|v_main_#t~pre7_104|, main_~c~0=v_main_~c~0_124, main_#t~pre8=|v_main_#t~pre8_257|, main_~d~0=v_main_~d~0_154, main_~b~0=v_main_~b~0_85, main_#t~pre4=|v_main_#t~pre4_48|, main_#t~pre5=|v_main_#t~pre5_57|, main_~a~0=v_main_~a~0_63, main_#t~pre6=|v_main_#t~pre6_84|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3125#(= main_~a~0 0)} is VALID [2022-04-28 04:09:50,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {3125#(= main_~a~0 0)} [101] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {3121#false} is VALID [2022-04-28 04:09:50,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {3121#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {3121#false} is VALID [2022-04-28 04:09:50,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {3121#false} assume !false; {3121#false} is VALID [2022-04-28 04:09:50,989 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 04:09:50,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:50,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030713744] [2022-04-28 04:09:50,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030713744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:50,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:50,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:51,179 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:51,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1424685935] [2022-04-28 04:09:51,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1424685935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:51,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:51,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 04:09:51,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891158199] [2022-04-28 04:09:51,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:51,180 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 33 [2022-04-28 04:09:51,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:51,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 04:09:51,217 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 04:09:51,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 04:09:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:51,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 04:09:51,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-04-28 04:09:51,218 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 04:09:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:51,700 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2022-04-28 04:09:51,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 04:09:51,700 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 33 [2022-04-28 04:09:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 04:09:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 91 transitions. [2022-04-28 04:09:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 04:09:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 91 transitions. [2022-04-28 04:09:51,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 91 transitions. [2022-04-28 04:09:51,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:51,764 INFO L225 Difference]: With dead ends: 72 [2022-04-28 04:09:51,764 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 04:09:51,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=516, Unknown=0, NotChecked=0, Total=702 [2022-04-28 04:09:51,765 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 117 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:51,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 24 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:09:51,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 04:09:51,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2022-04-28 04:09:51,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:51,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 38 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 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 04:09:51,788 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 38 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 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 04:09:51,791 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 38 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 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 04:09:51,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:51,792 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-04-28 04:09:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-04-28 04:09:51,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:51,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:51,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 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 59 states. [2022-04-28 04:09:51,794 INFO L87 Difference]: Start difference. First operand has 38 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 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 59 states. [2022-04-28 04:09:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:51,795 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-04-28 04:09:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-04-28 04:09:51,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:51,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:51,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:51,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 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 04:09:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-28 04:09:51,796 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 33 [2022-04-28 04:09:51,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:51,796 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-28 04:09:51,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 04:09:51,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 42 transitions. [2022-04-28 04:09:51,845 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 04:09:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-28 04:09:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 04:09:51,845 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:51,845 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:51,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 04:09:51,845 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:51,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:51,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1366382042, now seen corresponding path program 7 times [2022-04-28 04:09:51,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:51,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1637018784] [2022-04-28 04:09:52,054 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:52,146 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:52,260 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:52,346 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:52,458 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:52,546 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:52,650 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:52,744 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:52,871 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:52,871 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:52,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1786348855, now seen corresponding path program 1 times [2022-04-28 04:09:52,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:52,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270004563] [2022-04-28 04:09:52,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:52,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:52,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:52,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {3508#(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); {3502#true} is VALID [2022-04-28 04:09:52,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {3502#true} assume true; {3502#true} is VALID [2022-04-28 04:09:52,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3502#true} {3502#true} #80#return; {3502#true} is VALID [2022-04-28 04:09:52,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {3502#true} call ULTIMATE.init(); {3508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:52,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {3508#(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); {3502#true} is VALID [2022-04-28 04:09:52,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {3502#true} assume true; {3502#true} is VALID [2022-04-28 04:09:52,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3502#true} {3502#true} #80#return; {3502#true} is VALID [2022-04-28 04:09:52,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {3502#true} call #t~ret9 := main(); {3502#true} is VALID [2022-04-28 04:09:52,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {3502#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {3507#(= main_~a~0 0)} is VALID [2022-04-28 04:09:52,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {3507#(= main_~a~0 0)} [104] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_64| |v_main_#t~pre5_63|)) (.cse1 (= v_main_~e~0_440 v_main_~e~0_432)) (.cse2 (= |v_main_#t~pre4_54| |v_main_#t~pre4_53|)) (.cse3 (= v_main_~c~0_136 v_main_~c~0_134)) (.cse4 (= |v_main_#t~pre6_92| |v_main_#t~pre6_91|)) (.cse5 (= v_main_~d~0_196 v_main_~d~0_193)) (.cse6 (= v_main_~b~0_95 v_main_~b~0_93)) (.cse7 (= |v_main_#t~pre7_138| |v_main_#t~pre7_136|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre8_313| |v_main_#t~pre8_307|) .cse6 .cse7 (= v_main_~a~0_70 v_main_~a~0_69)) (and (= v_main_~a~0_69 v_main_~a~0_70) .cse0 .cse1 (= |v_main_#t~pre8_307| |v_main_#t~pre8_313|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_440, main_#t~pre7=|v_main_#t~pre7_138|, main_~c~0=v_main_~c~0_136, main_#t~pre8=|v_main_#t~pre8_313|, main_~d~0=v_main_~d~0_196, main_~b~0=v_main_~b~0_95, main_#t~pre4=|v_main_#t~pre4_54|, main_#t~pre5=|v_main_#t~pre5_64|, main_~a~0=v_main_~a~0_70, main_#t~pre6=|v_main_#t~pre6_92|} OutVars{main_~e~0=v_main_~e~0_432, main_#t~pre7=|v_main_#t~pre7_136|, main_~c~0=v_main_~c~0_134, main_#t~pre8=|v_main_#t~pre8_307|, main_~d~0=v_main_~d~0_193, main_~b~0=v_main_~b~0_93, main_#t~pre4=|v_main_#t~pre4_53|, main_#t~pre5=|v_main_#t~pre5_63|, main_~a~0=v_main_~a~0_69, main_#t~pre6=|v_main_#t~pre6_91|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3507#(= main_~a~0 0)} is VALID [2022-04-28 04:09:52,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {3507#(= main_~a~0 0)} [103] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {3503#false} is VALID [2022-04-28 04:09:52,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {3503#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {3503#false} is VALID [2022-04-28 04:09:52,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {3503#false} assume !false; {3503#false} is VALID [2022-04-28 04:09:52,900 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 04:09:52,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:52,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270004563] [2022-04-28 04:09:52,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270004563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:52,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:52,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:53,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:53,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1637018784] [2022-04-28 04:09:53,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1637018784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:53,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:53,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 04:09:53,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883958750] [2022-04-28 04:09:53,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:53,147 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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 36 [2022-04-28 04:09:53,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:53,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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 04:09:53,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:53,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 04:09:53,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:53,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 04:09:53,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-04-28 04:09:53,170 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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 04:09:53,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:53,676 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2022-04-28 04:09:53,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 04:09:53,676 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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 36 [2022-04-28 04:09:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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 04:09:53,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 92 transitions. [2022-04-28 04:09:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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 04:09:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 92 transitions. [2022-04-28 04:09:53,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 92 transitions. [2022-04-28 04:09:53,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:53,750 INFO L225 Difference]: With dead ends: 74 [2022-04-28 04:09:53,750 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 04:09:53,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2022-04-28 04:09:53,751 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 97 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:53,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 34 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:09:53,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 04:09:53,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2022-04-28 04:09:53,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:53,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 39 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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 04:09:53,760 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 39 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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 04:09:53,760 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 39 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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 04:09:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:53,762 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-28 04:09:53,763 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-04-28 04:09:53,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:53,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:53,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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 61 states. [2022-04-28 04:09:53,763 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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 61 states. [2022-04-28 04:09:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:53,764 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-28 04:09:53,764 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-04-28 04:09:53,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:53,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:53,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:53,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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 04:09:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-28 04:09:53,765 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 36 [2022-04-28 04:09:53,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:53,766 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-28 04:09:53,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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 04:09:53,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-28 04:09:53,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 04:09:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 04:09:53,820 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:53,820 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:53,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 04:09:53,820 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:53,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:53,820 INFO L85 PathProgramCache]: Analyzing trace with hash -232982088, now seen corresponding path program 8 times [2022-04-28 04:09:53,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:53,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1756039732] [2022-04-28 04:09:54,073 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:54,159 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:54,336 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:54,426 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:54,554 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:54,653 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:54,783 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:54,877 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:55,009 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:55,009 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:55,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1786410359, now seen corresponding path program 1 times [2022-04-28 04:09:55,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:55,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791667888] [2022-04-28 04:09:55,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:55,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:55,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:55,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {3903#(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); {3897#true} is VALID [2022-04-28 04:09:55,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {3897#true} assume true; {3897#true} is VALID [2022-04-28 04:09:55,033 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3897#true} {3897#true} #80#return; {3897#true} is VALID [2022-04-28 04:09:55,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {3897#true} call ULTIMATE.init(); {3903#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:55,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {3903#(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); {3897#true} is VALID [2022-04-28 04:09:55,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {3897#true} assume true; {3897#true} is VALID [2022-04-28 04:09:55,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3897#true} {3897#true} #80#return; {3897#true} is VALID [2022-04-28 04:09:55,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {3897#true} call #t~ret9 := main(); {3897#true} is VALID [2022-04-28 04:09:55,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {3897#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {3902#(= main_~a~0 0)} is VALID [2022-04-28 04:09:55,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {3902#(= main_~a~0 0)} [106] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_99| |v_main_#t~pre6_98|)) (.cse1 (= v_main_~a~0_76 v_main_~a~0_75)) (.cse2 (= v_main_~c~0_146 v_main_~c~0_144)) (.cse3 (= v_main_~b~0_103 v_main_~b~0_101)) (.cse4 (= |v_main_#t~pre4_59| |v_main_#t~pre4_58|)) (.cse5 (= v_main_~d~0_238 v_main_~d~0_235)) (.cse6 (= |v_main_#t~pre8_368| |v_main_#t~pre8_361|))) (or (and (= |v_main_#t~pre7_172| |v_main_#t~pre7_170|) .cse0 .cse1 .cse2 (= v_main_~e~0_536 v_main_~e~0_527) .cse3 .cse4 .cse5 (= |v_main_#t~pre5_70| |v_main_#t~pre5_69|) .cse6) (and (= v_main_~e~0_527 v_main_~e~0_536) (= |v_main_#t~pre7_170| |v_main_#t~pre7_172|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |v_main_#t~pre5_69| |v_main_#t~pre5_70|)))) InVars {main_~e~0=v_main_~e~0_536, main_#t~pre7=|v_main_#t~pre7_172|, main_~c~0=v_main_~c~0_146, main_#t~pre8=|v_main_#t~pre8_368|, main_~d~0=v_main_~d~0_238, main_~b~0=v_main_~b~0_103, main_#t~pre4=|v_main_#t~pre4_59|, main_#t~pre5=|v_main_#t~pre5_70|, main_~a~0=v_main_~a~0_76, main_#t~pre6=|v_main_#t~pre6_99|} OutVars{main_~e~0=v_main_~e~0_527, main_#t~pre7=|v_main_#t~pre7_170|, main_~c~0=v_main_~c~0_144, main_#t~pre8=|v_main_#t~pre8_361|, main_~d~0=v_main_~d~0_235, main_~b~0=v_main_~b~0_101, main_#t~pre4=|v_main_#t~pre4_58|, main_#t~pre5=|v_main_#t~pre5_69|, main_~a~0=v_main_~a~0_75, main_#t~pre6=|v_main_#t~pre6_98|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3902#(= main_~a~0 0)} is VALID [2022-04-28 04:09:55,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {3902#(= main_~a~0 0)} [105] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {3898#false} is VALID [2022-04-28 04:09:55,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {3898#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {3898#false} is VALID [2022-04-28 04:09:55,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {3898#false} assume !false; {3898#false} is VALID [2022-04-28 04:09:55,035 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 04:09:55,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:55,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791667888] [2022-04-28 04:09:55,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791667888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:55,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:55,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:55,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:55,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1756039732] [2022-04-28 04:09:55,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1756039732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:55,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:55,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 04:09:55,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119728102] [2022-04-28 04:09:55,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:55,285 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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 38 [2022-04-28 04:09:55,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:55,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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 04:09:55,311 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 04:09:55,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 04:09:55,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:55,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 04:09:55,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-04-28 04:09:55,312 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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 04:09:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:56,019 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2022-04-28 04:09:56,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 04:09:56,020 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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 38 [2022-04-28 04:09:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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 04:09:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-28 04:09:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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 04:09:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-28 04:09:56,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2022-04-28 04:09:56,089 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-28 04:09:56,090 INFO L225 Difference]: With dead ends: 76 [2022-04-28 04:09:56,090 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 04:09:56,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2022-04-28 04:09:56,091 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 124 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:56,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 39 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 04:09:56,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 04:09:56,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2022-04-28 04:09:56,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:56,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 41 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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 04:09:56,103 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 41 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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 04:09:56,103 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 41 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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 04:09:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:56,104 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-28 04:09:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-28 04:09:56,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:56,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:56,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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 63 states. [2022-04-28 04:09:56,104 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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 63 states. [2022-04-28 04:09:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:56,105 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-28 04:09:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-28 04:09:56,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:56,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:56,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:56,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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 04:09:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-28 04:09:56,106 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 38 [2022-04-28 04:09:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:56,106 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-28 04:09:56,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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 04:09:56,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 45 transitions. [2022-04-28 04:09:56,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-28 04:09:56,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 04:09:56,166 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:56,166 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:56,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 04:09:56,167 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:56,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:56,167 INFO L85 PathProgramCache]: Analyzing trace with hash 376380950, now seen corresponding path program 9 times [2022-04-28 04:09:56,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:56,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1622266909] [2022-04-28 04:09:56,416 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:56,512 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:56,645 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:56,773 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:56,905 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:56,989 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:57,118 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:57,210 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:57,335 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:57,336 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:57,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1786471863, now seen corresponding path program 1 times [2022-04-28 04:09:57,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:57,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310744959] [2022-04-28 04:09:57,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:57,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:57,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:57,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {4313#(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); {4307#true} is VALID [2022-04-28 04:09:57,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-28 04:09:57,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4307#true} {4307#true} #80#return; {4307#true} is VALID [2022-04-28 04:09:57,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {4307#true} call ULTIMATE.init(); {4313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:57,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {4313#(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); {4307#true} is VALID [2022-04-28 04:09:57,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {4307#true} assume true; {4307#true} is VALID [2022-04-28 04:09:57,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4307#true} {4307#true} #80#return; {4307#true} is VALID [2022-04-28 04:09:57,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {4307#true} call #t~ret9 := main(); {4307#true} is VALID [2022-04-28 04:09:57,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {4307#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {4312#(= main_~a~0 0)} is VALID [2022-04-28 04:09:57,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {4312#(= main_~a~0 0)} [108] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_76| |v_main_#t~pre5_75|)) (.cse1 (= |v_main_#t~pre6_106| |v_main_#t~pre6_105|)) (.cse2 (= v_main_~a~0_82 v_main_~a~0_81)) (.cse3 (= |v_main_#t~pre4_64| |v_main_#t~pre4_63|)) (.cse4 (= |v_main_#t~pre7_206| |v_main_#t~pre7_204|)) (.cse5 (= v_main_~c~0_156 v_main_~c~0_154)) (.cse6 (= v_main_~d~0_280 v_main_~d~0_277))) (or (and .cse0 .cse1 (= v_main_~b~0_111 v_main_~b~0_109) (= v_main_~e~0_637 v_main_~e~0_627) .cse2 (= |v_main_#t~pre8_427| |v_main_#t~pre8_419|) .cse3 .cse4 .cse5 .cse6) (and (= |v_main_#t~pre8_419| |v_main_#t~pre8_427|) .cse0 (= v_main_~e~0_627 v_main_~e~0_637) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~b~0_109 v_main_~b~0_111)))) InVars {main_~e~0=v_main_~e~0_637, main_#t~pre7=|v_main_#t~pre7_206|, main_~c~0=v_main_~c~0_156, main_#t~pre8=|v_main_#t~pre8_427|, main_~d~0=v_main_~d~0_280, main_~b~0=v_main_~b~0_111, main_#t~pre4=|v_main_#t~pre4_64|, main_#t~pre5=|v_main_#t~pre5_76|, main_~a~0=v_main_~a~0_82, main_#t~pre6=|v_main_#t~pre6_106|} OutVars{main_~e~0=v_main_~e~0_627, main_#t~pre7=|v_main_#t~pre7_204|, main_~c~0=v_main_~c~0_154, main_#t~pre8=|v_main_#t~pre8_419|, main_~d~0=v_main_~d~0_277, main_~b~0=v_main_~b~0_109, main_#t~pre4=|v_main_#t~pre4_63|, main_#t~pre5=|v_main_#t~pre5_75|, main_~a~0=v_main_~a~0_81, main_#t~pre6=|v_main_#t~pre6_105|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {4312#(= main_~a~0 0)} is VALID [2022-04-28 04:09:57,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {4312#(= main_~a~0 0)} [107] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {4308#false} is VALID [2022-04-28 04:09:57,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {4308#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {4308#false} is VALID [2022-04-28 04:09:57,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {4308#false} assume !false; {4308#false} is VALID [2022-04-28 04:09:57,379 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 04:09:57,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:57,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310744959] [2022-04-28 04:09:57,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310744959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:57,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:57,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:57,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:57,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1622266909] [2022-04-28 04:09:57,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1622266909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:57,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:57,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 04:09:57,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942238471] [2022-04-28 04:09:57,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:57,643 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 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 40 [2022-04-28 04:09:57,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:57,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 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 04:09:57,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:57,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 04:09:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:57,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 04:09:57,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-04-28 04:09:57,669 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 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 04:09:58,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:58,326 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2022-04-28 04:09:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 04:09:58,326 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 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 40 [2022-04-28 04:09:58,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 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 04:09:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 96 transitions. [2022-04-28 04:09:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 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 04:09:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 96 transitions. [2022-04-28 04:09:58,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 96 transitions. [2022-04-28 04:09:58,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:58,402 INFO L225 Difference]: With dead ends: 78 [2022-04-28 04:09:58,402 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 04:09:58,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=825, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 04:09:58,403 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 118 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:58,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 24 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 04:09:58,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 04:09:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2022-04-28 04:09:58,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:58,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 43 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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 04:09:58,415 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 43 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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 04:09:58,415 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 43 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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 04:09:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:58,416 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 04:09:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 04:09:58,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:58,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:58,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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 65 states. [2022-04-28 04:09:58,416 INFO L87 Difference]: Start difference. First operand has 43 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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 65 states. [2022-04-28 04:09:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:58,417 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 04:09:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 04:09:58,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:58,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:58,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:58,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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 04:09:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-28 04:09:58,418 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 40 [2022-04-28 04:09:58,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:58,418 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-28 04:09:58,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 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 04:09:58,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-28 04:09:58,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 04:09:58,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 04:09:58,482 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:58,482 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:58,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 04:09:58,482 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:58,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:58,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1858708212, now seen corresponding path program 10 times [2022-04-28 04:09:58,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:58,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1880038734] [2022-04-28 04:10:02,690 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:02,742 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:02,828 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:06,903 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:06,947 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:07,032 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:11,113 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:11,155 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:11,266 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:13,481 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:13,564 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:13,710 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:13,710 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:13,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1786533367, now seen corresponding path program 1 times [2022-04-28 04:10:13,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:13,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228331175] [2022-04-28 04:10:13,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:13,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:13,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:13,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {4738#(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); {4732#true} is VALID [2022-04-28 04:10:13,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {4732#true} assume true; {4732#true} is VALID [2022-04-28 04:10:13,736 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4732#true} {4732#true} #80#return; {4732#true} is VALID [2022-04-28 04:10:13,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {4732#true} call ULTIMATE.init(); {4738#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:13,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {4738#(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); {4732#true} is VALID [2022-04-28 04:10:13,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {4732#true} assume true; {4732#true} is VALID [2022-04-28 04:10:13,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4732#true} {4732#true} #80#return; {4732#true} is VALID [2022-04-28 04:10:13,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {4732#true} call #t~ret9 := main(); {4732#true} is VALID [2022-04-28 04:10:13,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {4732#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {4737#(= main_~a~0 0)} is VALID [2022-04-28 04:10:13,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {4737#(= main_~a~0 0)} [110] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~e~0_743 v_main_~e~0_732)) (.cse1 (= |v_main_#t~pre8_490| |v_main_#t~pre8_481|)) (.cse2 (= v_main_~d~0_322 v_main_~d~0_319)) (.cse3 (= v_main_~c~0_166 v_main_~c~0_164)) (.cse4 (= |v_main_#t~pre6_113| |v_main_#t~pre6_112|)) (.cse5 (= |v_main_#t~pre5_82| |v_main_#t~pre5_81|)) (.cse6 (= v_main_~a~0_88 v_main_~a~0_87)) (.cse7 (= |v_main_#t~pre4_69| |v_main_#t~pre4_68|)) (.cse8 (= v_main_~b~0_119 v_main_~b~0_117))) (or (and (= |v_main_#t~pre7_240| |v_main_#t~pre7_238|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_main_#t~pre7_238| |v_main_#t~pre7_240|)))) InVars {main_~e~0=v_main_~e~0_743, main_#t~pre7=|v_main_#t~pre7_240|, main_~c~0=v_main_~c~0_166, main_#t~pre8=|v_main_#t~pre8_490|, main_~d~0=v_main_~d~0_322, main_~b~0=v_main_~b~0_119, main_#t~pre4=|v_main_#t~pre4_69|, main_#t~pre5=|v_main_#t~pre5_82|, main_~a~0=v_main_~a~0_88, main_#t~pre6=|v_main_#t~pre6_113|} OutVars{main_~e~0=v_main_~e~0_732, main_#t~pre7=|v_main_#t~pre7_238|, main_~c~0=v_main_~c~0_164, main_#t~pre8=|v_main_#t~pre8_481|, main_~d~0=v_main_~d~0_319, main_~b~0=v_main_~b~0_117, main_#t~pre4=|v_main_#t~pre4_68|, main_#t~pre5=|v_main_#t~pre5_81|, main_~a~0=v_main_~a~0_87, main_#t~pre6=|v_main_#t~pre6_112|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {4737#(= main_~a~0 0)} is VALID [2022-04-28 04:10:13,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {4737#(= main_~a~0 0)} [109] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {4733#false} is VALID [2022-04-28 04:10:13,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {4733#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {4733#false} is VALID [2022-04-28 04:10:13,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {4733#false} assume !false; {4733#false} is VALID [2022-04-28 04:10:13,738 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 04:10:13,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:13,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228331175] [2022-04-28 04:10:13,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228331175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:13,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:13,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:14,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:14,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1880038734] [2022-04-28 04:10:14,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1880038734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:14,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:14,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 04:10:14,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144415451] [2022-04-28 04:10:14,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:14,034 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 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 42 [2022-04-28 04:10:14,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:14,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 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 04:10:14,061 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 04:10:14,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 04:10:14,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:14,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 04:10:14,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2022-04-28 04:10:14,062 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 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 04:10:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:14,977 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2022-04-28 04:10:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 04:10:14,977 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 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 42 [2022-04-28 04:10:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 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 04:10:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2022-04-28 04:10:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 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 04:10:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2022-04-28 04:10:14,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 98 transitions. [2022-04-28 04:10:15,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:15,043 INFO L225 Difference]: With dead ends: 80 [2022-04-28 04:10:15,043 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 04:10:15,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=944, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 04:10:15,043 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 120 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:15,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 59 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 04:10:15,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 04:10:15,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2022-04-28 04:10:15,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:15,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 45 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 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 04:10:15,054 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 45 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 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 04:10:15,055 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 45 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 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 04:10:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:15,055 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2022-04-28 04:10:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-04-28 04:10:15,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:15,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:15,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 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 67 states. [2022-04-28 04:10:15,056 INFO L87 Difference]: Start difference. First operand has 45 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 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 67 states. [2022-04-28 04:10:15,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:15,057 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2022-04-28 04:10:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-04-28 04:10:15,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:15,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:15,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:15,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 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 04:10:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-04-28 04:10:15,058 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 42 [2022-04-28 04:10:15,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:15,058 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-04-28 04:10:15,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 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 04:10:15,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 49 transitions. [2022-04-28 04:10:15,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-28 04:10:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 04:10:15,135 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:15,135 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:15,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 04:10:15,135 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:15,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash 446064722, now seen corresponding path program 11 times [2022-04-28 04:10:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:15,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [473952897] [2022-04-28 04:10:19,324 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:19,368 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:19,452 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:23,532 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:23,575 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:23,662 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:27,739 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:27,782 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:27,870 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:31,948 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:31,990 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:32,087 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:32,234 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:32,234 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:32,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1786594871, now seen corresponding path program 1 times [2022-04-28 04:10:32,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:32,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187671748] [2022-04-28 04:10:32,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:32,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:32,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:32,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {5178#(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); {5172#true} is VALID [2022-04-28 04:10:32,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {5172#true} assume true; {5172#true} is VALID [2022-04-28 04:10:32,259 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5172#true} {5172#true} #80#return; {5172#true} is VALID [2022-04-28 04:10:32,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {5172#true} call ULTIMATE.init(); {5178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:32,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {5178#(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); {5172#true} is VALID [2022-04-28 04:10:32,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {5172#true} assume true; {5172#true} is VALID [2022-04-28 04:10:32,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5172#true} {5172#true} #80#return; {5172#true} is VALID [2022-04-28 04:10:32,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {5172#true} call #t~ret9 := main(); {5172#true} is VALID [2022-04-28 04:10:32,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {5172#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {5177#(= main_~a~0 0)} is VALID [2022-04-28 04:10:32,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {5177#(= main_~a~0 0)} [112] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_94 v_main_~a~0_93)) (.cse1 (= v_main_~c~0_176 v_main_~c~0_174)) (.cse2 (= v_main_~b~0_127 v_main_~b~0_125)) (.cse3 (= |v_main_#t~pre5_88| |v_main_#t~pre5_87|)) (.cse4 (= |v_main_#t~pre4_74| |v_main_#t~pre4_73|)) (.cse5 (= |v_main_#t~pre7_274| |v_main_#t~pre7_272|)) (.cse6 (= |v_main_#t~pre8_557| |v_main_#t~pre8_547|)) (.cse7 (= v_main_~d~0_364 v_main_~d~0_361))) (or (and .cse0 .cse1 (= |v_main_#t~pre6_119| |v_main_#t~pre6_120|) .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~e~0_842 v_main_~e~0_854) .cse7) (and .cse0 (= v_main_~e~0_854 v_main_~e~0_842) .cse1 (= |v_main_#t~pre6_120| |v_main_#t~pre6_119|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_854, main_#t~pre7=|v_main_#t~pre7_274|, main_~c~0=v_main_~c~0_176, main_#t~pre8=|v_main_#t~pre8_557|, main_~d~0=v_main_~d~0_364, main_~b~0=v_main_~b~0_127, main_#t~pre4=|v_main_#t~pre4_74|, main_#t~pre5=|v_main_#t~pre5_88|, main_~a~0=v_main_~a~0_94, main_#t~pre6=|v_main_#t~pre6_120|} OutVars{main_~e~0=v_main_~e~0_842, main_#t~pre7=|v_main_#t~pre7_272|, main_~c~0=v_main_~c~0_174, main_#t~pre8=|v_main_#t~pre8_547|, main_~d~0=v_main_~d~0_361, main_~b~0=v_main_~b~0_125, main_#t~pre4=|v_main_#t~pre4_73|, main_#t~pre5=|v_main_#t~pre5_87|, main_~a~0=v_main_~a~0_93, main_#t~pre6=|v_main_#t~pre6_119|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {5177#(= main_~a~0 0)} is VALID [2022-04-28 04:10:32,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {5177#(= main_~a~0 0)} [111] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {5173#false} is VALID [2022-04-28 04:10:32,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {5173#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {5173#false} is VALID [2022-04-28 04:10:32,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {5173#false} assume !false; {5173#false} is VALID [2022-04-28 04:10:32,261 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 04:10:32,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:32,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187671748] [2022-04-28 04:10:32,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187671748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:32,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:32,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:32,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:32,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [473952897] [2022-04-28 04:10:32,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [473952897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:32,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:32,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 04:10:32,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257820730] [2022-04-28 04:10:32,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:32,577 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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 44 [2022-04-28 04:10:32,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:32,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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 04:10:32,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:32,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 04:10:32,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:32,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 04:10:32,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-04-28 04:10:32,607 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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 04:10:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:33,392 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2022-04-28 04:10:33,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 04:10:33,392 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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 44 [2022-04-28 04:10:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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 04:10:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 100 transitions. [2022-04-28 04:10:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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 04:10:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 100 transitions. [2022-04-28 04:10:33,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 100 transitions. [2022-04-28 04:10:33,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:33,461 INFO L225 Difference]: With dead ends: 82 [2022-04-28 04:10:33,461 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 04:10:33,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 04:10:33,462 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 135 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:33,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 24 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 04:10:33,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 04:10:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2022-04-28 04:10:33,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:33,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 47 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 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 04:10:33,474 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 47 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 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 04:10:33,474 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 47 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 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 04:10:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:33,475 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-28 04:10:33,475 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-04-28 04:10:33,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:33,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:33,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 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 04:10:33,475 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 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 04:10:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:33,476 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-28 04:10:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-04-28 04:10:33,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:33,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:33,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:33,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 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 04:10:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-28 04:10:33,477 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 44 [2022-04-28 04:10:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:33,477 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-28 04:10:33,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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 04:10:33,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-28 04:10:33,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 04:10:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 04:10:33,549 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:33,549 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:33,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 04:10:33,550 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:33,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:33,550 INFO L85 PathProgramCache]: Analyzing trace with hash 105336368, now seen corresponding path program 12 times [2022-04-28 04:10:33,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:33,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2079633660] [2022-04-28 04:10:36,868 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:36,908 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:36,995 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:41,077 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:41,119 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:41,201 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:45,280 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:45,330 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:45,423 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:49,508 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:49,548 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:49,650 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:49,771 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:49,771 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1786656375, now seen corresponding path program 1 times [2022-04-28 04:10:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:49,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024730682] [2022-04-28 04:10:49,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:49,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:49,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:49,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {5633#(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); {5627#true} is VALID [2022-04-28 04:10:49,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {5627#true} assume true; {5627#true} is VALID [2022-04-28 04:10:49,825 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5627#true} {5627#true} #80#return; {5627#true} is VALID [2022-04-28 04:10:49,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {5627#true} call ULTIMATE.init(); {5633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:49,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {5633#(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); {5627#true} is VALID [2022-04-28 04:10:49,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {5627#true} assume true; {5627#true} is VALID [2022-04-28 04:10:49,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5627#true} {5627#true} #80#return; {5627#true} is VALID [2022-04-28 04:10:49,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {5627#true} call #t~ret9 := main(); {5627#true} is VALID [2022-04-28 04:10:49,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {5627#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {5632#(= main_~a~0 0)} is VALID [2022-04-28 04:10:49,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {5632#(= main_~a~0 0)} [114] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre8_628| |v_main_#t~pre8_617|)) (.cse1 (= |v_main_#t~pre5_94| |v_main_#t~pre5_93|)) (.cse2 (= |v_main_#t~pre6_127| |v_main_#t~pre6_126|)) (.cse3 (= v_main_~a~0_100 v_main_~a~0_99)) (.cse4 (= |v_main_#t~pre7_308| |v_main_#t~pre7_306|)) (.cse5 (= v_main_~e~0_970 v_main_~e~0_957)) (.cse6 (= v_main_~b~0_135 v_main_~b~0_133)) (.cse7 (= v_main_~c~0_186 v_main_~c~0_184))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~pre4_78| |v_main_#t~pre4_79|) (= v_main_~d~0_403 v_main_~d~0_406) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= v_main_~d~0_406 v_main_~d~0_403) .cse3 (= |v_main_#t~pre4_79| |v_main_#t~pre4_78|) .cse4 .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_970, main_#t~pre7=|v_main_#t~pre7_308|, main_~c~0=v_main_~c~0_186, main_#t~pre8=|v_main_#t~pre8_628|, main_~d~0=v_main_~d~0_406, main_~b~0=v_main_~b~0_135, main_#t~pre4=|v_main_#t~pre4_79|, main_#t~pre5=|v_main_#t~pre5_94|, main_~a~0=v_main_~a~0_100, main_#t~pre6=|v_main_#t~pre6_127|} OutVars{main_~e~0=v_main_~e~0_957, main_#t~pre7=|v_main_#t~pre7_306|, main_~c~0=v_main_~c~0_184, main_#t~pre8=|v_main_#t~pre8_617|, main_~d~0=v_main_~d~0_403, main_~b~0=v_main_~b~0_133, main_#t~pre4=|v_main_#t~pre4_78|, main_#t~pre5=|v_main_#t~pre5_93|, main_~a~0=v_main_~a~0_99, main_#t~pre6=|v_main_#t~pre6_126|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {5632#(= main_~a~0 0)} is VALID [2022-04-28 04:10:49,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {5632#(= main_~a~0 0)} [113] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {5628#false} is VALID [2022-04-28 04:10:49,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {5628#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {5628#false} is VALID [2022-04-28 04:10:49,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {5628#false} assume !false; {5628#false} is VALID [2022-04-28 04:10:49,828 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 04:10:49,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:49,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024730682] [2022-04-28 04:10:49,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024730682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:49,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:49,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:50,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:50,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2079633660] [2022-04-28 04:10:50,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2079633660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:50,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:50,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 04:10:50,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283847082] [2022-04-28 04:10:50,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:50,248 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 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 46 [2022-04-28 04:10:50,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:50,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 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 04:10:50,287 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 04:10:50,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 04:10:50,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:50,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 04:10:50,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-04-28 04:10:50,288 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 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 04:10:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:51,137 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2022-04-28 04:10:51,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 04:10:51,138 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 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 46 [2022-04-28 04:10:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 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 04:10:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 105 transitions. [2022-04-28 04:10:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 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 04:10:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 105 transitions. [2022-04-28 04:10:51,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 105 transitions. [2022-04-28 04:10:51,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:51,208 INFO L225 Difference]: With dead ends: 86 [2022-04-28 04:10:51,208 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 04:10:51,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=1206, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 04:10:51,209 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 118 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:51,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 29 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 04:10:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 04:10:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2022-04-28 04:10:51,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:51,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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 04:10:51,223 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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 04:10:51,223 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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 04:10:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:51,224 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-04-28 04:10:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2022-04-28 04:10:51,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:51,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:51,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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 73 states. [2022-04-28 04:10:51,225 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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 73 states. [2022-04-28 04:10:51,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:51,225 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-04-28 04:10:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2022-04-28 04:10:51,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:51,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:51,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:51,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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 04:10:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-04-28 04:10:51,226 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 46 [2022-04-28 04:10:51,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:51,227 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-04-28 04:10:51,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 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 04:10:51,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 55 transitions. [2022-04-28 04:10:51,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:51,312 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-28 04:10:51,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 04:10:51,312 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:51,312 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:51,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 04:10:51,312 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:51,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:51,314 INFO L85 PathProgramCache]: Analyzing trace with hash -917097330, now seen corresponding path program 13 times [2022-04-28 04:10:51,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:51,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1689083305] [2022-04-28 04:10:51,534 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:51,618 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:51,725 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:51,809 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:51,923 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:52,013 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:52,125 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:52,214 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:52,337 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:52,337 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:52,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1786717879, now seen corresponding path program 1 times [2022-04-28 04:10:52,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:52,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390872217] [2022-04-28 04:10:52,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:52,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:52,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {6115#(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); {6109#true} is VALID [2022-04-28 04:10:52,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {6109#true} assume true; {6109#true} is VALID [2022-04-28 04:10:52,377 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6109#true} {6109#true} #80#return; {6109#true} is VALID [2022-04-28 04:10:52,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {6109#true} call ULTIMATE.init(); {6115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:52,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {6115#(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); {6109#true} is VALID [2022-04-28 04:10:52,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {6109#true} assume true; {6109#true} is VALID [2022-04-28 04:10:52,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6109#true} {6109#true} #80#return; {6109#true} is VALID [2022-04-28 04:10:52,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {6109#true} call #t~ret9 := main(); {6109#true} is VALID [2022-04-28 04:10:52,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {6109#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {6114#(= main_~a~0 0)} is VALID [2022-04-28 04:10:52,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {6114#(= main_~a~0 0)} [116] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_134| |v_main_#t~pre6_133|)) (.cse1 (= v_main_~b~0_143 v_main_~b~0_141)) (.cse2 (= |v_main_#t~pre8_697| |v_main_#t~pre8_685|)) (.cse3 (= v_main_~d~0_446 v_main_~d~0_443)) (.cse4 (= v_main_~a~0_106 v_main_~a~0_105)) (.cse5 (= v_main_~c~0_196 v_main_~c~0_194)) (.cse6 (= |v_main_#t~pre4_84| |v_main_#t~pre4_83|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre7_339| |v_main_#t~pre7_341|) (= v_main_~e~0_1070 v_main_~e~0_1084) .cse5 .cse6 (= |v_main_#t~pre5_99| |v_main_#t~pre5_100|)) (and (= v_main_~e~0_1084 v_main_~e~0_1070) .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre5_100| |v_main_#t~pre5_99|) .cse4 (= |v_main_#t~pre7_341| |v_main_#t~pre7_339|) .cse5 .cse6))) InVars {main_~e~0=v_main_~e~0_1084, main_#t~pre7=|v_main_#t~pre7_341|, main_~c~0=v_main_~c~0_196, main_#t~pre8=|v_main_#t~pre8_697|, main_~d~0=v_main_~d~0_446, main_~b~0=v_main_~b~0_143, main_#t~pre4=|v_main_#t~pre4_84|, main_#t~pre5=|v_main_#t~pre5_100|, main_~a~0=v_main_~a~0_106, main_#t~pre6=|v_main_#t~pre6_134|} OutVars{main_~e~0=v_main_~e~0_1070, main_#t~pre7=|v_main_#t~pre7_339|, main_~c~0=v_main_~c~0_194, main_#t~pre8=|v_main_#t~pre8_685|, main_~d~0=v_main_~d~0_443, main_~b~0=v_main_~b~0_141, main_#t~pre4=|v_main_#t~pre4_83|, main_#t~pre5=|v_main_#t~pre5_99|, main_~a~0=v_main_~a~0_105, main_#t~pre6=|v_main_#t~pre6_133|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {6114#(= main_~a~0 0)} is VALID [2022-04-28 04:10:52,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {6114#(= main_~a~0 0)} [115] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {6110#false} is VALID [2022-04-28 04:10:52,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {6110#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {6110#false} is VALID [2022-04-28 04:10:52,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {6110#false} assume !false; {6110#false} is VALID [2022-04-28 04:10:52,385 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 04:10:52,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:52,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390872217] [2022-04-28 04:10:52,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390872217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:52,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:52,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:52,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:52,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1689083305] [2022-04-28 04:10:52,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1689083305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:52,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:52,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 04:10:52,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694968908] [2022-04-28 04:10:52,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:52,764 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 48 [2022-04-28 04:10:52,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:52,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 04:10:52,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:52,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 04:10:52,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:52,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 04:10:52,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2022-04-28 04:10:52,796 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 04:10:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:53,873 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2022-04-28 04:10:53,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 04:10:53,873 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 48 [2022-04-28 04:10:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 04:10:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2022-04-28 04:10:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 04:10:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2022-04-28 04:10:53,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 105 transitions. [2022-04-28 04:10:53,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:53,964 INFO L225 Difference]: With dead ends: 87 [2022-04-28 04:10:53,964 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 04:10:53,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=1349, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 04:10:53,965 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 138 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:53,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 29 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 04:10:53,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 04:10:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 53. [2022-04-28 04:10:53,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:53,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 53 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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 04:10:53,980 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 53 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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 04:10:53,980 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 53 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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 04:10:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:53,982 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2022-04-28 04:10:53,982 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2022-04-28 04:10:53,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:53,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:53,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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 74 states. [2022-04-28 04:10:53,982 INFO L87 Difference]: Start difference. First operand has 53 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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 74 states. [2022-04-28 04:10:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:53,984 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2022-04-28 04:10:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2022-04-28 04:10:53,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:53,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:53,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:53,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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 04:10:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-04-28 04:10:53,985 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 48 [2022-04-28 04:10:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:53,985 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-04-28 04:10:53,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 04:10:53,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 57 transitions. [2022-04-28 04:10:54,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-28 04:10:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 04:10:54,090 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:54,090 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:54,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 04:10:54,091 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:54,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:54,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1449132319, now seen corresponding path program 14 times [2022-04-28 04:10:54,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:54,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1555069372] [2022-04-28 04:10:58,297 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:58,344 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:58,426 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:02,520 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:02,568 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:02,649 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:06,729 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:06,778 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:06,862 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:10,944 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:10,994 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:11,083 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:11,212 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:11,212 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:11,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1786779383, now seen corresponding path program 1 times [2022-04-28 04:11:11,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:11,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658669410] [2022-04-28 04:11:11,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:11,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:11,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:11,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {6608#(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); {6602#true} is VALID [2022-04-28 04:11:11,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {6602#true} assume true; {6602#true} is VALID [2022-04-28 04:11:11,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6602#true} {6602#true} #80#return; {6602#true} is VALID [2022-04-28 04:11:11,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {6602#true} call ULTIMATE.init(); {6608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:11,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {6608#(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); {6602#true} is VALID [2022-04-28 04:11:11,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {6602#true} assume true; {6602#true} is VALID [2022-04-28 04:11:11,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6602#true} {6602#true} #80#return; {6602#true} is VALID [2022-04-28 04:11:11,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {6602#true} call #t~ret9 := main(); {6602#true} is VALID [2022-04-28 04:11:11,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {6602#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {6607#(= main_~a~0 0)} is VALID [2022-04-28 04:11:11,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {6607#(= main_~a~0 0)} [118] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_141| |v_main_#t~pre6_140|)) (.cse1 (= v_main_~c~0_206 v_main_~c~0_204)) (.cse2 (= v_main_~a~0_112 v_main_~a~0_111)) (.cse3 (= v_main_~e~0_1203 v_main_~e~0_1188)) (.cse4 (= |v_main_#t~pre5_106| |v_main_#t~pre5_105|)) (.cse5 (= |v_main_#t~pre7_378| |v_main_#t~pre7_375|)) (.cse6 (= |v_main_#t~pre4_89| |v_main_#t~pre4_88|))) (or (and .cse0 .cse1 (= v_main_~b~0_151 v_main_~b~0_149) .cse2 .cse3 (= |v_main_#t~pre8_766| |v_main_#t~pre8_754|) .cse4 .cse5 .cse6 (= v_main_~d~0_492 v_main_~d~0_488)) (and .cse0 .cse1 (= |v_main_#t~pre8_754| |v_main_#t~pre8_766|) .cse2 (= v_main_~b~0_149 v_main_~b~0_151) .cse3 (= v_main_~d~0_488 v_main_~d~0_492) .cse4 .cse5 .cse6))) InVars {main_~e~0=v_main_~e~0_1203, main_#t~pre7=|v_main_#t~pre7_378|, main_~c~0=v_main_~c~0_206, main_#t~pre8=|v_main_#t~pre8_766|, main_~d~0=v_main_~d~0_492, main_~b~0=v_main_~b~0_151, main_#t~pre4=|v_main_#t~pre4_89|, main_#t~pre5=|v_main_#t~pre5_106|, main_~a~0=v_main_~a~0_112, main_#t~pre6=|v_main_#t~pre6_141|} OutVars{main_~e~0=v_main_~e~0_1188, main_#t~pre7=|v_main_#t~pre7_375|, main_~c~0=v_main_~c~0_204, main_#t~pre8=|v_main_#t~pre8_754|, main_~d~0=v_main_~d~0_488, main_~b~0=v_main_~b~0_149, main_#t~pre4=|v_main_#t~pre4_88|, main_#t~pre5=|v_main_#t~pre5_105|, main_~a~0=v_main_~a~0_111, main_#t~pre6=|v_main_#t~pre6_140|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {6607#(= main_~a~0 0)} is VALID [2022-04-28 04:11:11,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {6607#(= main_~a~0 0)} [117] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {6603#false} is VALID [2022-04-28 04:11:11,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {6603#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {6603#false} is VALID [2022-04-28 04:11:11,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {6603#false} assume !false; {6603#false} is VALID [2022-04-28 04:11:11,252 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 04:11:11,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:11,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658669410] [2022-04-28 04:11:11,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658669410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:11,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:11,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:11,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:11,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1555069372] [2022-04-28 04:11:11,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1555069372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:11,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:11,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 04:11:11,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727163875] [2022-04-28 04:11:11,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:11,654 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 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 51 [2022-04-28 04:11:11,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:11,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 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 04:11:11,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:11,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 04:11:11,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:11,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 04:11:11,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2022-04-28 04:11:11,687 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 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 04:11:12,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:12,930 INFO L93 Difference]: Finished difference Result 89 states and 107 transitions. [2022-04-28 04:11:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 04:11:12,930 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 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 51 [2022-04-28 04:11:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 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 04:11:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 107 transitions. [2022-04-28 04:11:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 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 04:11:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 107 transitions. [2022-04-28 04:11:12,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 107 transitions. [2022-04-28 04:11:13,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:13,018 INFO L225 Difference]: With dead ends: 89 [2022-04-28 04:11:13,018 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 04:11:13,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=306, Invalid=1500, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 04:11:13,019 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:13,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 54 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 04:11:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 04:11:13,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2022-04-28 04:11:13,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:13,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 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 04:11:13,035 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 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 04:11:13,035 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 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 04:11:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:13,036 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2022-04-28 04:11:13,036 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2022-04-28 04:11:13,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:13,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:13,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 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 76 states. [2022-04-28 04:11:13,036 INFO L87 Difference]: Start difference. First operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 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 76 states. [2022-04-28 04:11:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:13,037 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2022-04-28 04:11:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2022-04-28 04:11:13,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:13,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:13,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:13,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 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 04:11:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-28 04:11:13,038 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 51 [2022-04-28 04:11:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:13,038 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-28 04:11:13,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 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 04:11:13,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 58 transitions. [2022-04-28 04:11:13,138 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 04:11:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-28 04:11:13,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 04:11:13,139 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:13,139 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:13,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 04:11:13,139 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:13,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:13,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1980622781, now seen corresponding path program 15 times [2022-04-28 04:11:13,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:13,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2019663619] [2022-04-28 04:11:13,400 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:13,489 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:13,606 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:13,691 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:13,810 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:13,914 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:14,041 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:14,132 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:14,265 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:14,265 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:14,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1786840887, now seen corresponding path program 1 times [2022-04-28 04:11:14,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:14,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587706959] [2022-04-28 04:11:14,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:14,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:14,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:14,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {7114#(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); {7108#true} is VALID [2022-04-28 04:11:14,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {7108#true} assume true; {7108#true} is VALID [2022-04-28 04:11:14,299 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7108#true} {7108#true} #80#return; {7108#true} is VALID [2022-04-28 04:11:14,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {7108#true} call ULTIMATE.init(); {7114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:14,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {7114#(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); {7108#true} is VALID [2022-04-28 04:11:14,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {7108#true} assume true; {7108#true} is VALID [2022-04-28 04:11:14,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7108#true} {7108#true} #80#return; {7108#true} is VALID [2022-04-28 04:11:14,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {7108#true} call #t~ret9 := main(); {7108#true} is VALID [2022-04-28 04:11:14,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {7108#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {7113#(= main_~a~0 0)} is VALID [2022-04-28 04:11:14,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {7113#(= main_~a~0 0)} [120] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_118 v_main_~a~0_117)) (.cse1 (= |v_main_#t~pre6_148| |v_main_#t~pre6_147|)) (.cse2 (= v_main_~c~0_216 v_main_~c~0_214)) (.cse3 (= v_main_~b~0_159 v_main_~b~0_157)) (.cse4 (= |v_main_#t~pre7_415| |v_main_#t~pre7_412|)) (.cse5 (= |v_main_#t~pre4_94| |v_main_#t~pre4_93|)) (.cse6 (= |v_main_#t~pre5_112| |v_main_#t~pre5_111|))) (or (and (= v_main_~d~0_538 v_main_~d~0_534) .cse0 .cse1 .cse2 (= |v_main_#t~pre8_839| |v_main_#t~pre8_826|) .cse3 .cse4 .cse5 .cse6 (= v_main_~e~0_1327 v_main_~e~0_1311)) (and (= v_main_~d~0_534 v_main_~d~0_538) .cse0 .cse1 .cse2 (= |v_main_#t~pre8_826| |v_main_#t~pre8_839|) .cse3 .cse4 .cse5 (= v_main_~e~0_1311 v_main_~e~0_1327) .cse6))) InVars {main_~e~0=v_main_~e~0_1327, main_#t~pre7=|v_main_#t~pre7_415|, main_~c~0=v_main_~c~0_216, main_#t~pre8=|v_main_#t~pre8_839|, main_~d~0=v_main_~d~0_538, main_~b~0=v_main_~b~0_159, main_#t~pre4=|v_main_#t~pre4_94|, main_#t~pre5=|v_main_#t~pre5_112|, main_~a~0=v_main_~a~0_118, main_#t~pre6=|v_main_#t~pre6_148|} OutVars{main_~e~0=v_main_~e~0_1311, main_#t~pre7=|v_main_#t~pre7_412|, main_~c~0=v_main_~c~0_214, main_#t~pre8=|v_main_#t~pre8_826|, main_~d~0=v_main_~d~0_534, main_~b~0=v_main_~b~0_157, main_#t~pre4=|v_main_#t~pre4_93|, main_#t~pre5=|v_main_#t~pre5_111|, main_~a~0=v_main_~a~0_117, main_#t~pre6=|v_main_#t~pre6_147|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {7113#(= main_~a~0 0)} is VALID [2022-04-28 04:11:14,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {7113#(= main_~a~0 0)} [119] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {7109#false} is VALID [2022-04-28 04:11:14,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {7109#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {7109#false} is VALID [2022-04-28 04:11:14,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {7109#false} assume !false; {7109#false} is VALID [2022-04-28 04:11:14,301 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 04:11:14,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:14,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587706959] [2022-04-28 04:11:14,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587706959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:14,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:14,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:14,761 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:14,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2019663619] [2022-04-28 04:11:14,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2019663619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:14,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:14,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 04:11:14,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015089222] [2022-04-28 04:11:14,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:14,762 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 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 53 [2022-04-28 04:11:14,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:14,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 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 04:11:14,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:14,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 04:11:14,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:14,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 04:11:14,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2022-04-28 04:11:14,797 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 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 04:11:15,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:15,980 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2022-04-28 04:11:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 04:11:15,980 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 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 53 [2022-04-28 04:11:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 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 04:11:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 109 transitions. [2022-04-28 04:11:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 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 04:11:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 109 transitions. [2022-04-28 04:11:15,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 109 transitions. [2022-04-28 04:11:16,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:16,055 INFO L225 Difference]: With dead ends: 91 [2022-04-28 04:11:16,055 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 04:11:16,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=321, Invalid=1659, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 04:11:16,056 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 137 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:16,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 34 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 04:11:16,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 04:11:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2022-04-28 04:11:16,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:16,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 56 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 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 04:11:16,079 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 56 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 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 04:11:16,079 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 56 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 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 04:11:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:16,080 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-04-28 04:11:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-04-28 04:11:16,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:16,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:16,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 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 78 states. [2022-04-28 04:11:16,080 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 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 78 states. [2022-04-28 04:11:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:16,081 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-04-28 04:11:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-04-28 04:11:16,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:16,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:16,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:16,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 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 04:11:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-28 04:11:16,082 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 53 [2022-04-28 04:11:16,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:16,082 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-28 04:11:16,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 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 04:11:16,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2022-04-28 04:11:16,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-28 04:11:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 04:11:16,172 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:16,172 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:16,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 04:11:16,172 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:16,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:16,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1641848539, now seen corresponding path program 16 times [2022-04-28 04:11:16,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:16,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1430360380] [2022-04-28 04:11:20,375 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:20,424 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:20,509 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:24,597 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:24,648 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:24,736 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:28,828 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:28,877 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:28,965 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:33,063 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:33,114 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:33,201 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:33,338 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:33,338 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:33,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1786902391, now seen corresponding path program 1 times [2022-04-28 04:11:33,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:33,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850908789] [2022-04-28 04:11:33,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:33,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:33,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {7635#(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); {7629#true} is VALID [2022-04-28 04:11:33,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {7629#true} assume true; {7629#true} is VALID [2022-04-28 04:11:33,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7629#true} {7629#true} #80#return; {7629#true} is VALID [2022-04-28 04:11:33,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {7629#true} call ULTIMATE.init(); {7635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:33,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {7635#(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); {7629#true} is VALID [2022-04-28 04:11:33,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {7629#true} assume true; {7629#true} is VALID [2022-04-28 04:11:33,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7629#true} {7629#true} #80#return; {7629#true} is VALID [2022-04-28 04:11:33,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {7629#true} call #t~ret9 := main(); {7629#true} is VALID [2022-04-28 04:11:33,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {7629#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {7634#(= main_~a~0 0)} is VALID [2022-04-28 04:11:33,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {7634#(= main_~a~0 0)} [122] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_124 v_main_~a~0_123)) (.cse1 (= v_main_~e~0_1456 v_main_~e~0_1439)) (.cse2 (= |v_main_#t~pre7_452| |v_main_#t~pre7_449|)) (.cse3 (= v_main_~d~0_584 v_main_~d~0_580)) (.cse4 (= |v_main_#t~pre4_99| |v_main_#t~pre4_98|)) (.cse5 (= v_main_~b~0_167 v_main_~b~0_165)) (.cse6 (= |v_main_#t~pre5_118| |v_main_#t~pre5_117|)) (.cse7 (= v_main_~c~0_226 v_main_~c~0_224)) (.cse8 (= |v_main_#t~pre6_155| |v_main_#t~pre6_154|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |v_main_#t~pre8_916| |v_main_#t~pre8_902|) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |v_main_#t~pre8_902| |v_main_#t~pre8_916|) .cse7 .cse8))) InVars {main_~e~0=v_main_~e~0_1456, main_#t~pre7=|v_main_#t~pre7_452|, main_~c~0=v_main_~c~0_226, main_#t~pre8=|v_main_#t~pre8_916|, main_~d~0=v_main_~d~0_584, main_~b~0=v_main_~b~0_167, main_#t~pre4=|v_main_#t~pre4_99|, main_#t~pre5=|v_main_#t~pre5_118|, main_~a~0=v_main_~a~0_124, main_#t~pre6=|v_main_#t~pre6_155|} OutVars{main_~e~0=v_main_~e~0_1439, main_#t~pre7=|v_main_#t~pre7_449|, main_~c~0=v_main_~c~0_224, main_#t~pre8=|v_main_#t~pre8_902|, main_~d~0=v_main_~d~0_580, main_~b~0=v_main_~b~0_165, main_#t~pre4=|v_main_#t~pre4_98|, main_#t~pre5=|v_main_#t~pre5_117|, main_~a~0=v_main_~a~0_123, main_#t~pre6=|v_main_#t~pre6_154|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {7634#(= main_~a~0 0)} is VALID [2022-04-28 04:11:33,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {7634#(= main_~a~0 0)} [121] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {7630#false} is VALID [2022-04-28 04:11:33,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {7630#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {7630#false} is VALID [2022-04-28 04:11:33,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {7630#false} assume !false; {7630#false} is VALID [2022-04-28 04:11:33,374 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 04:11:33,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:33,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850908789] [2022-04-28 04:11:33,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850908789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:33,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:33,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:33,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:33,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1430360380] [2022-04-28 04:11:33,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1430360380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:33,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:33,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 04:11:33,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687838428] [2022-04-28 04:11:33,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:33,888 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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 55 [2022-04-28 04:11:33,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:33,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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 04:11:33,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:33,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 04:11:33,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:33,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 04:11:33,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-04-28 04:11:33,924 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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 04:11:35,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:35,352 INFO L93 Difference]: Finished difference Result 93 states and 111 transitions. [2022-04-28 04:11:35,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 04:11:35,352 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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 55 [2022-04-28 04:11:35,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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 04:11:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 111 transitions. [2022-04-28 04:11:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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 04:11:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 111 transitions. [2022-04-28 04:11:35,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 111 transitions. [2022-04-28 04:11:35,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:35,444 INFO L225 Difference]: With dead ends: 93 [2022-04-28 04:11:35,444 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 04:11:35,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=336, Invalid=1826, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 04:11:35,445 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 132 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:35,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 59 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 04:11:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 04:11:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 58. [2022-04-28 04:11:35,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:35,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 58 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 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 04:11:35,464 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 58 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 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 04:11:35,464 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 58 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 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 04:11:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:35,465 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-04-28 04:11:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2022-04-28 04:11:35,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:35,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:35,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 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 80 states. [2022-04-28 04:11:35,465 INFO L87 Difference]: Start difference. First operand has 58 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 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 80 states. [2022-04-28 04:11:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:35,466 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-04-28 04:11:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2022-04-28 04:11:35,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:35,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:35,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:35,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 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 04:11:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-04-28 04:11:35,468 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 55 [2022-04-28 04:11:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:35,468 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-04-28 04:11:35,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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 04:11:35,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 62 transitions. [2022-04-28 04:11:35,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-28 04:11:35,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 04:11:35,573 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:35,573 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:35,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 04:11:35,573 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:35,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:35,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1797650823, now seen corresponding path program 17 times [2022-04-28 04:11:35,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:35,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [971920265] [2022-04-28 04:11:35,807 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:35,895 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:36,006 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:36,095 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:36,201 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:36,288 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:36,394 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:36,491 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:36,674 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:36,674 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:36,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1786963895, now seen corresponding path program 1 times [2022-04-28 04:11:36,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:36,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67834963] [2022-04-28 04:11:36,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:36,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:36,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:36,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {8171#(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); {8165#true} is VALID [2022-04-28 04:11:36,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {8165#true} assume true; {8165#true} is VALID [2022-04-28 04:11:36,699 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8165#true} {8165#true} #80#return; {8165#true} is VALID [2022-04-28 04:11:36,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {8165#true} call ULTIMATE.init(); {8171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:36,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {8171#(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); {8165#true} is VALID [2022-04-28 04:11:36,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {8165#true} assume true; {8165#true} is VALID [2022-04-28 04:11:36,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8165#true} {8165#true} #80#return; {8165#true} is VALID [2022-04-28 04:11:36,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {8165#true} call #t~ret9 := main(); {8165#true} is VALID [2022-04-28 04:11:36,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {8165#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {8170#(= main_~a~0 0)} is VALID [2022-04-28 04:11:36,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {8170#(= main_~a~0 0)} [124] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_175 v_main_~b~0_173)) (.cse1 (= v_main_~c~0_236 v_main_~c~0_234)) (.cse2 (= |v_main_#t~pre4_104| |v_main_#t~pre4_103|)) (.cse3 (= v_main_~e~0_1590 v_main_~e~0_1572)) (.cse4 (= |v_main_#t~pre6_162| |v_main_#t~pre6_161|)) (.cse5 (= |v_main_#t~pre5_124| |v_main_#t~pre5_123|)) (.cse6 (= |v_main_#t~pre7_489| |v_main_#t~pre7_486|)) (.cse7 (= |v_main_#t~pre8_997| |v_main_#t~pre8_982|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~d~0_630 v_main_~d~0_626) .cse5 .cse6 .cse7 (= v_main_~a~0_130 v_main_~a~0_129)) (and .cse0 .cse1 (= v_main_~d~0_626 v_main_~d~0_630) (= v_main_~a~0_129 v_main_~a~0_130) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_1590, main_#t~pre7=|v_main_#t~pre7_489|, main_~c~0=v_main_~c~0_236, main_#t~pre8=|v_main_#t~pre8_997|, main_~d~0=v_main_~d~0_630, main_~b~0=v_main_~b~0_175, main_#t~pre4=|v_main_#t~pre4_104|, main_#t~pre5=|v_main_#t~pre5_124|, main_~a~0=v_main_~a~0_130, main_#t~pre6=|v_main_#t~pre6_162|} OutVars{main_~e~0=v_main_~e~0_1572, main_#t~pre7=|v_main_#t~pre7_486|, main_~c~0=v_main_~c~0_234, main_#t~pre8=|v_main_#t~pre8_982|, main_~d~0=v_main_~d~0_626, main_~b~0=v_main_~b~0_173, main_#t~pre4=|v_main_#t~pre4_103|, main_#t~pre5=|v_main_#t~pre5_123|, main_~a~0=v_main_~a~0_129, main_#t~pre6=|v_main_#t~pre6_161|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {8170#(= main_~a~0 0)} is VALID [2022-04-28 04:11:36,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {8170#(= main_~a~0 0)} [123] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {8166#false} is VALID [2022-04-28 04:11:36,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {8166#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {8166#false} is VALID [2022-04-28 04:11:36,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {8166#false} assume !false; {8166#false} is VALID [2022-04-28 04:11:36,701 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 04:11:36,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:36,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67834963] [2022-04-28 04:11:36,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67834963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:36,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:36,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:37,151 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:37,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [971920265] [2022-04-28 04:11:37,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [971920265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:37,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:37,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 04:11:37,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696458514] [2022-04-28 04:11:37,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:37,152 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 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 57 [2022-04-28 04:11:37,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:37,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 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 04:11:37,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:37,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 04:11:37,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:37,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 04:11:37,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-04-28 04:11:37,199 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 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 04:11:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:38,582 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2022-04-28 04:11:38,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 04:11:38,582 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 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 57 [2022-04-28 04:11:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 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 04:11:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 113 transitions. [2022-04-28 04:11:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 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 04:11:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 113 transitions. [2022-04-28 04:11:38,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 113 transitions. [2022-04-28 04:11:38,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:38,688 INFO L225 Difference]: With dead ends: 95 [2022-04-28 04:11:38,688 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 04:11:38,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=2001, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 04:11:38,690 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 135 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:38,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 29 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 04:11:38,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 04:11:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2022-04-28 04:11:38,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:38,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 60 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 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 04:11:38,712 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 60 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 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 04:11:38,712 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 60 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 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 04:11:38,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:38,714 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-04-28 04:11:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2022-04-28 04:11:38,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:38,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:38,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 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 82 states. [2022-04-28 04:11:38,715 INFO L87 Difference]: Start difference. First operand has 60 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 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 82 states. [2022-04-28 04:11:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:38,716 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-04-28 04:11:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2022-04-28 04:11:38,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:38,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:38,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:38,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 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 04:11:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-04-28 04:11:38,717 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 57 [2022-04-28 04:11:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:38,717 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-04-28 04:11:38,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 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 04:11:38,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 64 transitions. [2022-04-28 04:11:38,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-28 04:11:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 04:11:38,820 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:38,820 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:38,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 04:11:38,820 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:38,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:38,820 INFO L85 PathProgramCache]: Analyzing trace with hash -31719785, now seen corresponding path program 18 times [2022-04-28 04:11:38,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:38,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [590766018] [2022-04-28 04:11:39,063 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:39,145 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:39,262 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:39,345 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:39,463 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:39,555 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:39,676 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:39,767 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:39,907 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:39,907 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:39,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1787025399, now seen corresponding path program 1 times [2022-04-28 04:11:39,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:39,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345065109] [2022-04-28 04:11:39,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:39,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:39,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:39,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {8722#(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); {8716#true} is VALID [2022-04-28 04:11:39,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {8716#true} assume true; {8716#true} is VALID [2022-04-28 04:11:39,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8716#true} {8716#true} #80#return; {8716#true} is VALID [2022-04-28 04:11:39,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {8716#true} call ULTIMATE.init(); {8722#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:39,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {8722#(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); {8716#true} is VALID [2022-04-28 04:11:39,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {8716#true} assume true; {8716#true} is VALID [2022-04-28 04:11:39,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8716#true} {8716#true} #80#return; {8716#true} is VALID [2022-04-28 04:11:39,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {8716#true} call #t~ret9 := main(); {8716#true} is VALID [2022-04-28 04:11:39,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {8716#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {8721#(= main_~a~0 0)} is VALID [2022-04-28 04:11:39,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {8721#(= main_~a~0 0)} [126] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_136 v_main_~a~0_135)) (.cse1 (= |v_main_#t~pre4_109| |v_main_#t~pre4_108|)) (.cse2 (= |v_main_#t~pre8_1082| |v_main_#t~pre8_1066|)) (.cse3 (= |v_main_#t~pre7_526| |v_main_#t~pre7_523|)) (.cse4 (= v_main_~d~0_676 v_main_~d~0_672)) (.cse5 (= |v_main_#t~pre5_130| |v_main_#t~pre5_129|)) (.cse6 (= v_main_~b~0_183 v_main_~b~0_181)) (.cse7 (= |v_main_#t~pre6_169| |v_main_#t~pre6_168|)) (.cse8 (= v_main_~c~0_246 v_main_~c~0_244))) (or (and .cse0 (= v_main_~e~0_1729 v_main_~e~0_1710) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~e~0_1710 v_main_~e~0_1729) .cse8))) InVars {main_~e~0=v_main_~e~0_1729, main_#t~pre7=|v_main_#t~pre7_526|, main_~c~0=v_main_~c~0_246, main_#t~pre8=|v_main_#t~pre8_1082|, main_~d~0=v_main_~d~0_676, main_~b~0=v_main_~b~0_183, main_#t~pre4=|v_main_#t~pre4_109|, main_#t~pre5=|v_main_#t~pre5_130|, main_~a~0=v_main_~a~0_136, main_#t~pre6=|v_main_#t~pre6_169|} OutVars{main_~e~0=v_main_~e~0_1710, main_#t~pre7=|v_main_#t~pre7_523|, main_~c~0=v_main_~c~0_244, main_#t~pre8=|v_main_#t~pre8_1066|, main_~d~0=v_main_~d~0_672, main_~b~0=v_main_~b~0_181, main_#t~pre4=|v_main_#t~pre4_108|, main_#t~pre5=|v_main_#t~pre5_129|, main_~a~0=v_main_~a~0_135, main_#t~pre6=|v_main_#t~pre6_168|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {8721#(= main_~a~0 0)} is VALID [2022-04-28 04:11:39,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {8721#(= main_~a~0 0)} [125] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {8717#false} is VALID [2022-04-28 04:11:39,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {8717#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {8717#false} is VALID [2022-04-28 04:11:39,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {8717#false} assume !false; {8717#false} is VALID [2022-04-28 04:11:39,952 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 04:11:39,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:39,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345065109] [2022-04-28 04:11:39,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345065109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:39,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:39,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:40,513 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:40,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [590766018] [2022-04-28 04:11:40,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [590766018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:40,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:40,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 04:11:40,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086823521] [2022-04-28 04:11:40,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:40,514 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 26 states have internal predecessors, (56), 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 59 [2022-04-28 04:11:40,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:40,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 26 states have internal predecessors, (56), 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 04:11:40,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:40,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 04:11:40,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:40,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 04:11:40,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2022-04-28 04:11:40,552 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 26 states have internal predecessors, (56), 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 04:11:42,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:42,273 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2022-04-28 04:11:42,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 04:11:42,273 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 26 states have internal predecessors, (56), 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 59 [2022-04-28 04:11:42,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 26 states have internal predecessors, (56), 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 04:11:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 115 transitions. [2022-04-28 04:11:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 26 states have internal predecessors, (56), 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 04:11:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 115 transitions. [2022-04-28 04:11:42,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 115 transitions. [2022-04-28 04:11:42,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:42,372 INFO L225 Difference]: With dead ends: 97 [2022-04-28 04:11:42,372 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 04:11:42,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=366, Invalid=2184, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 04:11:42,373 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 153 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:42,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 49 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 04:11:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 04:11:42,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2022-04-28 04:11:42,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:42,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 62 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 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 04:11:42,398 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 62 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 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 04:11:42,398 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 62 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 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 04:11:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:42,399 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-04-28 04:11:42,399 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2022-04-28 04:11:42,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:42,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:42,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 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 04:11:42,400 INFO L87 Difference]: Start difference. First operand has 62 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 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 04:11:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:42,400 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-04-28 04:11:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2022-04-28 04:11:42,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:42,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:42,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:42,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 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 04:11:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-04-28 04:11:42,401 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 59 [2022-04-28 04:11:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:42,402 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-04-28 04:11:42,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 26 states have internal predecessors, (56), 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 04:11:42,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 66 transitions. [2022-04-28 04:11:42,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:42,519 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-28 04:11:42,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 04:11:42,519 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:42,519 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:42,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 04:11:42,519 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:42,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:42,520 INFO L85 PathProgramCache]: Analyzing trace with hash 515925813, now seen corresponding path program 19 times [2022-04-28 04:11:42,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:42,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [440307843] [2022-04-28 04:11:46,731 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:46,779 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:46,871 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:50,952 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:51,000 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:51,086 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:55,167 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:55,215 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:55,297 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:59,376 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:59,423 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:59,508 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:59,678 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:59,678 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:59,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1787086903, now seen corresponding path program 1 times [2022-04-28 04:11:59,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:59,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113392645] [2022-04-28 04:11:59,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:59,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:59,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:59,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {9288#(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); {9282#true} is VALID [2022-04-28 04:11:59,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {9282#true} assume true; {9282#true} is VALID [2022-04-28 04:11:59,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9282#true} {9282#true} #80#return; {9282#true} is VALID [2022-04-28 04:11:59,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {9282#true} call ULTIMATE.init(); {9288#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:59,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {9288#(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); {9282#true} is VALID [2022-04-28 04:11:59,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {9282#true} assume true; {9282#true} is VALID [2022-04-28 04:11:59,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9282#true} {9282#true} #80#return; {9282#true} is VALID [2022-04-28 04:11:59,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {9282#true} call #t~ret9 := main(); {9282#true} is VALID [2022-04-28 04:11:59,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {9282#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {9287#(= main_~a~0 0)} is VALID [2022-04-28 04:11:59,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {9287#(= main_~a~0 0)} [128] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_256 v_main_~c~0_254)) (.cse1 (= |v_main_#t~pre5_136| |v_main_#t~pre5_135|)) (.cse2 (= |v_main_#t~pre8_1171| |v_main_#t~pre8_1154|)) (.cse3 (= v_main_~e~0_1873 v_main_~e~0_1853)) (.cse4 (= |v_main_#t~pre4_114| |v_main_#t~pre4_113|)) (.cse5 (= v_main_~a~0_142 v_main_~a~0_141)) (.cse6 (= |v_main_#t~pre7_563| |v_main_#t~pre7_560|)) (.cse7 (= |v_main_#t~pre6_176| |v_main_#t~pre6_175|)) (.cse8 (= v_main_~d~0_722 v_main_~d~0_718))) (or (and .cse0 .cse1 .cse2 (= v_main_~b~0_191 v_main_~b~0_189) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= v_main_~b~0_189 v_main_~b~0_191) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) InVars {main_~e~0=v_main_~e~0_1873, main_#t~pre7=|v_main_#t~pre7_563|, main_~c~0=v_main_~c~0_256, main_#t~pre8=|v_main_#t~pre8_1171|, main_~d~0=v_main_~d~0_722, main_~b~0=v_main_~b~0_191, main_#t~pre4=|v_main_#t~pre4_114|, main_#t~pre5=|v_main_#t~pre5_136|, main_~a~0=v_main_~a~0_142, main_#t~pre6=|v_main_#t~pre6_176|} OutVars{main_~e~0=v_main_~e~0_1853, main_#t~pre7=|v_main_#t~pre7_560|, main_~c~0=v_main_~c~0_254, main_#t~pre8=|v_main_#t~pre8_1154|, main_~d~0=v_main_~d~0_718, main_~b~0=v_main_~b~0_189, main_#t~pre4=|v_main_#t~pre4_113|, main_#t~pre5=|v_main_#t~pre5_135|, main_~a~0=v_main_~a~0_141, main_#t~pre6=|v_main_#t~pre6_175|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {9287#(= main_~a~0 0)} is VALID [2022-04-28 04:11:59,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {9287#(= main_~a~0 0)} [127] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {9283#false} is VALID [2022-04-28 04:11:59,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {9283#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {9283#false} is VALID [2022-04-28 04:11:59,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {9283#false} assume !false; {9283#false} is VALID [2022-04-28 04:11:59,708 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 04:11:59,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:59,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113392645] [2022-04-28 04:11:59,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113392645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:59,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:59,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:00,245 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:00,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [440307843] [2022-04-28 04:12:00,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [440307843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:00,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:00,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 04:12:00,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287289582] [2022-04-28 04:12:00,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:00,246 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 27 states have internal predecessors, (58), 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 61 [2022-04-28 04:12:00,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:00,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 27 states have internal predecessors, (58), 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 04:12:00,285 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-28 04:12:00,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 04:12:00,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:00,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 04:12:00,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2022-04-28 04:12:00,286 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 27 states have internal predecessors, (58), 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 04:12:01,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:01,923 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2022-04-28 04:12:01,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 04:12:01,923 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 27 states have internal predecessors, (58), 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 61 [2022-04-28 04:12:01,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 27 states have internal predecessors, (58), 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 04:12:01,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-28 04:12:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 27 states have internal predecessors, (58), 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 04:12:01,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2022-04-28 04:12:01,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 120 transitions. [2022-04-28 04:12:02,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:02,015 INFO L225 Difference]: With dead ends: 101 [2022-04-28 04:12:02,015 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 04:12:02,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=381, Invalid=2375, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 04:12:02,017 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 176 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:02,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 44 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 04:12:02,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 04:12:02,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2022-04-28 04:12:02,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:02,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 66 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 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 04:12:02,040 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 66 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 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 04:12:02,040 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 66 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 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 04:12:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:02,041 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2022-04-28 04:12:02,041 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2022-04-28 04:12:02,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:02,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:02,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 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 88 states. [2022-04-28 04:12:02,041 INFO L87 Difference]: Start difference. First operand has 66 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 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 88 states. [2022-04-28 04:12:02,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:02,042 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2022-04-28 04:12:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2022-04-28 04:12:02,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:02,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:02,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:02,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 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 04:12:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-04-28 04:12:02,043 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 61 [2022-04-28 04:12:02,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:02,043 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-04-28 04:12:02,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 27 states have internal predecessors, (58), 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 04:12:02,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 70 transitions. [2022-04-28 04:12:02,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-28 04:12:02,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 04:12:02,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:02,164 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:02,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 04:12:02,164 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:02,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:02,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1477631917, now seen corresponding path program 20 times [2022-04-28 04:12:02,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:02,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [253140368] [2022-04-28 04:12:02,406 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:02,488 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:02,603 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:02,683 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:02,805 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:02,889 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:03,006 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:03,089 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:03,226 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:03,226 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1787148407, now seen corresponding path program 1 times [2022-04-28 04:12:03,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:03,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427135678] [2022-04-28 04:12:03,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:03,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:03,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:03,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {9881#(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); {9875#true} is VALID [2022-04-28 04:12:03,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {9875#true} assume true; {9875#true} is VALID [2022-04-28 04:12:03,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9875#true} {9875#true} #80#return; {9875#true} is VALID [2022-04-28 04:12:03,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {9875#true} call ULTIMATE.init(); {9881#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:03,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {9881#(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); {9875#true} is VALID [2022-04-28 04:12:03,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {9875#true} assume true; {9875#true} is VALID [2022-04-28 04:12:03,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9875#true} {9875#true} #80#return; {9875#true} is VALID [2022-04-28 04:12:03,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {9875#true} call #t~ret9 := main(); {9875#true} is VALID [2022-04-28 04:12:03,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {9875#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {9880#(= main_~a~0 0)} is VALID [2022-04-28 04:12:03,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {9880#(= main_~a~0 0)} [130] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_766 v_main_~d~0_762)) (.cse1 (= v_main_~c~0_266 v_main_~c~0_264)) (.cse2 (= v_main_~b~0_199 v_main_~b~0_197)) (.cse3 (= v_main_~a~0_148 v_main_~a~0_147)) (.cse4 (= |v_main_#t~pre5_142| |v_main_#t~pre5_141|)) (.cse5 (= |v_main_#t~pre7_599| |v_main_#t~pre7_596|)) (.cse6 (= |v_main_#t~pre4_119| |v_main_#t~pre4_118|))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~pre6_183| |v_main_#t~pre6_182|) (= |v_main_#t~pre8_1258| |v_main_#t~pre8_1240|) .cse3 .cse4 (= v_main_~e~0_2015 v_main_~e~0_1994) .cse5 .cse6) (and .cse0 (= |v_main_#t~pre8_1240| |v_main_#t~pre8_1258|) .cse1 .cse2 (= v_main_~e~0_1994 v_main_~e~0_2015) .cse3 .cse4 (= |v_main_#t~pre6_182| |v_main_#t~pre6_183|) .cse5 .cse6))) InVars {main_~e~0=v_main_~e~0_2015, main_#t~pre7=|v_main_#t~pre7_599|, main_~c~0=v_main_~c~0_266, main_#t~pre8=|v_main_#t~pre8_1258|, main_~d~0=v_main_~d~0_766, main_~b~0=v_main_~b~0_199, main_#t~pre4=|v_main_#t~pre4_119|, main_#t~pre5=|v_main_#t~pre5_142|, main_~a~0=v_main_~a~0_148, main_#t~pre6=|v_main_#t~pre6_183|} OutVars{main_~e~0=v_main_~e~0_1994, main_#t~pre7=|v_main_#t~pre7_596|, main_~c~0=v_main_~c~0_264, main_#t~pre8=|v_main_#t~pre8_1240|, main_~d~0=v_main_~d~0_762, main_~b~0=v_main_~b~0_197, main_#t~pre4=|v_main_#t~pre4_118|, main_#t~pre5=|v_main_#t~pre5_141|, main_~a~0=v_main_~a~0_147, main_#t~pre6=|v_main_#t~pre6_182|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {9880#(= main_~a~0 0)} is VALID [2022-04-28 04:12:03,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {9880#(= main_~a~0 0)} [129] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {9876#false} is VALID [2022-04-28 04:12:03,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {9876#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {9876#false} is VALID [2022-04-28 04:12:03,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {9876#false} assume !false; {9876#false} is VALID [2022-04-28 04:12:03,271 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 04:12:03,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:03,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427135678] [2022-04-28 04:12:03,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427135678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:03,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:03,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:03,896 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:03,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [253140368] [2022-04-28 04:12:03,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [253140368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:03,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:03,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 04:12:03,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871901010] [2022-04-28 04:12:03,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:03,897 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 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 63 [2022-04-28 04:12:03,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:03,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 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 04:12:03,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:03,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 04:12:03,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:03,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 04:12:03,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2022-04-28 04:12:03,941 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 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 04:12:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:05,729 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2022-04-28 04:12:05,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 04:12:05,730 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 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 63 [2022-04-28 04:12:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 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 04:12:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 120 transitions. [2022-04-28 04:12:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 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 04:12:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 120 transitions. [2022-04-28 04:12:05,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 120 transitions. [2022-04-28 04:12:05,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:05,823 INFO L225 Difference]: With dead ends: 102 [2022-04-28 04:12:05,823 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 04:12:05,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=396, Invalid=2574, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 04:12:05,824 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 130 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:05,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 29 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 04:12:05,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 04:12:05,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2022-04-28 04:12:05,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:05,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 68 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 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 04:12:05,850 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 68 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 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 04:12:05,850 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 68 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 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 04:12:05,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:05,852 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2022-04-28 04:12:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2022-04-28 04:12:05,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:05,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:05,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 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 89 states. [2022-04-28 04:12:05,852 INFO L87 Difference]: Start difference. First operand has 68 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 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 89 states. [2022-04-28 04:12:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:05,853 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2022-04-28 04:12:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2022-04-28 04:12:05,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:05,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:05,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:05,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 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 04:12:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-28 04:12:05,854 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 63 [2022-04-28 04:12:05,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:05,854 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-28 04:12:05,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 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 04:12:05,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2022-04-28 04:12:05,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-28 04:12:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 04:12:05,983 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:05,983 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:05,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 04:12:05,984 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:05,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1396097850, now seen corresponding path program 21 times [2022-04-28 04:12:05,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:05,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1907015216] [2022-04-28 04:12:10,209 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:10,259 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:10,346 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:14,429 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:14,477 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:14,561 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:18,648 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:18,699 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:18,782 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:20,884 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:20,932 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:21,018 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:21,166 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:21,167 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1787209911, now seen corresponding path program 1 times [2022-04-28 04:12:21,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:21,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985016832] [2022-04-28 04:12:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:21,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:21,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:21,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {10485#(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); {10479#true} is VALID [2022-04-28 04:12:21,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {10479#true} assume true; {10479#true} is VALID [2022-04-28 04:12:21,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10479#true} {10479#true} #80#return; {10479#true} is VALID [2022-04-28 04:12:21,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {10479#true} call ULTIMATE.init(); {10485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:21,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {10485#(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); {10479#true} is VALID [2022-04-28 04:12:21,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {10479#true} assume true; {10479#true} is VALID [2022-04-28 04:12:21,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10479#true} {10479#true} #80#return; {10479#true} is VALID [2022-04-28 04:12:21,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {10479#true} call #t~ret9 := main(); {10479#true} is VALID [2022-04-28 04:12:21,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {10479#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {10484#(= main_~a~0 0)} is VALID [2022-04-28 04:12:21,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {10484#(= main_~a~0 0)} [132] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_276 v_main_~c~0_274)) (.cse1 (= |v_main_#t~pre8_1345| |v_main_#t~pre8_1327|)) (.cse2 (= v_main_~e~0_2162 v_main_~e~0_2140)) (.cse3 (= |v_main_#t~pre4_124| |v_main_#t~pre4_123|)) (.cse4 (= v_main_~b~0_207 v_main_~b~0_205)) (.cse5 (= |v_main_#t~pre5_148| |v_main_#t~pre5_147|)) (.cse6 (= |v_main_#t~pre6_190| |v_main_#t~pre6_189|)) (.cse7 (= v_main_~a~0_154 v_main_~a~0_153))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre7_639| |v_main_#t~pre7_635|) .cse6 (= v_main_~d~0_816 v_main_~d~0_811) .cse7) (and (= v_main_~d~0_811 v_main_~d~0_816) .cse0 (= |v_main_#t~pre7_635| |v_main_#t~pre7_639|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_2162, main_#t~pre7=|v_main_#t~pre7_639|, main_~c~0=v_main_~c~0_276, main_#t~pre8=|v_main_#t~pre8_1345|, main_~d~0=v_main_~d~0_816, main_~b~0=v_main_~b~0_207, main_#t~pre4=|v_main_#t~pre4_124|, main_#t~pre5=|v_main_#t~pre5_148|, main_~a~0=v_main_~a~0_154, main_#t~pre6=|v_main_#t~pre6_190|} OutVars{main_~e~0=v_main_~e~0_2140, main_#t~pre7=|v_main_#t~pre7_635|, main_~c~0=v_main_~c~0_274, main_#t~pre8=|v_main_#t~pre8_1327|, main_~d~0=v_main_~d~0_811, main_~b~0=v_main_~b~0_205, main_#t~pre4=|v_main_#t~pre4_123|, main_#t~pre5=|v_main_#t~pre5_147|, main_~a~0=v_main_~a~0_153, main_#t~pre6=|v_main_#t~pre6_189|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {10484#(= main_~a~0 0)} is VALID [2022-04-28 04:12:21,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {10484#(= main_~a~0 0)} [131] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {10480#false} is VALID [2022-04-28 04:12:21,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {10480#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {10480#false} is VALID [2022-04-28 04:12:21,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {10480#false} assume !false; {10480#false} is VALID [2022-04-28 04:12:21,200 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 04:12:21,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:21,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985016832] [2022-04-28 04:12:21,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985016832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:21,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:21,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:21,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:21,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1907015216] [2022-04-28 04:12:21,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1907015216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:21,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:21,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 04:12:21,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857479472] [2022-04-28 04:12:21,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:21,893 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 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 66 [2022-04-28 04:12:21,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:21,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 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 04:12:21,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:21,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 04:12:21,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:21,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 04:12:21,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2022-04-28 04:12:21,935 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 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 04:12:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:23,860 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2022-04-28 04:12:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 04:12:23,860 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 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 66 [2022-04-28 04:12:23,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 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 04:12:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 122 transitions. [2022-04-28 04:12:23,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 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 04:12:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 122 transitions. [2022-04-28 04:12:23,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 122 transitions. [2022-04-28 04:12:23,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:23,951 INFO L225 Difference]: With dead ends: 104 [2022-04-28 04:12:23,951 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 04:12:23,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 25 SyntacticMatches, 14 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=411, Invalid=2781, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 04:12:23,952 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 179 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:23,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 49 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 04:12:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 04:12:23,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2022-04-28 04:12:23,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:23,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 69 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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 04:12:23,978 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 69 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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 04:12:23,978 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 69 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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 04:12:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:23,979 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-04-28 04:12:23,979 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2022-04-28 04:12:23,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:23,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:23,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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 91 states. [2022-04-28 04:12:23,980 INFO L87 Difference]: Start difference. First operand has 69 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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 91 states. [2022-04-28 04:12:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:23,980 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-04-28 04:12:23,981 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2022-04-28 04:12:23,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:23,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:23,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:23,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:23,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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 04:12:23,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-04-28 04:12:23,982 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 66 [2022-04-28 04:12:23,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:23,982 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-04-28 04:12:23,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 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 04:12:23,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 73 transitions. [2022-04-28 04:12:24,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:24,110 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-28 04:12:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 04:12:24,111 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:24,111 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:24,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 04:12:24,111 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:24,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:24,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1740861672, now seen corresponding path program 22 times [2022-04-28 04:12:24,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:24,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [909582725] [2022-04-28 04:12:27,343 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:27,402 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:27,483 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:31,569 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:31,618 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:31,709 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:34,686 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:34,732 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:34,812 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:37,794 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:37,840 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:37,923 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:38,068 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:38,068 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:38,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1787271415, now seen corresponding path program 1 times [2022-04-28 04:12:38,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:38,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203380835] [2022-04-28 04:12:38,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:38,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:38,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:38,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {11102#(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); {11096#true} is VALID [2022-04-28 04:12:38,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {11096#true} assume true; {11096#true} is VALID [2022-04-28 04:12:38,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11096#true} {11096#true} #80#return; {11096#true} is VALID [2022-04-28 04:12:38,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {11096#true} call ULTIMATE.init(); {11102#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:38,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {11102#(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); {11096#true} is VALID [2022-04-28 04:12:38,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {11096#true} assume true; {11096#true} is VALID [2022-04-28 04:12:38,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11096#true} {11096#true} #80#return; {11096#true} is VALID [2022-04-28 04:12:38,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {11096#true} call #t~ret9 := main(); {11096#true} is VALID [2022-04-28 04:12:38,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {11096#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {11101#(= main_~a~0 0)} is VALID [2022-04-28 04:12:38,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {11101#(= main_~a~0 0)} [134] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_129| |v_main_#t~pre4_128|)) (.cse1 (= |v_main_#t~pre7_679| |v_main_#t~pre7_675|)) (.cse2 (= v_main_~c~0_286 v_main_~c~0_284)) (.cse3 (= v_main_~b~0_215 v_main_~b~0_213)) (.cse4 (= |v_main_#t~pre6_197| |v_main_#t~pre6_196|)) (.cse5 (= v_main_~d~0_866 v_main_~d~0_861)) (.cse6 (= |v_main_#t~pre8_1436| |v_main_#t~pre8_1417|)) (.cse7 (= v_main_~e~0_2314 v_main_~e~0_2291)) (.cse8 (= |v_main_#t~pre5_154| |v_main_#t~pre5_153|))) (or (and .cse0 .cse1 .cse2 (= v_main_~a~0_159 v_main_~a~0_160) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= v_main_~a~0_160 v_main_~a~0_159) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) InVars {main_~e~0=v_main_~e~0_2314, main_#t~pre7=|v_main_#t~pre7_679|, main_~c~0=v_main_~c~0_286, main_#t~pre8=|v_main_#t~pre8_1436|, main_~d~0=v_main_~d~0_866, main_~b~0=v_main_~b~0_215, main_#t~pre4=|v_main_#t~pre4_129|, main_#t~pre5=|v_main_#t~pre5_154|, main_~a~0=v_main_~a~0_160, main_#t~pre6=|v_main_#t~pre6_197|} OutVars{main_~e~0=v_main_~e~0_2291, main_#t~pre7=|v_main_#t~pre7_675|, main_~c~0=v_main_~c~0_284, main_#t~pre8=|v_main_#t~pre8_1417|, main_~d~0=v_main_~d~0_861, main_~b~0=v_main_~b~0_213, main_#t~pre4=|v_main_#t~pre4_128|, main_#t~pre5=|v_main_#t~pre5_153|, main_~a~0=v_main_~a~0_159, main_#t~pre6=|v_main_#t~pre6_196|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {11101#(= main_~a~0 0)} is VALID [2022-04-28 04:12:38,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {11101#(= main_~a~0 0)} [133] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {11097#false} is VALID [2022-04-28 04:12:38,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {11097#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {11097#false} is VALID [2022-04-28 04:12:38,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {11097#false} assume !false; {11097#false} is VALID [2022-04-28 04:12:38,092 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 04:12:38,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:38,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203380835] [2022-04-28 04:12:38,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203380835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:38,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:38,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:38,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:38,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [909582725] [2022-04-28 04:12:38,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [909582725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:38,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:38,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 04:12:38,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348676627] [2022-04-28 04:12:38,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:38,843 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 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 68 [2022-04-28 04:12:38,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:38,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 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 04:12:38,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:38,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 04:12:38,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:38,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 04:12:38,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2022-04-28 04:12:38,892 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 31 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 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 04:12:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:40,966 INFO L93 Difference]: Finished difference Result 106 states and 124 transitions. [2022-04-28 04:12:40,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 04:12:40,966 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 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 68 [2022-04-28 04:12:40,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 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 04:12:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 124 transitions. [2022-04-28 04:12:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 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 04:12:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 124 transitions. [2022-04-28 04:12:40,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 124 transitions. [2022-04-28 04:12:41,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:41,084 INFO L225 Difference]: With dead ends: 106 [2022-04-28 04:12:41,085 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 04:12:41,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 24 SyntacticMatches, 16 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=426, Invalid=2996, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 04:12:41,086 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 181 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:41,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 49 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 04:12:41,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 04:12:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2022-04-28 04:12:41,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:41,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 71 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 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 04:12:41,116 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 71 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 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 04:12:41,116 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 71 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 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 04:12:41,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:41,117 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2022-04-28 04:12:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2022-04-28 04:12:41,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:41,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:41,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 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 93 states. [2022-04-28 04:12:41,117 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 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 93 states. [2022-04-28 04:12:41,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:41,118 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2022-04-28 04:12:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2022-04-28 04:12:41,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:41,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:41,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:41,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:41,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 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 04:12:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-04-28 04:12:41,119 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 68 [2022-04-28 04:12:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:41,119 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-04-28 04:12:41,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 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 04:12:41,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 75 transitions. [2022-04-28 04:12:41,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:41,262 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-28 04:12:41,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 04:12:41,262 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:41,262 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:41,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 04:12:41,262 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:41,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:41,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1291920522, now seen corresponding path program 23 times [2022-04-28 04:12:41,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:41,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1974767225] [2022-04-28 04:12:45,479 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:45,527 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:45,609 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:49,691 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:49,739 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:49,824 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:53,913 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:53,959 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:54,041 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:58,125 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:58,172 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:58,251 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:58,388 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:58,388 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:58,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1787332919, now seen corresponding path program 1 times [2022-04-28 04:12:58,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:58,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729599411] [2022-04-28 04:12:58,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:58,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:58,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:58,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {11734#(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); {11728#true} is VALID [2022-04-28 04:12:58,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {11728#true} assume true; {11728#true} is VALID [2022-04-28 04:12:58,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11728#true} {11728#true} #80#return; {11728#true} is VALID [2022-04-28 04:12:58,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {11728#true} call ULTIMATE.init(); {11734#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:58,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {11734#(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); {11728#true} is VALID [2022-04-28 04:12:58,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {11728#true} assume true; {11728#true} is VALID [2022-04-28 04:12:58,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11728#true} {11728#true} #80#return; {11728#true} is VALID [2022-04-28 04:12:58,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {11728#true} call #t~ret9 := main(); {11728#true} is VALID [2022-04-28 04:12:58,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {11728#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {11733#(= main_~a~0 0)} is VALID [2022-04-28 04:12:58,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {11733#(= main_~a~0 0)} [136] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_719| |v_main_#t~pre7_715|)) (.cse1 (= v_main_~e~0_2471 v_main_~e~0_2447)) (.cse2 (= |v_main_#t~pre8_1531| |v_main_#t~pre8_1511|)) (.cse3 (= v_main_~a~0_166 v_main_~a~0_165)) (.cse4 (= |v_main_#t~pre4_134| |v_main_#t~pre4_133|)) (.cse5 (= v_main_~c~0_296 v_main_~c~0_294)) (.cse6 (= v_main_~b~0_223 v_main_~b~0_221)) (.cse7 (= |v_main_#t~pre6_204| |v_main_#t~pre6_203|))) (or (and .cse0 (= v_main_~d~0_911 v_main_~d~0_916) .cse1 .cse2 (= |v_main_#t~pre5_159| |v_main_#t~pre5_160|) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= v_main_~d~0_916 v_main_~d~0_911) .cse2 (= |v_main_#t~pre5_160| |v_main_#t~pre5_159|) .cse3 .cse4 .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_2471, main_#t~pre7=|v_main_#t~pre7_719|, main_~c~0=v_main_~c~0_296, main_#t~pre8=|v_main_#t~pre8_1531|, main_~d~0=v_main_~d~0_916, main_~b~0=v_main_~b~0_223, main_#t~pre4=|v_main_#t~pre4_134|, main_#t~pre5=|v_main_#t~pre5_160|, main_~a~0=v_main_~a~0_166, main_#t~pre6=|v_main_#t~pre6_204|} OutVars{main_~e~0=v_main_~e~0_2447, main_#t~pre7=|v_main_#t~pre7_715|, main_~c~0=v_main_~c~0_294, main_#t~pre8=|v_main_#t~pre8_1511|, main_~d~0=v_main_~d~0_911, main_~b~0=v_main_~b~0_221, main_#t~pre4=|v_main_#t~pre4_133|, main_#t~pre5=|v_main_#t~pre5_159|, main_~a~0=v_main_~a~0_165, main_#t~pre6=|v_main_#t~pre6_203|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {11733#(= main_~a~0 0)} is VALID [2022-04-28 04:12:58,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {11733#(= main_~a~0 0)} [135] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {11729#false} is VALID [2022-04-28 04:12:58,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {11729#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {11729#false} is VALID [2022-04-28 04:12:58,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {11729#false} assume !false; {11729#false} is VALID [2022-04-28 04:12:58,415 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 04:12:58,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:58,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729599411] [2022-04-28 04:12:58,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729599411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:58,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:58,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:12:59,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:59,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1974767225] [2022-04-28 04:12:59,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1974767225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:59,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:59,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 04:12:59,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303948630] [2022-04-28 04:12:59,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:59,216 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 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 70 [2022-04-28 04:12:59,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:59,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 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 04:12:59,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:59,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 04:12:59,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:59,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 04:12:59,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2022-04-28 04:12:59,264 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 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 04:13:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:01,372 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2022-04-28 04:13:01,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 04:13:01,372 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 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 70 [2022-04-28 04:13:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 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 04:13:01,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 126 transitions. [2022-04-28 04:13:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 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 04:13:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 126 transitions. [2022-04-28 04:13:01,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 126 transitions. [2022-04-28 04:13:01,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:01,470 INFO L225 Difference]: With dead ends: 108 [2022-04-28 04:13:01,470 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 04:13:01,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 28 SyntacticMatches, 13 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=441, Invalid=3219, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 04:13:01,472 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 153 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:01,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 44 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 04:13:01,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 04:13:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 73. [2022-04-28 04:13:01,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:01,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 73 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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 04:13:01,503 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 73 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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 04:13:01,503 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 73 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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 04:13:01,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:01,504 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2022-04-28 04:13:01,504 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-04-28 04:13:01,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:01,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:01,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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 95 states. [2022-04-28 04:13:01,504 INFO L87 Difference]: Start difference. First operand has 73 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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 95 states. [2022-04-28 04:13:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:01,505 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2022-04-28 04:13:01,505 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-04-28 04:13:01,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:01,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:01,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:01,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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 04:13:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-04-28 04:13:01,506 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 70 [2022-04-28 04:13:01,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:01,506 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-04-28 04:13:01,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 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 04:13:01,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 77 transitions. [2022-04-28 04:13:01,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-04-28 04:13:01,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 04:13:01,654 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:01,654 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:13:01,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-28 04:13:01,654 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash 643795028, now seen corresponding path program 24 times [2022-04-28 04:13:01,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:01,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [87614979] [2022-04-28 04:13:03,887 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:03,929 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:04,014 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:05,561 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:05,644 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:09,732 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:09,779 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:09,861 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:13,886 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:13,929 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:14,013 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:14,167 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:14,168 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:13:14,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1787394423, now seen corresponding path program 1 times [2022-04-28 04:13:14,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:14,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014720578] [2022-04-28 04:13:14,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:14,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:14,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:13:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:14,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {12381#(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); {12375#true} is VALID [2022-04-28 04:13:14,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {12375#true} assume true; {12375#true} is VALID [2022-04-28 04:13:14,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12375#true} {12375#true} #80#return; {12375#true} is VALID [2022-04-28 04:13:14,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {12375#true} call ULTIMATE.init(); {12381#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:13:14,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {12381#(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); {12375#true} is VALID [2022-04-28 04:13:14,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {12375#true} assume true; {12375#true} is VALID [2022-04-28 04:13:14,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12375#true} {12375#true} #80#return; {12375#true} is VALID [2022-04-28 04:13:14,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {12375#true} call #t~ret9 := main(); {12375#true} is VALID [2022-04-28 04:13:14,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {12375#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {12380#(= main_~a~0 0)} is VALID [2022-04-28 04:13:14,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {12380#(= main_~a~0 0)} [138] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_139| |v_main_#t~pre4_138|)) (.cse1 (= v_main_~e~0_2633 v_main_~e~0_2608)) (.cse2 (= v_main_~a~0_172 v_main_~a~0_171)) (.cse3 (= |v_main_#t~pre8_1630| |v_main_#t~pre8_1609|)) (.cse4 (= |v_main_#t~pre5_166| |v_main_#t~pre5_165|)) (.cse5 (= |v_main_#t~pre6_211| |v_main_#t~pre6_210|)) (.cse6 (= v_main_~c~0_306 v_main_~c~0_304)) (.cse7 (= v_main_~d~0_966 v_main_~d~0_961))) (or (and .cse0 (= |v_main_#t~pre7_759| |v_main_#t~pre7_755|) .cse1 .cse2 .cse3 .cse4 (= v_main_~b~0_231 v_main_~b~0_229) .cse5 .cse6 .cse7) (and (= v_main_~b~0_229 v_main_~b~0_231) .cse0 (= |v_main_#t~pre7_755| |v_main_#t~pre7_759|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_2633, main_#t~pre7=|v_main_#t~pre7_759|, main_~c~0=v_main_~c~0_306, main_#t~pre8=|v_main_#t~pre8_1630|, main_~d~0=v_main_~d~0_966, main_~b~0=v_main_~b~0_231, main_#t~pre4=|v_main_#t~pre4_139|, main_#t~pre5=|v_main_#t~pre5_166|, main_~a~0=v_main_~a~0_172, main_#t~pre6=|v_main_#t~pre6_211|} OutVars{main_~e~0=v_main_~e~0_2608, main_#t~pre7=|v_main_#t~pre7_755|, main_~c~0=v_main_~c~0_304, main_#t~pre8=|v_main_#t~pre8_1609|, main_~d~0=v_main_~d~0_961, main_~b~0=v_main_~b~0_229, main_#t~pre4=|v_main_#t~pre4_138|, main_#t~pre5=|v_main_#t~pre5_165|, main_~a~0=v_main_~a~0_171, main_#t~pre6=|v_main_#t~pre6_210|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {12380#(= main_~a~0 0)} is VALID [2022-04-28 04:13:14,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {12380#(= main_~a~0 0)} [137] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {12376#false} is VALID [2022-04-28 04:13:14,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {12376#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {12376#false} is VALID [2022-04-28 04:13:14,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {12376#false} assume !false; {12376#false} is VALID [2022-04-28 04:13:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:13:14,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:14,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014720578] [2022-04-28 04:13:14,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014720578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:14,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:14,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:13:14,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:14,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [87614979] [2022-04-28 04:13:14,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [87614979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:14,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:14,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 04:13:14,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920569910] [2022-04-28 04:13:14,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:14,997 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.090909090909091) internal successors, (69), 32 states have internal predecessors, (69), 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 72 [2022-04-28 04:13:14,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:14,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.090909090909091) internal successors, (69), 32 states have internal predecessors, (69), 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 04:13:15,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:15,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 04:13:15,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:15,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 04:13:15,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 04:13:15,043 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 33 states, 33 states have (on average 2.090909090909091) internal successors, (69), 32 states have internal predecessors, (69), 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 04:13:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:17,529 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 04:13:17,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 04:13:17,530 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.090909090909091) internal successors, (69), 32 states have internal predecessors, (69), 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 72 [2022-04-28 04:13:17,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.090909090909091) internal successors, (69), 32 states have internal predecessors, (69), 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 04:13:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 128 transitions. [2022-04-28 04:13:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.090909090909091) internal successors, (69), 32 states have internal predecessors, (69), 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 04:13:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 128 transitions. [2022-04-28 04:13:17,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 128 transitions. [2022-04-28 04:13:17,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:17,622 INFO L225 Difference]: With dead ends: 110 [2022-04-28 04:13:17,622 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 04:13:17,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 27 SyntacticMatches, 15 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=456, Invalid=3450, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 04:13:17,624 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 149 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:17,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 54 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 04:13:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 04:13:17,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 75. [2022-04-28 04:13:17,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:17,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 75 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 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 04:13:17,655 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 75 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 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 04:13:17,655 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 75 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 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 04:13:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:17,656 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2022-04-28 04:13:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2022-04-28 04:13:17,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:17,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:17,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 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 97 states. [2022-04-28 04:13:17,656 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 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 97 states. [2022-04-28 04:13:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:17,657 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2022-04-28 04:13:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2022-04-28 04:13:17,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:17,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:17,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:17,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 states have internal predecessors, (76), 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 04:13:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2022-04-28 04:13:17,658 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 72 [2022-04-28 04:13:17,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:17,658 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2022-04-28 04:13:17,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.090909090909091) internal successors, (69), 32 states have internal predecessors, (69), 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 04:13:17,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 79 transitions. [2022-04-28 04:13:17,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-04-28 04:13:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 04:13:17,811 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:17,811 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:13:17,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-28 04:13:17,812 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:17,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:17,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1145599410, now seen corresponding path program 25 times [2022-04-28 04:13:17,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:17,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [383105237] [2022-04-28 04:13:22,006 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:22,047 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:22,132 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:24,326 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:24,367 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:24,450 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:28,527 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:28,569 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:28,652 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:32,728 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:32,768 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:32,852 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:32,988 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:32,988 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:13:32,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1787455927, now seen corresponding path program 1 times [2022-04-28 04:13:32,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:32,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165880227] [2022-04-28 04:13:32,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:32,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:33,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:13:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:33,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {13043#(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); {13037#true} is VALID [2022-04-28 04:13:33,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {13037#true} assume true; {13037#true} is VALID [2022-04-28 04:13:33,009 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13037#true} {13037#true} #80#return; {13037#true} is VALID [2022-04-28 04:13:33,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {13037#true} call ULTIMATE.init(); {13043#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:13:33,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {13043#(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); {13037#true} is VALID [2022-04-28 04:13:33,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {13037#true} assume true; {13037#true} is VALID [2022-04-28 04:13:33,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13037#true} {13037#true} #80#return; {13037#true} is VALID [2022-04-28 04:13:33,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {13037#true} call #t~ret9 := main(); {13037#true} is VALID [2022-04-28 04:13:33,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {13037#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {13042#(= main_~a~0 0)} is VALID [2022-04-28 04:13:33,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {13042#(= main_~a~0 0)} [140] L23-3-->L23-4_primed: Formula: (and (= |v_main_#t~pre5_172| |v_main_#t~pre5_171|) (= |v_main_#t~pre7_799| |v_main_#t~pre7_795|) (= v_main_~c~0_316 v_main_~c~0_314) (= v_main_~a~0_178 v_main_~a~0_177) (= |v_main_#t~pre6_218| |v_main_#t~pre6_217|) (= v_main_~b~0_239 v_main_~b~0_237) (= v_main_~d~0_1016 v_main_~d~0_1011) (= v_main_~e~0_2800 v_main_~e~0_2774) (= |v_main_#t~pre8_1733| |v_main_#t~pre8_1711|) (= |v_main_#t~pre4_144| |v_main_#t~pre4_143|)) InVars {main_~e~0=v_main_~e~0_2800, main_#t~pre7=|v_main_#t~pre7_799|, main_~c~0=v_main_~c~0_316, main_#t~pre8=|v_main_#t~pre8_1733|, main_~d~0=v_main_~d~0_1016, main_~b~0=v_main_~b~0_239, main_#t~pre4=|v_main_#t~pre4_144|, main_#t~pre5=|v_main_#t~pre5_172|, main_~a~0=v_main_~a~0_178, main_#t~pre6=|v_main_#t~pre6_218|} OutVars{main_~e~0=v_main_~e~0_2774, main_#t~pre7=|v_main_#t~pre7_795|, main_~c~0=v_main_~c~0_314, main_#t~pre8=|v_main_#t~pre8_1711|, main_~d~0=v_main_~d~0_1011, main_~b~0=v_main_~b~0_237, main_#t~pre4=|v_main_#t~pre4_143|, main_#t~pre5=|v_main_#t~pre5_171|, main_~a~0=v_main_~a~0_177, main_#t~pre6=|v_main_#t~pre6_217|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {13042#(= main_~a~0 0)} is VALID [2022-04-28 04:13:33,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {13042#(= main_~a~0 0)} [139] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {13038#false} is VALID [2022-04-28 04:13:33,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {13038#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {13038#false} is VALID [2022-04-28 04:13:33,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {13038#false} assume !false; {13038#false} is VALID [2022-04-28 04:13:33,011 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 04:13:33,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:33,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165880227] [2022-04-28 04:13:33,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165880227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:33,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:33,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:13:33,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:33,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [383105237] [2022-04-28 04:13:33,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [383105237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:33,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:33,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 04:13:33,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522563480] [2022-04-28 04:13:33,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:33,803 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 33 states have internal predecessors, (71), 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 74 [2022-04-28 04:13:33,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:33,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 33 states have internal predecessors, (71), 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 04:13:33,850 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 04:13:33,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 04:13:33,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:33,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 04:13:33,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 04:13:33,851 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 33 states have internal predecessors, (71), 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 04:13:36,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:36,646 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2022-04-28 04:13:36,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 04:13:36,646 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 33 states have internal predecessors, (71), 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 74 [2022-04-28 04:13:36,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 33 states have internal predecessors, (71), 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 04:13:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 130 transitions. [2022-04-28 04:13:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 33 states have internal predecessors, (71), 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 04:13:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 130 transitions. [2022-04-28 04:13:36,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 130 transitions. [2022-04-28 04:13:36,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:36,744 INFO L225 Difference]: With dead ends: 112 [2022-04-28 04:13:36,745 INFO L226 Difference]: Without dead ends: 99 [2022-04-28 04:13:36,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 33 SyntacticMatches, 10 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=471, Invalid=3689, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 04:13:36,746 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 218 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:36,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 34 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 04:13:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-28 04:13:36,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2022-04-28 04:13:36,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:36,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 77 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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 04:13:36,782 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 77 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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 04:13:36,782 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 77 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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 04:13:36,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:36,783 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-04-28 04:13:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2022-04-28 04:13:36,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:36,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:36,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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 99 states. [2022-04-28 04:13:36,783 INFO L87 Difference]: Start difference. First operand has 77 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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 99 states. [2022-04-28 04:13:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:36,784 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-04-28 04:13:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2022-04-28 04:13:36,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:36,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:36,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:36,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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 04:13:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2022-04-28 04:13:36,785 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 74 [2022-04-28 04:13:36,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:36,785 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2022-04-28 04:13:36,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 33 states have internal predecessors, (71), 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 04:13:36,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 81 transitions. [2022-04-28 04:13:36,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-04-28 04:13:36,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 04:13:36,948 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:36,948 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:13:36,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-28 04:13:36,948 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:36,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:36,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1951693936, now seen corresponding path program 26 times [2022-04-28 04:13:36,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:36,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [540664979] [2022-04-28 04:13:37,169 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:37,249 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:37,353 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:37,434 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:37,541 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:37,630 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:37,738 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:37,823 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:37,983 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:37,983 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:13:37,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1787517431, now seen corresponding path program 1 times [2022-04-28 04:13:37,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:37,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063639593] [2022-04-28 04:13:37,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:37,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:38,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:13:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:38,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {13720#(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); {13714#true} is VALID [2022-04-28 04:13:38,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {13714#true} assume true; {13714#true} is VALID [2022-04-28 04:13:38,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13714#true} {13714#true} #80#return; {13714#true} is VALID [2022-04-28 04:13:38,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {13714#true} call ULTIMATE.init(); {13720#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:13:38,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {13720#(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); {13714#true} is VALID [2022-04-28 04:13:38,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {13714#true} assume true; {13714#true} is VALID [2022-04-28 04:13:38,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13714#true} {13714#true} #80#return; {13714#true} is VALID [2022-04-28 04:13:38,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {13714#true} call #t~ret9 := main(); {13714#true} is VALID [2022-04-28 04:13:38,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {13714#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {13719#(= main_~a~0 0)} is VALID [2022-04-28 04:13:38,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {13719#(= main_~a~0 0)} [142] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_225| |v_main_#t~pre6_224|)) (.cse1 (= v_main_~b~0_247 v_main_~b~0_245)) (.cse2 (= |v_main_#t~pre8_1840| |v_main_#t~pre8_1817|)) (.cse3 (= v_main_~a~0_184 v_main_~a~0_183)) (.cse4 (= v_main_~e~0_2972 v_main_~e~0_2945)) (.cse5 (= |v_main_#t~pre5_178| |v_main_#t~pre5_177|)) (.cse6 (= v_main_~d~0_1066 v_main_~d~0_1061)) (.cse7 (= |v_main_#t~pre4_149| |v_main_#t~pre4_148|)) (.cse8 (= v_main_~c~0_326 v_main_~c~0_324))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre7_839| |v_main_#t~pre7_835|) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre7_835| |v_main_#t~pre7_839|) .cse4 .cse5 .cse6 .cse7 .cse8))) InVars {main_~e~0=v_main_~e~0_2972, main_#t~pre7=|v_main_#t~pre7_839|, main_~c~0=v_main_~c~0_326, main_#t~pre8=|v_main_#t~pre8_1840|, main_~d~0=v_main_~d~0_1066, main_~b~0=v_main_~b~0_247, main_#t~pre4=|v_main_#t~pre4_149|, main_#t~pre5=|v_main_#t~pre5_178|, main_~a~0=v_main_~a~0_184, main_#t~pre6=|v_main_#t~pre6_225|} OutVars{main_~e~0=v_main_~e~0_2945, main_#t~pre7=|v_main_#t~pre7_835|, main_~c~0=v_main_~c~0_324, main_#t~pre8=|v_main_#t~pre8_1817|, main_~d~0=v_main_~d~0_1061, main_~b~0=v_main_~b~0_245, main_#t~pre4=|v_main_#t~pre4_148|, main_#t~pre5=|v_main_#t~pre5_177|, main_~a~0=v_main_~a~0_183, main_#t~pre6=|v_main_#t~pre6_224|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {13719#(= main_~a~0 0)} is VALID [2022-04-28 04:13:38,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {13719#(= main_~a~0 0)} [141] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {13715#false} is VALID [2022-04-28 04:13:38,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {13715#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {13715#false} is VALID [2022-04-28 04:13:38,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {13715#false} assume !false; {13715#false} is VALID [2022-04-28 04:13:38,022 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 04:13:38,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:38,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063639593] [2022-04-28 04:13:38,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063639593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:38,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:38,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:13:38,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:38,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [540664979] [2022-04-28 04:13:38,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [540664979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:38,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:38,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 04:13:38,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448457190] [2022-04-28 04:13:38,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:38,874 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 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 76 [2022-04-28 04:13:38,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:38,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 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 04:13:38,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:38,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 04:13:38,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:38,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 04:13:38,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 04:13:38,924 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 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 04:13:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:41,957 INFO L93 Difference]: Finished difference Result 116 states and 135 transitions. [2022-04-28 04:13:41,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 04:13:41,957 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 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 76 [2022-04-28 04:13:41,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 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 04:13:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 135 transitions. [2022-04-28 04:13:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 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 04:13:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 135 transitions. [2022-04-28 04:13:41,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 135 transitions. [2022-04-28 04:13:42,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:42,061 INFO L225 Difference]: With dead ends: 116 [2022-04-28 04:13:42,061 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 04:13:42,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 31 SyntacticMatches, 13 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=486, Invalid=3936, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 04:13:42,062 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 180 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1916 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:42,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 39 Invalid, 2022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1916 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 04:13:42,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 04:13:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 81. [2022-04-28 04:13:42,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:42,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 81 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 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 04:13:42,103 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 81 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 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 04:13:42,103 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 81 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 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 04:13:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:42,104 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2022-04-28 04:13:42,104 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2022-04-28 04:13:42,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:42,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:42,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 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 103 states. [2022-04-28 04:13:42,104 INFO L87 Difference]: Start difference. First operand has 81 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 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 103 states. [2022-04-28 04:13:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:42,105 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2022-04-28 04:13:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2022-04-28 04:13:42,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:42,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:42,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:42,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 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 04:13:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-04-28 04:13:42,106 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 76 [2022-04-28 04:13:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:42,106 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-04-28 04:13:42,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 34 states have internal predecessors, (73), 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 04:13:42,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 85 transitions. [2022-04-28 04:13:42,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-04-28 04:13:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-28 04:13:42,288 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:42,288 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:13:42,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-28 04:13:42,288 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:42,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2038263314, now seen corresponding path program 27 times [2022-04-28 04:13:42,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:42,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [781868715] [2022-04-28 04:13:42,507 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:42,588 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:42,687 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:42,769 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:42,870 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:42,953 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:43,067 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:43,154 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:43,312 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:43,312 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:13:43,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1787578935, now seen corresponding path program 1 times [2022-04-28 04:13:43,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:43,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685258675] [2022-04-28 04:13:43,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:43,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:43,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:13:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:43,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {14424#(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); {14418#true} is VALID [2022-04-28 04:13:43,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {14418#true} assume true; {14418#true} is VALID [2022-04-28 04:13:43,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14418#true} {14418#true} #80#return; {14418#true} is VALID [2022-04-28 04:13:43,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {14418#true} call ULTIMATE.init(); {14424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:13:43,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {14424#(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); {14418#true} is VALID [2022-04-28 04:13:43,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {14418#true} assume true; {14418#true} is VALID [2022-04-28 04:13:43,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14418#true} {14418#true} #80#return; {14418#true} is VALID [2022-04-28 04:13:43,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {14418#true} call #t~ret9 := main(); {14418#true} is VALID [2022-04-28 04:13:43,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {14418#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {14423#(= main_~a~0 0)} is VALID [2022-04-28 04:13:43,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {14423#(= main_~a~0 0)} [144] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_878| |v_main_#t~pre7_874|)) (.cse1 (= v_main_~b~0_255 v_main_~b~0_253)) (.cse2 (= v_main_~c~0_336 v_main_~c~0_334)) (.cse3 (= |v_main_#t~pre6_232| |v_main_#t~pre6_231|)) (.cse4 (= v_main_~e~0_3142 v_main_~e~0_3114)) (.cse5 (= |v_main_#t~pre4_154| |v_main_#t~pre4_153|)) (.cse6 (= |v_main_#t~pre8_1945| |v_main_#t~pre8_1921|))) (or (and .cse0 (= |v_main_#t~pre5_183| |v_main_#t~pre5_184|) .cse1 (= v_main_~a~0_189 v_main_~a~0_190) .cse2 (= v_main_~d~0_1109 v_main_~d~0_1114) .cse3 .cse4 .cse5 .cse6) (and .cse0 (= |v_main_#t~pre5_184| |v_main_#t~pre5_183|) (= v_main_~d~0_1114 v_main_~d~0_1109) .cse1 .cse2 .cse3 (= v_main_~a~0_190 v_main_~a~0_189) .cse4 .cse5 .cse6))) InVars {main_~e~0=v_main_~e~0_3142, main_#t~pre7=|v_main_#t~pre7_878|, main_~c~0=v_main_~c~0_336, main_#t~pre8=|v_main_#t~pre8_1945|, main_~d~0=v_main_~d~0_1114, main_~b~0=v_main_~b~0_255, main_#t~pre4=|v_main_#t~pre4_154|, main_#t~pre5=|v_main_#t~pre5_184|, main_~a~0=v_main_~a~0_190, main_#t~pre6=|v_main_#t~pre6_232|} OutVars{main_~e~0=v_main_~e~0_3114, main_#t~pre7=|v_main_#t~pre7_874|, main_~c~0=v_main_~c~0_334, main_#t~pre8=|v_main_#t~pre8_1921|, main_~d~0=v_main_~d~0_1109, main_~b~0=v_main_~b~0_253, main_#t~pre4=|v_main_#t~pre4_153|, main_#t~pre5=|v_main_#t~pre5_183|, main_~a~0=v_main_~a~0_189, main_#t~pre6=|v_main_#t~pre6_231|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {14423#(= main_~a~0 0)} is VALID [2022-04-28 04:13:43,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {14423#(= main_~a~0 0)} [143] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {14419#false} is VALID [2022-04-28 04:13:43,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {14419#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {14419#false} is VALID [2022-04-28 04:13:43,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {14419#false} assume !false; {14419#false} is VALID [2022-04-28 04:13:43,346 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 04:13:43,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:43,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685258675] [2022-04-28 04:13:43,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685258675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:43,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:43,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:13:44,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:44,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [781868715] [2022-04-28 04:13:44,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [781868715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:44,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:44,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 04:13:44,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015291755] [2022-04-28 04:13:44,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:44,239 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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 78 [2022-04-28 04:13:44,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:44,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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 04:13:44,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:44,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 04:13:44,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:44,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 04:13:44,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 04:13:44,296 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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 04:13:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:47,144 INFO L93 Difference]: Finished difference Result 117 states and 135 transitions. [2022-04-28 04:13:47,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 04:13:47,144 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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 78 [2022-04-28 04:13:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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 04:13:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2022-04-28 04:13:47,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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 04:13:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2022-04-28 04:13:47,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 135 transitions. [2022-04-28 04:13:47,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:47,238 INFO L225 Difference]: With dead ends: 117 [2022-04-28 04:13:47,238 INFO L226 Difference]: Without dead ends: 104 [2022-04-28 04:13:47,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 33 SyntacticMatches, 12 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=501, Invalid=4191, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 04:13:47,239 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 202 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:47,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 34 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 04:13:47,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-28 04:13:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 83. [2022-04-28 04:13:47,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:47,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 83 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 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 04:13:47,276 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 83 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 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 04:13:47,276 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 83 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 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 04:13:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:47,277 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-04-28 04:13:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-04-28 04:13:47,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:47,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:47,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 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 104 states. [2022-04-28 04:13:47,277 INFO L87 Difference]: Start difference. First operand has 83 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 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 104 states. [2022-04-28 04:13:47,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:47,278 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-04-28 04:13:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-04-28 04:13:47,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:47,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:47,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:47,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 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 04:13:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-04-28 04:13:47,279 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 78 [2022-04-28 04:13:47,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:47,280 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-04-28 04:13:47,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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 04:13:47,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 87 transitions. [2022-04-28 04:13:47,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-04-28 04:13:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 04:13:47,475 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:47,475 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:13:47,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-28 04:13:47,475 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:47,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1541003329, now seen corresponding path program 28 times [2022-04-28 04:13:47,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:47,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1483216843] [2022-04-28 04:13:49,730 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:49,770 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:49,853 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:53,931 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:53,972 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:54,053 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:58,129 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:13:58,171 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:13:58,256 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:02,351 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:02,392 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:02,480 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:02,666 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:02,666 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:14:02,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1787640439, now seen corresponding path program 1 times [2022-04-28 04:14:02,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:02,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616372426] [2022-04-28 04:14:02,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:02,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:02,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:14:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:02,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {15139#(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); {15133#true} is VALID [2022-04-28 04:14:02,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {15133#true} assume true; {15133#true} is VALID [2022-04-28 04:14:02,699 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15133#true} {15133#true} #80#return; {15133#true} is VALID [2022-04-28 04:14:02,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {15133#true} call ULTIMATE.init(); {15139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:14:02,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {15139#(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); {15133#true} is VALID [2022-04-28 04:14:02,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {15133#true} assume true; {15133#true} is VALID [2022-04-28 04:14:02,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15133#true} {15133#true} #80#return; {15133#true} is VALID [2022-04-28 04:14:02,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {15133#true} call #t~ret9 := main(); {15133#true} is VALID [2022-04-28 04:14:02,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {15133#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {15138#(= main_~a~0 0)} is VALID [2022-04-28 04:14:02,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {15138#(= main_~a~0 0)} [146] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_239| |v_main_#t~pre6_238|)) (.cse1 (= |v_main_#t~pre5_190| |v_main_#t~pre5_189|)) (.cse2 (= v_main_~b~0_263 v_main_~b~0_261)) (.cse3 (= v_main_~c~0_346 v_main_~c~0_344)) (.cse4 (= v_main_~d~0_1168 v_main_~d~0_1162)) (.cse5 (= v_main_~e~0_3317 v_main_~e~0_3288)) (.cse6 (= |v_main_#t~pre4_159| |v_main_#t~pre4_158|)) (.cse7 (= |v_main_#t~pre8_2050| |v_main_#t~pre8_2026|)) (.cse8 (= v_main_~a~0_196 v_main_~a~0_195))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_main_#t~pre7_921| |v_main_#t~pre7_916|) .cse8) (and (= |v_main_#t~pre7_916| |v_main_#t~pre7_921|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) InVars {main_~e~0=v_main_~e~0_3317, main_#t~pre7=|v_main_#t~pre7_921|, main_~c~0=v_main_~c~0_346, main_#t~pre8=|v_main_#t~pre8_2050|, main_~d~0=v_main_~d~0_1168, main_~b~0=v_main_~b~0_263, main_#t~pre4=|v_main_#t~pre4_159|, main_#t~pre5=|v_main_#t~pre5_190|, main_~a~0=v_main_~a~0_196, main_#t~pre6=|v_main_#t~pre6_239|} OutVars{main_~e~0=v_main_~e~0_3288, main_#t~pre7=|v_main_#t~pre7_916|, main_~c~0=v_main_~c~0_344, main_#t~pre8=|v_main_#t~pre8_2026|, main_~d~0=v_main_~d~0_1162, main_~b~0=v_main_~b~0_261, main_#t~pre4=|v_main_#t~pre4_158|, main_#t~pre5=|v_main_#t~pre5_189|, main_~a~0=v_main_~a~0_195, main_#t~pre6=|v_main_#t~pre6_238|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {15138#(= main_~a~0 0)} is VALID [2022-04-28 04:14:02,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {15138#(= main_~a~0 0)} [145] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {15134#false} is VALID [2022-04-28 04:14:02,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {15134#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {15134#false} is VALID [2022-04-28 04:14:02,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {15134#false} assume !false; {15134#false} is VALID [2022-04-28 04:14:02,701 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 04:14:02,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:02,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616372426] [2022-04-28 04:14:02,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616372426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:02,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:02,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:14:03,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:03,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1483216843] [2022-04-28 04:14:03,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1483216843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:03,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:03,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 04:14:03,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832262758] [2022-04-28 04:14:03,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:03,680 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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 81 [2022-04-28 04:14:03,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:03,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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 04:14:03,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:03,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 04:14:03,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:03,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 04:14:03,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 04:14:03,733 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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 04:14:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:06,944 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2022-04-28 04:14:06,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 04:14:06,945 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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 81 [2022-04-28 04:14:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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 04:14:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2022-04-28 04:14:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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 04:14:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2022-04-28 04:14:06,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 137 transitions. [2022-04-28 04:14:07,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:07,040 INFO L225 Difference]: With dead ends: 119 [2022-04-28 04:14:07,041 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 04:14:07,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 32 SyntacticMatches, 15 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=516, Invalid=4454, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 04:14:07,041 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 175 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:14:07,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 39 Invalid, 2112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2007 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 04:14:07,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 04:14:07,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2022-04-28 04:14:07,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:07,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 84 states, 80 states have (on average 1.0625) internal successors, (85), 80 states have internal predecessors, (85), 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 04:14:07,083 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 84 states, 80 states have (on average 1.0625) internal successors, (85), 80 states have internal predecessors, (85), 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 04:14:07,083 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 84 states, 80 states have (on average 1.0625) internal successors, (85), 80 states have internal predecessors, (85), 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 04:14:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:07,084 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-04-28 04:14:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-04-28 04:14:07,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:07,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:07,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 80 states have (on average 1.0625) internal successors, (85), 80 states have internal predecessors, (85), 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 106 states. [2022-04-28 04:14:07,085 INFO L87 Difference]: Start difference. First operand has 84 states, 80 states have (on average 1.0625) internal successors, (85), 80 states have internal predecessors, (85), 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 106 states. [2022-04-28 04:14:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:07,086 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-04-28 04:14:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-04-28 04:14:07,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:07,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:07,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:07,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:07,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 80 states have (on average 1.0625) internal successors, (85), 80 states have internal predecessors, (85), 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 04:14:07,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-04-28 04:14:07,087 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 81 [2022-04-28 04:14:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:07,087 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-04-28 04:14:07,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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 04:14:07,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 88 transitions. [2022-04-28 04:14:07,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-04-28 04:14:07,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 04:14:07,279 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:07,279 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:14:07,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-28 04:14:07,279 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:07,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1793386077, now seen corresponding path program 29 times [2022-04-28 04:14:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:07,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [277039749] [2022-04-28 04:14:07,554 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:07,637 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:07,751 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:07,835 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:07,961 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:08,051 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:08,166 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:08,248 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:08,415 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:08,415 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:14:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1787701943, now seen corresponding path program 1 times [2022-04-28 04:14:08,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:08,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84165601] [2022-04-28 04:14:08,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:08,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:08,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:14:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:08,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {15867#(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); {15861#true} is VALID [2022-04-28 04:14:08,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {15861#true} assume true; {15861#true} is VALID [2022-04-28 04:14:08,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15861#true} {15861#true} #80#return; {15861#true} is VALID [2022-04-28 04:14:08,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {15861#true} call ULTIMATE.init(); {15867#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:14:08,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {15867#(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); {15861#true} is VALID [2022-04-28 04:14:08,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {15861#true} assume true; {15861#true} is VALID [2022-04-28 04:14:08,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15861#true} {15861#true} #80#return; {15861#true} is VALID [2022-04-28 04:14:08,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {15861#true} call #t~ret9 := main(); {15861#true} is VALID [2022-04-28 04:14:08,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {15861#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {15866#(= main_~a~0 0)} is VALID [2022-04-28 04:14:08,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {15866#(= main_~a~0 0)} [148] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_164| |v_main_#t~pre4_163|)) (.cse1 (= |v_main_#t~pre5_196| |v_main_#t~pre5_195|)) (.cse2 (= v_main_~c~0_356 v_main_~c~0_354)) (.cse3 (= v_main_~d~0_1222 v_main_~d~0_1216)) (.cse4 (= |v_main_#t~pre6_246| |v_main_#t~pre6_245|)) (.cse5 (= |v_main_#t~pre8_2159| |v_main_#t~pre8_2134|)) (.cse6 (= v_main_~a~0_202 v_main_~a~0_201)) (.cse7 (= v_main_~e~0_3497 v_main_~e~0_3467))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |v_main_#t~pre7_964| |v_main_#t~pre7_959|) (= v_main_~b~0_271 v_main_~b~0_269) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |v_main_#t~pre7_959| |v_main_#t~pre7_964|) .cse7 (= v_main_~b~0_269 v_main_~b~0_271)))) InVars {main_~e~0=v_main_~e~0_3497, main_#t~pre7=|v_main_#t~pre7_964|, main_~c~0=v_main_~c~0_356, main_#t~pre8=|v_main_#t~pre8_2159|, main_~d~0=v_main_~d~0_1222, main_~b~0=v_main_~b~0_271, main_#t~pre4=|v_main_#t~pre4_164|, main_#t~pre5=|v_main_#t~pre5_196|, main_~a~0=v_main_~a~0_202, main_#t~pre6=|v_main_#t~pre6_246|} OutVars{main_~e~0=v_main_~e~0_3467, main_#t~pre7=|v_main_#t~pre7_959|, main_~c~0=v_main_~c~0_354, main_#t~pre8=|v_main_#t~pre8_2134|, main_~d~0=v_main_~d~0_1216, main_~b~0=v_main_~b~0_269, main_#t~pre4=|v_main_#t~pre4_163|, main_#t~pre5=|v_main_#t~pre5_195|, main_~a~0=v_main_~a~0_201, main_#t~pre6=|v_main_#t~pre6_245|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {15866#(= main_~a~0 0)} is VALID [2022-04-28 04:14:08,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {15866#(= main_~a~0 0)} [147] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {15862#false} is VALID [2022-04-28 04:14:08,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {15862#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {15862#false} is VALID [2022-04-28 04:14:08,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {15862#false} assume !false; {15862#false} is VALID [2022-04-28 04:14:08,466 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 04:14:08,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:08,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84165601] [2022-04-28 04:14:08,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84165601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:08,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:08,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:14:09,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:09,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [277039749] [2022-04-28 04:14:09,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [277039749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:09,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:09,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 04:14:09,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658552816] [2022-04-28 04:14:09,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:09,526 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 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 83 [2022-04-28 04:14:09,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:09,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 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 04:14:09,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:09,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 04:14:09,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:09,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 04:14:09,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1227, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 04:14:09,580 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 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 04:14:13,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:13,058 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2022-04-28 04:14:13,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 04:14:13,058 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 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 83 [2022-04-28 04:14:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 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 04:14:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 139 transitions. [2022-04-28 04:14:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 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 04:14:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 139 transitions. [2022-04-28 04:14:13,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 139 transitions. [2022-04-28 04:14:13,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:13,155 INFO L225 Difference]: With dead ends: 121 [2022-04-28 04:14:13,155 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 04:14:13,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 29 SyntacticMatches, 19 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=531, Invalid=4725, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 04:14:13,156 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 217 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:14:13,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 24 Invalid, 2330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 04:14:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 04:14:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2022-04-28 04:14:13,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:13,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 86 states, 82 states have (on average 1.0609756097560976) internal successors, (87), 82 states have internal predecessors, (87), 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 04:14:13,196 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 86 states, 82 states have (on average 1.0609756097560976) internal successors, (87), 82 states have internal predecessors, (87), 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 04:14:13,197 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 86 states, 82 states have (on average 1.0609756097560976) internal successors, (87), 82 states have internal predecessors, (87), 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 04:14:13,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:13,197 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2022-04-28 04:14:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2022-04-28 04:14:13,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:13,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:13,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.0609756097560976) internal successors, (87), 82 states have internal predecessors, (87), 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 108 states. [2022-04-28 04:14:13,198 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.0609756097560976) internal successors, (87), 82 states have internal predecessors, (87), 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 108 states. [2022-04-28 04:14:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:13,199 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2022-04-28 04:14:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2022-04-28 04:14:13,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:13,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:13,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:13,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.0609756097560976) internal successors, (87), 82 states have internal predecessors, (87), 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 04:14:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-04-28 04:14:13,200 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 83 [2022-04-28 04:14:13,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:13,200 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-04-28 04:14:13,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 37 states have internal predecessors, (80), 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 04:14:13,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 90 transitions. [2022-04-28 04:14:13,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-04-28 04:14:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 04:14:13,402 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:13,402 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:14:13,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-28 04:14:13,402 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:13,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:13,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2096002427, now seen corresponding path program 30 times [2022-04-28 04:14:13,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:13,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [845957472] [2022-04-28 04:14:13,676 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:13,774 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:13,897 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:13,981 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:14,096 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:14,181 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:14,298 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:14,388 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:14,577 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:14,577 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:14:14,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1787763447, now seen corresponding path program 1 times [2022-04-28 04:14:14,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:14,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005591761] [2022-04-28 04:14:14,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:14,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:14,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:14:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:14,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {16610#(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); {16604#true} is VALID [2022-04-28 04:14:14,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {16604#true} assume true; {16604#true} is VALID [2022-04-28 04:14:14,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16604#true} {16604#true} #80#return; {16604#true} is VALID [2022-04-28 04:14:14,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {16604#true} call ULTIMATE.init(); {16610#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:14:14,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {16610#(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); {16604#true} is VALID [2022-04-28 04:14:14,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {16604#true} assume true; {16604#true} is VALID [2022-04-28 04:14:14,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16604#true} {16604#true} #80#return; {16604#true} is VALID [2022-04-28 04:14:14,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {16604#true} call #t~ret9 := main(); {16604#true} is VALID [2022-04-28 04:14:14,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {16604#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {16609#(= main_~a~0 0)} is VALID [2022-04-28 04:14:14,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {16609#(= main_~a~0 0)} [150] L23-3-->L23-4_primed: Formula: (and (= v_main_~b~0_279 v_main_~b~0_277) (= |v_main_#t~pre4_169| |v_main_#t~pre4_168|) (= |v_main_#t~pre8_2272| |v_main_#t~pre8_2246|) (= v_main_~a~0_208 v_main_~a~0_207) (= |v_main_#t~pre7_1007| |v_main_#t~pre7_1002|) (= |v_main_#t~pre5_202| |v_main_#t~pre5_201|) (= v_main_~d~0_1276 v_main_~d~0_1270) (= v_main_~c~0_366 v_main_~c~0_364) (= |v_main_#t~pre6_253| |v_main_#t~pre6_252|) (= v_main_~e~0_3682 v_main_~e~0_3651)) InVars {main_~e~0=v_main_~e~0_3682, main_#t~pre7=|v_main_#t~pre7_1007|, main_~c~0=v_main_~c~0_366, main_#t~pre8=|v_main_#t~pre8_2272|, main_~d~0=v_main_~d~0_1276, main_~b~0=v_main_~b~0_279, main_#t~pre4=|v_main_#t~pre4_169|, main_#t~pre5=|v_main_#t~pre5_202|, main_~a~0=v_main_~a~0_208, main_#t~pre6=|v_main_#t~pre6_253|} OutVars{main_~e~0=v_main_~e~0_3651, main_#t~pre7=|v_main_#t~pre7_1002|, main_~c~0=v_main_~c~0_364, main_#t~pre8=|v_main_#t~pre8_2246|, main_~d~0=v_main_~d~0_1270, main_~b~0=v_main_~b~0_277, main_#t~pre4=|v_main_#t~pre4_168|, main_#t~pre5=|v_main_#t~pre5_201|, main_~a~0=v_main_~a~0_207, main_#t~pre6=|v_main_#t~pre6_252|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {16609#(= main_~a~0 0)} is VALID [2022-04-28 04:14:14,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {16609#(= main_~a~0 0)} [149] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {16605#false} is VALID [2022-04-28 04:14:14,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {16605#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {16605#false} is VALID [2022-04-28 04:14:14,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {16605#false} assume !false; {16605#false} is VALID [2022-04-28 04:14:14,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:14:14,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:14,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005591761] [2022-04-28 04:14:14,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005591761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:14,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:14,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:14:15,646 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:15,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [845957472] [2022-04-28 04:14:15,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [845957472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:15,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:15,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 04:14:15,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540951993] [2022-04-28 04:14:15,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:15,647 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 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 85 [2022-04-28 04:14:15,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:15,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 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 04:14:15,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:15,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 04:14:15,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:15,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 04:14:15,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1298, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 04:14:15,703 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 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 04:14:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:19,166 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2022-04-28 04:14:19,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 04:14:19,166 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 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 85 [2022-04-28 04:14:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 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 04:14:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 141 transitions. [2022-04-28 04:14:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 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 04:14:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 141 transitions. [2022-04-28 04:14:19,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 141 transitions. [2022-04-28 04:14:19,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:19,264 INFO L225 Difference]: With dead ends: 123 [2022-04-28 04:14:19,264 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 04:14:19,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 34 SyntacticMatches, 15 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=546, Invalid=5004, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 04:14:19,265 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 161 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 2319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:14:19,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 49 Invalid, 2319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 04:14:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 04:14:19,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2022-04-28 04:14:19,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:19,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 88 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 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 04:14:19,307 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 88 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 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 04:14:19,307 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 88 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 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 04:14:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:19,308 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2022-04-28 04:14:19,308 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2022-04-28 04:14:19,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:19,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:19,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 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 110 states. [2022-04-28 04:14:19,309 INFO L87 Difference]: Start difference. First operand has 88 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 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 110 states. [2022-04-28 04:14:19,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:19,310 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2022-04-28 04:14:19,310 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2022-04-28 04:14:19,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:19,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:19,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:19,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 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 04:14:19,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-04-28 04:14:19,311 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 85 [2022-04-28 04:14:19,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:19,311 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-04-28 04:14:19,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 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 04:14:19,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 92 transitions. [2022-04-28 04:14:19,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-04-28 04:14:19,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 04:14:19,508 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:19,508 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:14:19,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-28 04:14:19,508 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:19,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:19,508 INFO L85 PathProgramCache]: Analyzing trace with hash 852538649, now seen corresponding path program 31 times [2022-04-28 04:14:19,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:19,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2043759456] [2022-04-28 04:14:22,693 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:22,740 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:22,824 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:26,908 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:26,956 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:27,040 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:31,126 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:31,173 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:31,255 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:33,427 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:33,475 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:33,560 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:33,741 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:33,741 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:14:33,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1787824951, now seen corresponding path program 1 times [2022-04-28 04:14:33,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:33,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124718734] [2022-04-28 04:14:33,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:33,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:33,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:14:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:33,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {17368#(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); {17362#true} is VALID [2022-04-28 04:14:33,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {17362#true} assume true; {17362#true} is VALID [2022-04-28 04:14:33,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17362#true} {17362#true} #80#return; {17362#true} is VALID [2022-04-28 04:14:33,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {17362#true} call ULTIMATE.init(); {17368#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:14:33,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {17368#(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); {17362#true} is VALID [2022-04-28 04:14:33,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {17362#true} assume true; {17362#true} is VALID [2022-04-28 04:14:33,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17362#true} {17362#true} #80#return; {17362#true} is VALID [2022-04-28 04:14:33,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {17362#true} call #t~ret9 := main(); {17362#true} is VALID [2022-04-28 04:14:33,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {17362#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {17367#(= main_~a~0 0)} is VALID [2022-04-28 04:14:33,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {17367#(= main_~a~0 0)} [152] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_214 v_main_~a~0_213)) (.cse1 (= v_main_~b~0_287 v_main_~b~0_285)) (.cse2 (= v_main_~e~0_3872 v_main_~e~0_3840)) (.cse3 (= v_main_~c~0_376 v_main_~c~0_374)) (.cse4 (= |v_main_#t~pre8_2389| |v_main_#t~pre8_2362|)) (.cse5 (= |v_main_#t~pre7_1050| |v_main_#t~pre7_1045|)) (.cse6 (= |v_main_#t~pre5_208| |v_main_#t~pre5_207|))) (or (and .cse0 .cse1 (= v_main_~d~0_1330 v_main_~d~0_1324) .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre4_174| |v_main_#t~pre4_173|) .cse6 (= |v_main_#t~pre6_260| |v_main_#t~pre6_259|)) (and (= |v_main_#t~pre4_173| |v_main_#t~pre4_174|) .cse0 (= |v_main_#t~pre6_259| |v_main_#t~pre6_260|) .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~d~0_1324 v_main_~d~0_1330) .cse6))) InVars {main_~e~0=v_main_~e~0_3872, main_#t~pre7=|v_main_#t~pre7_1050|, main_~c~0=v_main_~c~0_376, main_#t~pre8=|v_main_#t~pre8_2389|, main_~d~0=v_main_~d~0_1330, main_~b~0=v_main_~b~0_287, main_#t~pre4=|v_main_#t~pre4_174|, main_#t~pre5=|v_main_#t~pre5_208|, main_~a~0=v_main_~a~0_214, main_#t~pre6=|v_main_#t~pre6_260|} OutVars{main_~e~0=v_main_~e~0_3840, main_#t~pre7=|v_main_#t~pre7_1045|, main_~c~0=v_main_~c~0_374, main_#t~pre8=|v_main_#t~pre8_2362|, main_~d~0=v_main_~d~0_1324, main_~b~0=v_main_~b~0_285, main_#t~pre4=|v_main_#t~pre4_173|, main_#t~pre5=|v_main_#t~pre5_207|, main_~a~0=v_main_~a~0_213, main_#t~pre6=|v_main_#t~pre6_259|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {17367#(= main_~a~0 0)} is VALID [2022-04-28 04:14:33,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {17367#(= main_~a~0 0)} [151] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {17363#false} is VALID [2022-04-28 04:14:33,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {17363#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {17363#false} is VALID [2022-04-28 04:14:33,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {17363#false} assume !false; {17363#false} is VALID [2022-04-28 04:14:33,780 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 04:14:33,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:33,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124718734] [2022-04-28 04:14:33,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124718734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:33,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:33,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:14:34,931 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:34,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2043759456] [2022-04-28 04:14:34,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2043759456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:34,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:34,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 04:14:34,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920722326] [2022-04-28 04:14:34,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:34,931 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 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 87 [2022-04-28 04:14:34,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:34,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 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 04:14:34,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:34,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 04:14:34,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:34,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 04:14:34,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1371, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 04:14:34,988 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 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 04:14:38,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:38,695 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2022-04-28 04:14:38,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 04:14:38,696 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 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 87 [2022-04-28 04:14:38,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:14:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 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 04:14:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 143 transitions. [2022-04-28 04:14:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 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 04:14:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 143 transitions. [2022-04-28 04:14:38,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 143 transitions. [2022-04-28 04:14:38,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:38,799 INFO L225 Difference]: With dead ends: 125 [2022-04-28 04:14:38,799 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 04:14:38,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 30 SyntacticMatches, 20 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=561, Invalid=5291, Unknown=0, NotChecked=0, Total=5852 [2022-04-28 04:14:38,800 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 154 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:14:38,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 124 Invalid, 2427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 04:14:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 04:14:38,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 90. [2022-04-28 04:14:38,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:14:38,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 90 states, 86 states have (on average 1.058139534883721) internal successors, (91), 86 states have internal predecessors, (91), 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 04:14:38,845 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 90 states, 86 states have (on average 1.058139534883721) internal successors, (91), 86 states have internal predecessors, (91), 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 04:14:38,845 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 90 states, 86 states have (on average 1.058139534883721) internal successors, (91), 86 states have internal predecessors, (91), 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 04:14:38,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:38,846 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-04-28 04:14:38,846 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2022-04-28 04:14:38,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:38,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:38,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 86 states have (on average 1.058139534883721) internal successors, (91), 86 states have internal predecessors, (91), 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 112 states. [2022-04-28 04:14:38,847 INFO L87 Difference]: Start difference. First operand has 90 states, 86 states have (on average 1.058139534883721) internal successors, (91), 86 states have internal predecessors, (91), 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 112 states. [2022-04-28 04:14:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:14:38,848 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-04-28 04:14:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2022-04-28 04:14:38,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:14:38,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:14:38,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:14:38,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:14:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 86 states have (on average 1.058139534883721) internal successors, (91), 86 states have internal predecessors, (91), 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 04:14:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-04-28 04:14:38,849 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 87 [2022-04-28 04:14:38,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:14:38,849 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-04-28 04:14:38,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 39 states have internal predecessors, (84), 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 04:14:38,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 94 transitions. [2022-04-28 04:14:39,060 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-28 04:14:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-04-28 04:14:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 04:14:39,061 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:14:39,061 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:14:39,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-28 04:14:39,061 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:14:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:14:39,062 INFO L85 PathProgramCache]: Analyzing trace with hash -115243721, now seen corresponding path program 32 times [2022-04-28 04:14:39,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:39,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [923718454] [2022-04-28 04:14:43,282 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:43,331 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:43,415 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:47,500 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:47,552 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:47,633 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:51,722 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:51,770 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:51,856 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:55,941 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:14:55,989 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:56,073 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:56,257 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:14:56,258 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:14:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1787886455, now seen corresponding path program 1 times [2022-04-28 04:14:56,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:14:56,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189024396] [2022-04-28 04:14:56,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:14:56,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:14:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:56,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:14:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:14:56,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {18141#(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); {18135#true} is VALID [2022-04-28 04:14:56,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {18135#true} assume true; {18135#true} is VALID [2022-04-28 04:14:56,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18135#true} {18135#true} #80#return; {18135#true} is VALID [2022-04-28 04:14:56,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {18135#true} call ULTIMATE.init(); {18141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:14:56,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {18141#(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); {18135#true} is VALID [2022-04-28 04:14:56,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {18135#true} assume true; {18135#true} is VALID [2022-04-28 04:14:56,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18135#true} {18135#true} #80#return; {18135#true} is VALID [2022-04-28 04:14:56,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {18135#true} call #t~ret9 := main(); {18135#true} is VALID [2022-04-28 04:14:56,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {18135#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {18140#(= main_~a~0 0)} is VALID [2022-04-28 04:14:56,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {18140#(= main_~a~0 0)} [154] L23-3-->L23-4_primed: Formula: (and (= |v_main_#t~pre5_214| |v_main_#t~pre5_213|) (= |v_main_#t~pre7_1093| |v_main_#t~pre7_1088|) (= |v_main_#t~pre8_2510| |v_main_#t~pre8_2482|) (= |v_main_#t~pre4_179| |v_main_#t~pre4_178|) (= v_main_~c~0_386 v_main_~c~0_384) (= v_main_~a~0_220 v_main_~a~0_219) (= v_main_~b~0_295 v_main_~b~0_293) (= v_main_~e~0_4067 v_main_~e~0_4034) (= v_main_~d~0_1384 v_main_~d~0_1378) (= |v_main_#t~pre6_267| |v_main_#t~pre6_266|)) InVars {main_~e~0=v_main_~e~0_4067, main_#t~pre7=|v_main_#t~pre7_1093|, main_~c~0=v_main_~c~0_386, main_#t~pre8=|v_main_#t~pre8_2510|, main_~d~0=v_main_~d~0_1384, main_~b~0=v_main_~b~0_295, main_#t~pre4=|v_main_#t~pre4_179|, main_#t~pre5=|v_main_#t~pre5_214|, main_~a~0=v_main_~a~0_220, main_#t~pre6=|v_main_#t~pre6_267|} OutVars{main_~e~0=v_main_~e~0_4034, main_#t~pre7=|v_main_#t~pre7_1088|, main_~c~0=v_main_~c~0_384, main_#t~pre8=|v_main_#t~pre8_2482|, main_~d~0=v_main_~d~0_1378, main_~b~0=v_main_~b~0_293, main_#t~pre4=|v_main_#t~pre4_178|, main_#t~pre5=|v_main_#t~pre5_213|, main_~a~0=v_main_~a~0_219, main_#t~pre6=|v_main_#t~pre6_266|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {18140#(= main_~a~0 0)} is VALID [2022-04-28 04:14:56,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {18140#(= main_~a~0 0)} [153] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {18136#false} is VALID [2022-04-28 04:14:56,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {18136#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {18136#false} is VALID [2022-04-28 04:14:56,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {18136#false} assume !false; {18136#false} is VALID [2022-04-28 04:14:56,294 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 04:14:56,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:14:56,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189024396] [2022-04-28 04:14:56,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189024396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:56,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:56,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:14:57,439 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:57,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [923718454] [2022-04-28 04:14:57,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [923718454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:57,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:57,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 04:14:57,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127499391] [2022-04-28 04:14:57,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:57,440 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 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 89 [2022-04-28 04:14:57,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:57,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 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 04:14:57,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:14:57,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 04:14:57,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:14:57,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 04:14:57,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 04:14:57,498 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 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 04:15:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:01,251 INFO L93 Difference]: Finished difference Result 127 states and 145 transitions. [2022-04-28 04:15:01,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 04:15:01,252 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 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 89 [2022-04-28 04:15:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:15:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 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 04:15:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 145 transitions. [2022-04-28 04:15:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 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 04:15:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 145 transitions. [2022-04-28 04:15:01,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 145 transitions. [2022-04-28 04:15:01,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:01,376 INFO L225 Difference]: With dead ends: 127 [2022-04-28 04:15:01,376 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 04:15:01,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 36 SyntacticMatches, 15 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=576, Invalid=5586, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 04:15:01,377 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 187 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:15:01,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 39 Invalid, 2455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 04:15:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 04:15:01,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92. [2022-04-28 04:15:01,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:15:01,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 92 states, 88 states have (on average 1.0568181818181819) internal successors, (93), 88 states have internal predecessors, (93), 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 04:15:01,425 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 92 states, 88 states have (on average 1.0568181818181819) internal successors, (93), 88 states have internal predecessors, (93), 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 04:15:01,425 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 92 states, 88 states have (on average 1.0568181818181819) internal successors, (93), 88 states have internal predecessors, (93), 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 04:15:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:01,426 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2022-04-28 04:15:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2022-04-28 04:15:01,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:01,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:01,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 88 states have (on average 1.0568181818181819) internal successors, (93), 88 states have internal predecessors, (93), 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 114 states. [2022-04-28 04:15:01,426 INFO L87 Difference]: Start difference. First operand has 92 states, 88 states have (on average 1.0568181818181819) internal successors, (93), 88 states have internal predecessors, (93), 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 114 states. [2022-04-28 04:15:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:01,427 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2022-04-28 04:15:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2022-04-28 04:15:01,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:01,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:01,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:15:01,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:15:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.0568181818181819) internal successors, (93), 88 states have internal predecessors, (93), 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 04:15:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-04-28 04:15:01,428 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 89 [2022-04-28 04:15:01,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:15:01,429 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-04-28 04:15:01,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 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 04:15:01,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 96 transitions. [2022-04-28 04:15:01,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:01,667 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-04-28 04:15:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 04:15:01,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:15:01,668 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:15:01,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-28 04:15:01,668 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:15:01,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:15:01,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1853801941, now seen corresponding path program 33 times [2022-04-28 04:15:01,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:01,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2013570890] [2022-04-28 04:15:01,936 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:02,027 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:02,152 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:02,241 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:02,369 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:02,458 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:02,582 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:02,669 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:02,878 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:02,878 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:15:02,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1787947959, now seen corresponding path program 1 times [2022-04-28 04:15:02,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:15:02,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376172697] [2022-04-28 04:15:02,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:15:02,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:15:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:02,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:15:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:02,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {18929#(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); {18923#true} is VALID [2022-04-28 04:15:02,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {18923#true} assume true; {18923#true} is VALID [2022-04-28 04:15:02,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18923#true} {18923#true} #80#return; {18923#true} is VALID [2022-04-28 04:15:02,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {18923#true} call ULTIMATE.init(); {18929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:15:02,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {18929#(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); {18923#true} is VALID [2022-04-28 04:15:02,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {18923#true} assume true; {18923#true} is VALID [2022-04-28 04:15:02,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18923#true} {18923#true} #80#return; {18923#true} is VALID [2022-04-28 04:15:02,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {18923#true} call #t~ret9 := main(); {18923#true} is VALID [2022-04-28 04:15:02,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {18923#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {18928#(= main_~a~0 0)} is VALID [2022-04-28 04:15:02,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {18928#(= main_~a~0 0)} [156] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_226 v_main_~a~0_225)) (.cse1 (= |v_main_#t~pre8_2635| |v_main_#t~pre8_2606|)) (.cse2 (= |v_main_#t~pre6_274| |v_main_#t~pre6_273|)) (.cse3 (= v_main_~e~0_4267 v_main_~e~0_4233)) (.cse4 (= |v_main_#t~pre4_184| |v_main_#t~pre4_183|)) (.cse5 (= |v_main_#t~pre7_1136| |v_main_#t~pre7_1131|)) (.cse6 (= v_main_~b~0_303 v_main_~b~0_301)) (.cse7 (= v_main_~c~0_396 v_main_~c~0_394))) (or (and .cse0 (= |v_main_#t~pre5_219| |v_main_#t~pre5_220|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~d~0_1432 v_main_~d~0_1438)) (and .cse0 (= |v_main_#t~pre5_220| |v_main_#t~pre5_219|) .cse1 .cse2 .cse3 .cse4 (= v_main_~d~0_1438 v_main_~d~0_1432) .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_4267, main_#t~pre7=|v_main_#t~pre7_1136|, main_~c~0=v_main_~c~0_396, main_#t~pre8=|v_main_#t~pre8_2635|, main_~d~0=v_main_~d~0_1438, main_~b~0=v_main_~b~0_303, main_#t~pre4=|v_main_#t~pre4_184|, main_#t~pre5=|v_main_#t~pre5_220|, main_~a~0=v_main_~a~0_226, main_#t~pre6=|v_main_#t~pre6_274|} OutVars{main_~e~0=v_main_~e~0_4233, main_#t~pre7=|v_main_#t~pre7_1131|, main_~c~0=v_main_~c~0_394, main_#t~pre8=|v_main_#t~pre8_2606|, main_~d~0=v_main_~d~0_1432, main_~b~0=v_main_~b~0_301, main_#t~pre4=|v_main_#t~pre4_183|, main_#t~pre5=|v_main_#t~pre5_219|, main_~a~0=v_main_~a~0_225, main_#t~pre6=|v_main_#t~pre6_273|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {18928#(= main_~a~0 0)} is VALID [2022-04-28 04:15:02,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {18928#(= main_~a~0 0)} [155] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {18924#false} is VALID [2022-04-28 04:15:02,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {18924#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {18924#false} is VALID [2022-04-28 04:15:02,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {18924#false} assume !false; {18924#false} is VALID [2022-04-28 04:15:02,904 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 04:15:02,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:15:02,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376172697] [2022-04-28 04:15:02,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376172697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:02,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:02,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:15:04,108 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:15:04,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2013570890] [2022-04-28 04:15:04,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2013570890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:04,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:04,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 04:15:04,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463344310] [2022-04-28 04:15:04,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:15:04,109 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 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 91 [2022-04-28 04:15:04,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:15:04,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 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 04:15:04,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:04,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 04:15:04,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:04,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 04:15:04,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1523, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 04:15:04,169 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 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 04:15:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:08,568 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2022-04-28 04:15:08,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 04:15:08,568 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 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 91 [2022-04-28 04:15:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:15:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 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 04:15:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 150 transitions. [2022-04-28 04:15:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 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 04:15:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 150 transitions. [2022-04-28 04:15:08,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 150 transitions. [2022-04-28 04:15:08,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:08,672 INFO L225 Difference]: With dead ends: 131 [2022-04-28 04:15:08,673 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 04:15:08,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 37 SyntacticMatches, 15 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=591, Invalid=5889, Unknown=0, NotChecked=0, Total=6480 [2022-04-28 04:15:08,674 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 202 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2787 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:15:08,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 74 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2787 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 04:15:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 04:15:08,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2022-04-28 04:15:08,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:15:08,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 96 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 92 states have internal predecessors, (97), 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 04:15:08,729 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 96 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 92 states have internal predecessors, (97), 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 04:15:08,729 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 96 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 92 states have internal predecessors, (97), 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 04:15:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:08,730 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2022-04-28 04:15:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2022-04-28 04:15:08,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:08,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:08,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 92 states have internal predecessors, (97), 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 118 states. [2022-04-28 04:15:08,730 INFO L87 Difference]: Start difference. First operand has 96 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 92 states have internal predecessors, (97), 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 118 states. [2022-04-28 04:15:08,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:08,731 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2022-04-28 04:15:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2022-04-28 04:15:08,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:08,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:08,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:15:08,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:15:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 92 states have internal predecessors, (97), 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 04:15:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2022-04-28 04:15:08,732 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 91 [2022-04-28 04:15:08,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:15:08,733 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2022-04-28 04:15:08,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 41 states have internal predecessors, (88), 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 04:15:08,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 100 transitions. [2022-04-28 04:15:08,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-28 04:15:08,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 04:15:08,969 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:15:08,970 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:15:08,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-28 04:15:08,970 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:15:08,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:15:08,970 INFO L85 PathProgramCache]: Analyzing trace with hash 26105587, now seen corresponding path program 34 times [2022-04-28 04:15:08,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:08,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1383495448] [2022-04-28 04:15:13,178 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:13,225 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:13,306 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:17,390 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:17,438 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:17,530 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:20,176 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:20,224 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:20,306 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:22,943 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:22,991 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:23,073 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:23,238 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:23,238 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:15:23,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1788009463, now seen corresponding path program 1 times [2022-04-28 04:15:23,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:15:23,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899964320] [2022-04-28 04:15:23,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:15:23,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:15:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:23,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:15:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:23,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {19744#(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); {19738#true} is VALID [2022-04-28 04:15:23,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {19738#true} assume true; {19738#true} is VALID [2022-04-28 04:15:23,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19738#true} {19738#true} #80#return; {19738#true} is VALID [2022-04-28 04:15:23,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {19738#true} call ULTIMATE.init(); {19744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:15:23,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {19744#(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); {19738#true} is VALID [2022-04-28 04:15:23,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {19738#true} assume true; {19738#true} is VALID [2022-04-28 04:15:23,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19738#true} {19738#true} #80#return; {19738#true} is VALID [2022-04-28 04:15:23,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {19738#true} call #t~ret9 := main(); {19738#true} is VALID [2022-04-28 04:15:23,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {19738#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {19743#(= main_~a~0 0)} is VALID [2022-04-28 04:15:23,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {19743#(= main_~a~0 0)} [158] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre8_2758| |v_main_#t~pre8_2728|)) (.cse1 (= |v_main_#t~pre5_226| |v_main_#t~pre5_225|)) (.cse2 (= |v_main_#t~pre6_281| |v_main_#t~pre6_280|)) (.cse3 (= v_main_~a~0_232 v_main_~a~0_231)) (.cse4 (= |v_main_#t~pre4_189| |v_main_#t~pre4_188|)) (.cse5 (= v_main_~e~0_4465 v_main_~e~0_4430)) (.cse6 (= |v_main_#t~pre7_1178| |v_main_#t~pre7_1173|)) (.cse7 (= v_main_~c~0_406 v_main_~c~0_404))) (or (and (= v_main_~b~0_311 v_main_~b~0_309) .cse0 .cse1 .cse2 (= v_main_~d~0_1490 v_main_~d~0_1484) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= v_main_~d~0_1484 v_main_~d~0_1490) .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~b~0_309 v_main_~b~0_311)))) InVars {main_~e~0=v_main_~e~0_4465, main_#t~pre7=|v_main_#t~pre7_1178|, main_~c~0=v_main_~c~0_406, main_#t~pre8=|v_main_#t~pre8_2758|, main_~d~0=v_main_~d~0_1490, main_~b~0=v_main_~b~0_311, main_#t~pre4=|v_main_#t~pre4_189|, main_#t~pre5=|v_main_#t~pre5_226|, main_~a~0=v_main_~a~0_232, main_#t~pre6=|v_main_#t~pre6_281|} OutVars{main_~e~0=v_main_~e~0_4430, main_#t~pre7=|v_main_#t~pre7_1173|, main_~c~0=v_main_~c~0_404, main_#t~pre8=|v_main_#t~pre8_2728|, main_~d~0=v_main_~d~0_1484, main_~b~0=v_main_~b~0_309, main_#t~pre4=|v_main_#t~pre4_188|, main_#t~pre5=|v_main_#t~pre5_225|, main_~a~0=v_main_~a~0_231, main_#t~pre6=|v_main_#t~pre6_280|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {19743#(= main_~a~0 0)} is VALID [2022-04-28 04:15:23,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {19743#(= main_~a~0 0)} [157] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {19739#false} is VALID [2022-04-28 04:15:23,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {19739#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {19739#false} is VALID [2022-04-28 04:15:23,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {19739#false} assume !false; {19739#false} is VALID [2022-04-28 04:15:23,271 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 04:15:23,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:15:23,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899964320] [2022-04-28 04:15:23,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899964320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:23,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:23,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:15:24,650 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:15:24,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1383495448] [2022-04-28 04:15:24,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1383495448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:24,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:24,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 04:15:24,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065539137] [2022-04-28 04:15:24,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:15:24,651 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 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 93 [2022-04-28 04:15:24,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:15:24,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 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 04:15:24,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:24,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 04:15:24,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:24,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 04:15:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1602, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 04:15:24,714 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 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 04:15:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:29,203 INFO L93 Difference]: Finished difference Result 132 states and 150 transitions. [2022-04-28 04:15:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 04:15:29,203 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 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 93 [2022-04-28 04:15:29,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:15:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 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 04:15:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 150 transitions. [2022-04-28 04:15:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 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 04:15:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 150 transitions. [2022-04-28 04:15:29,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 150 transitions. [2022-04-28 04:15:29,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:29,307 INFO L225 Difference]: With dead ends: 132 [2022-04-28 04:15:29,307 INFO L226 Difference]: Without dead ends: 119 [2022-04-28 04:15:29,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 29 SyntacticMatches, 24 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=606, Invalid=6200, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 04:15:29,307 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 211 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2976 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 3109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:15:29,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 44 Invalid, 3109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2976 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 04:15:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-28 04:15:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2022-04-28 04:15:29,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:15:29,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 98 states, 94 states have (on average 1.053191489361702) internal successors, (99), 94 states have internal predecessors, (99), 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 04:15:29,362 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 98 states, 94 states have (on average 1.053191489361702) internal successors, (99), 94 states have internal predecessors, (99), 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 04:15:29,363 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 98 states, 94 states have (on average 1.053191489361702) internal successors, (99), 94 states have internal predecessors, (99), 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 04:15:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:29,364 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2022-04-28 04:15:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2022-04-28 04:15:29,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:29,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:29,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 94 states have (on average 1.053191489361702) internal successors, (99), 94 states have internal predecessors, (99), 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 119 states. [2022-04-28 04:15:29,364 INFO L87 Difference]: Start difference. First operand has 98 states, 94 states have (on average 1.053191489361702) internal successors, (99), 94 states have internal predecessors, (99), 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 119 states. [2022-04-28 04:15:29,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:29,365 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2022-04-28 04:15:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2022-04-28 04:15:29,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:29,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:29,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:15:29,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:15:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.053191489361702) internal successors, (99), 94 states have internal predecessors, (99), 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 04:15:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2022-04-28 04:15:29,366 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 93 [2022-04-28 04:15:29,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:15:29,366 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2022-04-28 04:15:29,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 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 04:15:29,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 102 transitions. [2022-04-28 04:15:29,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2022-04-28 04:15:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-28 04:15:29,598 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:15:29,598 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:15:29,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-28 04:15:29,598 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:15:29,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:15:29,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1563785062, now seen corresponding path program 35 times [2022-04-28 04:15:29,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:29,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1594340481] [2022-04-28 04:15:29,838 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:29,917 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:30,019 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:30,100 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:30,196 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:30,276 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:30,373 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:30,454 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:30,635 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:30,635 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:15:30,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1788070967, now seen corresponding path program 1 times [2022-04-28 04:15:30,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:15:30,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904589018] [2022-04-28 04:15:30,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:15:30,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:15:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:30,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:15:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:30,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {20570#(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); {20564#true} is VALID [2022-04-28 04:15:30,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {20564#true} assume true; {20564#true} is VALID [2022-04-28 04:15:30,658 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20564#true} {20564#true} #80#return; {20564#true} is VALID [2022-04-28 04:15:30,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {20564#true} call ULTIMATE.init(); {20570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:15:30,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {20570#(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); {20564#true} is VALID [2022-04-28 04:15:30,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {20564#true} assume true; {20564#true} is VALID [2022-04-28 04:15:30,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20564#true} {20564#true} #80#return; {20564#true} is VALID [2022-04-28 04:15:30,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {20564#true} call #t~ret9 := main(); {20564#true} is VALID [2022-04-28 04:15:30,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {20564#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {20569#(= main_~a~0 0)} is VALID [2022-04-28 04:15:30,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {20569#(= main_~a~0 0)} [160] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_232| |v_main_#t~pre5_231|)) (.cse1 (= v_main_~b~0_319 v_main_~b~0_317)) (.cse2 (= v_main_~a~0_238 v_main_~a~0_237)) (.cse3 (= |v_main_#t~pre4_194| |v_main_#t~pre4_193|)) (.cse4 (= v_main_~c~0_416 v_main_~c~0_414)) (.cse5 (= |v_main_#t~pre6_288| |v_main_#t~pre6_287|)) (.cse6 (= |v_main_#t~pre8_2881| |v_main_#t~pre8_2851|)) (.cse7 (= v_main_~e~0_4668 v_main_~e~0_4632))) (or (and .cse0 (= v_main_~d~0_1541 v_main_~d~0_1548) .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre7_1218| |v_main_#t~pre7_1224|) .cse5 .cse6 .cse7) (and .cse0 (= |v_main_#t~pre7_1224| |v_main_#t~pre7_1218|) .cse1 .cse2 .cse3 .cse4 (= v_main_~d~0_1548 v_main_~d~0_1541) .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_4668, main_#t~pre7=|v_main_#t~pre7_1224|, main_~c~0=v_main_~c~0_416, main_#t~pre8=|v_main_#t~pre8_2881|, main_~d~0=v_main_~d~0_1548, main_~b~0=v_main_~b~0_319, main_#t~pre4=|v_main_#t~pre4_194|, main_#t~pre5=|v_main_#t~pre5_232|, main_~a~0=v_main_~a~0_238, main_#t~pre6=|v_main_#t~pre6_288|} OutVars{main_~e~0=v_main_~e~0_4632, main_#t~pre7=|v_main_#t~pre7_1218|, main_~c~0=v_main_~c~0_414, main_#t~pre8=|v_main_#t~pre8_2851|, main_~d~0=v_main_~d~0_1541, main_~b~0=v_main_~b~0_317, main_#t~pre4=|v_main_#t~pre4_193|, main_#t~pre5=|v_main_#t~pre5_231|, main_~a~0=v_main_~a~0_237, main_#t~pre6=|v_main_#t~pre6_287|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {20569#(= main_~a~0 0)} is VALID [2022-04-28 04:15:30,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {20569#(= main_~a~0 0)} [159] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {20565#false} is VALID [2022-04-28 04:15:30,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {20565#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {20565#false} is VALID [2022-04-28 04:15:30,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {20565#false} assume !false; {20565#false} is VALID [2022-04-28 04:15:30,660 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 04:15:30,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:15:30,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904589018] [2022-04-28 04:15:30,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904589018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:30,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:30,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:15:31,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:15:31,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1594340481] [2022-04-28 04:15:31,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1594340481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:31,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:31,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 04:15:31,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593240717] [2022-04-28 04:15:31,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:15:31,997 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 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 96 [2022-04-28 04:15:31,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:15:31,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 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 04:15:32,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:32,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 04:15:32,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:32,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 04:15:32,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1683, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 04:15:32,059 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 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 04:15:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:36,680 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2022-04-28 04:15:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 04:15:36,680 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 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 96 [2022-04-28 04:15:36,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:15:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 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 04:15:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 152 transitions. [2022-04-28 04:15:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 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 04:15:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 152 transitions. [2022-04-28 04:15:36,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 152 transitions. [2022-04-28 04:15:36,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:36,789 INFO L225 Difference]: With dead ends: 134 [2022-04-28 04:15:36,789 INFO L226 Difference]: Without dead ends: 121 [2022-04-28 04:15:36,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 32 SyntacticMatches, 23 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=621, Invalid=6519, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 04:15:36,790 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 215 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 3121 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 3121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:15:36,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 49 Invalid, 3257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 3121 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 04:15:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-28 04:15:36,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2022-04-28 04:15:36,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:15:36,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 99 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 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 04:15:36,844 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 99 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 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 04:15:36,844 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 99 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 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 04:15:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:36,846 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2022-04-28 04:15:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2022-04-28 04:15:36,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:36,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:36,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 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 121 states. [2022-04-28 04:15:36,846 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 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 121 states. [2022-04-28 04:15:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:36,847 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2022-04-28 04:15:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2022-04-28 04:15:36,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:36,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:36,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:15:36,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:15:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 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 04:15:36,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2022-04-28 04:15:36,848 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 96 [2022-04-28 04:15:36,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:15:36,848 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2022-04-28 04:15:36,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 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 04:15:36,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 103 transitions. [2022-04-28 04:15:37,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2022-04-28 04:15:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-28 04:15:37,093 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:15:37,093 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:15:37,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-28 04:15:37,093 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:15:37,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:15:37,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1374977144, now seen corresponding path program 36 times [2022-04-28 04:15:37,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:37,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2060344836] [2022-04-28 04:15:37,336 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:37,416 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:37,530 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:37,611 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:37,721 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:37,802 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:37,916 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:37,997 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:38,175 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:38,175 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:15:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1788132471, now seen corresponding path program 1 times [2022-04-28 04:15:38,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:15:38,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807899068] [2022-04-28 04:15:38,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:15:38,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:15:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:38,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:15:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:38,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {21409#(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); {21403#true} is VALID [2022-04-28 04:15:38,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {21403#true} assume true; {21403#true} is VALID [2022-04-28 04:15:38,206 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21403#true} {21403#true} #80#return; {21403#true} is VALID [2022-04-28 04:15:38,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {21403#true} call ULTIMATE.init(); {21409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:15:38,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {21409#(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); {21403#true} is VALID [2022-04-28 04:15:38,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {21403#true} assume true; {21403#true} is VALID [2022-04-28 04:15:38,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21403#true} {21403#true} #80#return; {21403#true} is VALID [2022-04-28 04:15:38,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {21403#true} call #t~ret9 := main(); {21403#true} is VALID [2022-04-28 04:15:38,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {21403#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {21408#(= main_~a~0 0)} is VALID [2022-04-28 04:15:38,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {21408#(= main_~a~0 0)} [162] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_1270| |v_main_#t~pre7_1264|)) (.cse1 (= |v_main_#t~pre5_238| |v_main_#t~pre5_237|)) (.cse2 (= |v_main_#t~pre4_199| |v_main_#t~pre4_198|)) (.cse3 (= v_main_~a~0_244 v_main_~a~0_243)) (.cse4 (= |v_main_#t~pre6_295| |v_main_#t~pre6_294|)) (.cse5 (= v_main_~e~0_4876 v_main_~e~0_4839)) (.cse6 (= v_main_~b~0_327 v_main_~b~0_325)) (.cse7 (= v_main_~c~0_426 v_main_~c~0_424))) (or (and .cse0 (= v_main_~d~0_1606 v_main_~d~0_1599) .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre8_3008| |v_main_#t~pre8_2977|) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~d~0_1599 v_main_~d~0_1606) .cse6 (= |v_main_#t~pre8_2977| |v_main_#t~pre8_3008|) .cse7))) InVars {main_~e~0=v_main_~e~0_4876, main_#t~pre7=|v_main_#t~pre7_1270|, main_~c~0=v_main_~c~0_426, main_#t~pre8=|v_main_#t~pre8_3008|, main_~d~0=v_main_~d~0_1606, main_~b~0=v_main_~b~0_327, main_#t~pre4=|v_main_#t~pre4_199|, main_#t~pre5=|v_main_#t~pre5_238|, main_~a~0=v_main_~a~0_244, main_#t~pre6=|v_main_#t~pre6_295|} OutVars{main_~e~0=v_main_~e~0_4839, main_#t~pre7=|v_main_#t~pre7_1264|, main_~c~0=v_main_~c~0_424, main_#t~pre8=|v_main_#t~pre8_2977|, main_~d~0=v_main_~d~0_1599, main_~b~0=v_main_~b~0_325, main_#t~pre4=|v_main_#t~pre4_198|, main_#t~pre5=|v_main_#t~pre5_237|, main_~a~0=v_main_~a~0_243, main_#t~pre6=|v_main_#t~pre6_294|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {21408#(= main_~a~0 0)} is VALID [2022-04-28 04:15:38,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {21408#(= main_~a~0 0)} [161] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {21404#false} is VALID [2022-04-28 04:15:38,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {21404#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {21404#false} is VALID [2022-04-28 04:15:38,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {21404#false} assume !false; {21404#false} is VALID [2022-04-28 04:15:38,208 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 04:15:38,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:15:38,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807899068] [2022-04-28 04:15:38,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807899068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:38,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:38,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:15:39,423 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:15:39,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2060344836] [2022-04-28 04:15:39,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2060344836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:39,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:39,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 04:15:39,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969043741] [2022-04-28 04:15:39,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:15:39,424 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 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 98 [2022-04-28 04:15:39,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:15:39,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 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 04:15:39,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:39,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 04:15:39,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:39,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 04:15:39,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1766, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 04:15:39,512 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 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 04:15:44,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:44,168 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2022-04-28 04:15:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 04:15:44,168 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 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 98 [2022-04-28 04:15:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:15:44,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 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 04:15:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 154 transitions. [2022-04-28 04:15:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 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 04:15:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 154 transitions. [2022-04-28 04:15:44,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 154 transitions. [2022-04-28 04:15:44,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:44,275 INFO L225 Difference]: With dead ends: 136 [2022-04-28 04:15:44,275 INFO L226 Difference]: Without dead ends: 123 [2022-04-28 04:15:44,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 45 SyntacticMatches, 11 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=636, Invalid=6846, Unknown=0, NotChecked=0, Total=7482 [2022-04-28 04:15:44,276 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 236 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3077 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 3077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:15:44,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 99 Invalid, 3240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 3077 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 04:15:44,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-28 04:15:44,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2022-04-28 04:15:44,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:15:44,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 101 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 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 04:15:44,332 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 101 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 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 04:15:44,332 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 101 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 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 04:15:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:44,333 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2022-04-28 04:15:44,333 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2022-04-28 04:15:44,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:44,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:44,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 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 123 states. [2022-04-28 04:15:44,333 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 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 123 states. [2022-04-28 04:15:44,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:15:44,334 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2022-04-28 04:15:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2022-04-28 04:15:44,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:15:44,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:15:44,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:15:44,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:15:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 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 04:15:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2022-04-28 04:15:44,335 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 98 [2022-04-28 04:15:44,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:15:44,336 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2022-04-28 04:15:44,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 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 04:15:44,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 105 transitions. [2022-04-28 04:15:44,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-28 04:15:44,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 04:15:44,603 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:15:44,603 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:15:44,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-28 04:15:44,604 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:15:44,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:15:44,604 INFO L85 PathProgramCache]: Analyzing trace with hash -563023658, now seen corresponding path program 37 times [2022-04-28 04:15:44,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:44,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [42391221] [2022-04-28 04:15:48,806 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:48,845 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:48,926 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:51,174 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:51,255 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:55,331 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:15:55,371 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:55,452 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:57,683 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:57,773 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:57,963 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:15:57,963 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:15:57,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1788193975, now seen corresponding path program 1 times [2022-04-28 04:15:57,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:15:57,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655605338] [2022-04-28 04:15:57,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:15:57,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:15:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:57,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:15:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:15:57,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {22263#(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); {22257#true} is VALID [2022-04-28 04:15:57,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {22257#true} assume true; {22257#true} is VALID [2022-04-28 04:15:57,985 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22257#true} {22257#true} #80#return; {22257#true} is VALID [2022-04-28 04:15:57,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {22257#true} call ULTIMATE.init(); {22263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:15:57,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {22263#(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); {22257#true} is VALID [2022-04-28 04:15:57,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {22257#true} assume true; {22257#true} is VALID [2022-04-28 04:15:57,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22257#true} {22257#true} #80#return; {22257#true} is VALID [2022-04-28 04:15:57,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {22257#true} call #t~ret9 := main(); {22257#true} is VALID [2022-04-28 04:15:57,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {22257#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {22262#(= main_~a~0 0)} is VALID [2022-04-28 04:15:57,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {22262#(= main_~a~0 0)} [164] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre8_3139| |v_main_#t~pre8_3107|)) (.cse1 (= v_main_~b~0_335 v_main_~b~0_333)) (.cse2 (= |v_main_#t~pre6_302| |v_main_#t~pre6_301|)) (.cse3 (= v_main_~d~0_1664 v_main_~d~0_1657)) (.cse4 (= v_main_~c~0_436 v_main_~c~0_434)) (.cse5 (= |v_main_#t~pre5_244| |v_main_#t~pre5_243|)) (.cse6 (= v_main_~e~0_5089 v_main_~e~0_5051)) (.cse7 (= |v_main_#t~pre4_204| |v_main_#t~pre4_203|))) (or (and .cse0 .cse1 (= |v_main_#t~pre7_1310| |v_main_#t~pre7_1316|) .cse2 .cse3 (= v_main_~a~0_249 v_main_~a~0_250) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~a~0_250 v_main_~a~0_249) (= |v_main_#t~pre7_1316| |v_main_#t~pre7_1310|)))) InVars {main_~e~0=v_main_~e~0_5089, main_#t~pre7=|v_main_#t~pre7_1316|, main_~c~0=v_main_~c~0_436, main_#t~pre8=|v_main_#t~pre8_3139|, main_~d~0=v_main_~d~0_1664, main_~b~0=v_main_~b~0_335, main_#t~pre4=|v_main_#t~pre4_204|, main_#t~pre5=|v_main_#t~pre5_244|, main_~a~0=v_main_~a~0_250, main_#t~pre6=|v_main_#t~pre6_302|} OutVars{main_~e~0=v_main_~e~0_5051, main_#t~pre7=|v_main_#t~pre7_1310|, main_~c~0=v_main_~c~0_434, main_#t~pre8=|v_main_#t~pre8_3107|, main_~d~0=v_main_~d~0_1657, main_~b~0=v_main_~b~0_333, main_#t~pre4=|v_main_#t~pre4_203|, main_#t~pre5=|v_main_#t~pre5_243|, main_~a~0=v_main_~a~0_249, main_#t~pre6=|v_main_#t~pre6_301|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {22262#(= main_~a~0 0)} is VALID [2022-04-28 04:15:57,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {22262#(= main_~a~0 0)} [163] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {22258#false} is VALID [2022-04-28 04:15:57,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {22258#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {22258#false} is VALID [2022-04-28 04:15:57,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {22258#false} assume !false; {22258#false} is VALID [2022-04-28 04:15:57,988 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 04:15:57,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:15:57,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655605338] [2022-04-28 04:15:57,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655605338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:57,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:57,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:15:59,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:15:59,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [42391221] [2022-04-28 04:15:59,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [42391221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:15:59,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:15:59,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 04:15:59,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359883833] [2022-04-28 04:15:59,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:15:59,460 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 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 100 [2022-04-28 04:15:59,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:15:59,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 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 04:15:59,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:15:59,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 04:15:59,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:15:59,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 04:15:59,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1851, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 04:15:59,525 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 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 04:16:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:04,377 INFO L93 Difference]: Finished difference Result 138 states and 156 transitions. [2022-04-28 04:16:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 04:16:04,377 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 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 100 [2022-04-28 04:16:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:16:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 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 04:16:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 156 transitions. [2022-04-28 04:16:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 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 04:16:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 156 transitions. [2022-04-28 04:16:04,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 156 transitions. [2022-04-28 04:16:04,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:04,527 INFO L225 Difference]: With dead ends: 138 [2022-04-28 04:16:04,527 INFO L226 Difference]: Without dead ends: 125 [2022-04-28 04:16:04,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 36 SyntacticMatches, 21 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1435 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=651, Invalid=7181, Unknown=0, NotChecked=0, Total=7832 [2022-04-28 04:16:04,528 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 165 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 3306 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:16:04,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 64 Invalid, 3404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3306 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 04:16:04,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-28 04:16:04,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 103. [2022-04-28 04:16:04,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:16:04,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 103 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 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 04:16:04,586 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 103 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 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 04:16:04,586 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 103 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 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 04:16:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:04,587 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2022-04-28 04:16:04,587 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2022-04-28 04:16:04,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:04,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:04,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 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 125 states. [2022-04-28 04:16:04,587 INFO L87 Difference]: Start difference. First operand has 103 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 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 125 states. [2022-04-28 04:16:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:04,588 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2022-04-28 04:16:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2022-04-28 04:16:04,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:04,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:04,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:16:04,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:16:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 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 04:16:04,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2022-04-28 04:16:04,590 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 100 [2022-04-28 04:16:04,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:16:04,590 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2022-04-28 04:16:04,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 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 04:16:04,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 107 transitions. [2022-04-28 04:16:04,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-04-28 04:16:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 04:16:04,851 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:16:04,851 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:16:04,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-28 04:16:04,851 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:16:04,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:16:04,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1034012084, now seen corresponding path program 38 times [2022-04-28 04:16:04,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:04,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2110310407] [2022-04-28 04:16:05,082 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:05,160 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:05,258 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:05,335 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:05,435 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:05,515 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:05,615 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:05,694 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:05,889 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:05,889 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:16:05,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1788255479, now seen corresponding path program 1 times [2022-04-28 04:16:05,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:16:05,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534403148] [2022-04-28 04:16:05,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:16:05,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:16:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:05,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:16:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:05,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {23132#(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); {23126#true} is VALID [2022-04-28 04:16:05,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {23126#true} assume true; {23126#true} is VALID [2022-04-28 04:16:05,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23126#true} {23126#true} #80#return; {23126#true} is VALID [2022-04-28 04:16:05,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {23126#true} call ULTIMATE.init(); {23132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:16:05,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {23132#(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); {23126#true} is VALID [2022-04-28 04:16:05,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {23126#true} assume true; {23126#true} is VALID [2022-04-28 04:16:05,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23126#true} {23126#true} #80#return; {23126#true} is VALID [2022-04-28 04:16:05,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {23126#true} call #t~ret9 := main(); {23126#true} is VALID [2022-04-28 04:16:05,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {23126#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {23131#(= main_~a~0 0)} is VALID [2022-04-28 04:16:05,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {23131#(= main_~a~0 0)} [166] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~e~0_5307 v_main_~e~0_5268)) (.cse1 (= v_main_~a~0_256 v_main_~a~0_255)) (.cse2 (= |v_main_#t~pre5_250| |v_main_#t~pre5_249|)) (.cse3 (= v_main_~c~0_446 v_main_~c~0_444)) (.cse4 (= v_main_~b~0_343 v_main_~b~0_341)) (.cse5 (= |v_main_#t~pre4_209| |v_main_#t~pre4_208|)) (.cse6 (= |v_main_#t~pre6_309| |v_main_#t~pre6_308|)) (.cse7 (= v_main_~d~0_1722 v_main_~d~0_1715)) (.cse8 (= |v_main_#t~pre8_3274| |v_main_#t~pre8_3241|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |v_main_#t~pre7_1362| |v_main_#t~pre7_1356|) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre7_1356| |v_main_#t~pre7_1362|) .cse5 .cse6 .cse7 .cse8))) InVars {main_~e~0=v_main_~e~0_5307, main_#t~pre7=|v_main_#t~pre7_1362|, main_~c~0=v_main_~c~0_446, main_#t~pre8=|v_main_#t~pre8_3274|, main_~d~0=v_main_~d~0_1722, main_~b~0=v_main_~b~0_343, main_#t~pre4=|v_main_#t~pre4_209|, main_#t~pre5=|v_main_#t~pre5_250|, main_~a~0=v_main_~a~0_256, main_#t~pre6=|v_main_#t~pre6_309|} OutVars{main_~e~0=v_main_~e~0_5268, main_#t~pre7=|v_main_#t~pre7_1356|, main_~c~0=v_main_~c~0_444, main_#t~pre8=|v_main_#t~pre8_3241|, main_~d~0=v_main_~d~0_1715, main_~b~0=v_main_~b~0_341, main_#t~pre4=|v_main_#t~pre4_208|, main_#t~pre5=|v_main_#t~pre5_249|, main_~a~0=v_main_~a~0_255, main_#t~pre6=|v_main_#t~pre6_308|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {23131#(= main_~a~0 0)} is VALID [2022-04-28 04:16:05,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {23131#(= main_~a~0 0)} [165] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {23127#false} is VALID [2022-04-28 04:16:05,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {23127#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {23127#false} is VALID [2022-04-28 04:16:05,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {23127#false} assume !false; {23127#false} is VALID [2022-04-28 04:16:05,918 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 04:16:05,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:16:05,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534403148] [2022-04-28 04:16:05,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534403148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:05,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:05,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:16:07,352 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:16:07,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2110310407] [2022-04-28 04:16:07,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2110310407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:07,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:07,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 04:16:07,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251715030] [2022-04-28 04:16:07,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:16:07,353 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 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 102 [2022-04-28 04:16:07,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:16:07,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 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 04:16:07,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:07,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 04:16:07,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:07,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 04:16:07,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1938, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 04:16:07,431 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 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 04:16:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:12,453 INFO L93 Difference]: Finished difference Result 140 states and 158 transitions. [2022-04-28 04:16:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 04:16:12,453 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 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 102 [2022-04-28 04:16:12,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:16:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 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 04:16:12,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 158 transitions. [2022-04-28 04:16:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 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 04:16:12,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 158 transitions. [2022-04-28 04:16:12,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 158 transitions. [2022-04-28 04:16:12,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:12,563 INFO L225 Difference]: With dead ends: 140 [2022-04-28 04:16:12,564 INFO L226 Difference]: Without dead ends: 127 [2022-04-28 04:16:12,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 41 SyntacticMatches, 17 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1477 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=666, Invalid=7524, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 04:16:12,564 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 208 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 3351 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 3484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 3351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:16:12,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 144 Invalid, 3484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 3351 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 04:16:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-28 04:16:12,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2022-04-28 04:16:12,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:16:12,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 105 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 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 04:16:12,629 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 105 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 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 04:16:12,629 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 105 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 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 04:16:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:12,630 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2022-04-28 04:16:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2022-04-28 04:16:12,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:12,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:12,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 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 127 states. [2022-04-28 04:16:12,631 INFO L87 Difference]: Start difference. First operand has 105 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 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 127 states. [2022-04-28 04:16:12,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:12,632 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2022-04-28 04:16:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2022-04-28 04:16:12,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:12,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:12,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:16:12,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:16:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 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 04:16:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2022-04-28 04:16:12,633 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 102 [2022-04-28 04:16:12,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:16:12,633 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2022-04-28 04:16:12,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 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 04:16:12,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 109 transitions. [2022-04-28 04:16:12,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:12,918 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-04-28 04:16:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-28 04:16:12,919 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:16:12,919 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:16:12,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-28 04:16:12,919 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:16:12,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:16:12,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1812931822, now seen corresponding path program 39 times [2022-04-28 04:16:12,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:12,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [347230523] [2022-04-28 04:16:17,142 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:17,182 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:17,263 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:20,749 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:20,789 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:20,869 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:24,945 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:24,985 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:25,065 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:29,142 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:16:29,182 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:29,265 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:29,464 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:29,465 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:16:29,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1788316983, now seen corresponding path program 1 times [2022-04-28 04:16:29,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:16:29,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915270530] [2022-04-28 04:16:29,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:16:29,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:16:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:29,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:16:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:29,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {24016#(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); {24010#true} is VALID [2022-04-28 04:16:29,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {24010#true} assume true; {24010#true} is VALID [2022-04-28 04:16:29,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24010#true} {24010#true} #80#return; {24010#true} is VALID [2022-04-28 04:16:29,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {24010#true} call ULTIMATE.init(); {24016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:16:29,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {24016#(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); {24010#true} is VALID [2022-04-28 04:16:29,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {24010#true} assume true; {24010#true} is VALID [2022-04-28 04:16:29,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24010#true} {24010#true} #80#return; {24010#true} is VALID [2022-04-28 04:16:29,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {24010#true} call #t~ret9 := main(); {24010#true} is VALID [2022-04-28 04:16:29,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {24010#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {24015#(= main_~a~0 0)} is VALID [2022-04-28 04:16:29,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {24015#(= main_~a~0 0)} [168] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_256| |v_main_#t~pre5_255|)) (.cse1 (= v_main_~c~0_456 v_main_~c~0_454)) (.cse2 (= v_main_~a~0_262 v_main_~a~0_261)) (.cse3 (= |v_main_#t~pre4_214| |v_main_#t~pre4_213|)) (.cse4 (= |v_main_#t~pre6_316| |v_main_#t~pre6_315|)) (.cse5 (= |v_main_#t~pre7_1408| |v_main_#t~pre7_1402|)) (.cse6 (= |v_main_#t~pre8_3413| |v_main_#t~pre8_3379|)) (.cse7 (= v_main_~d~0_1780 v_main_~d~0_1773)) (.cse8 (= v_main_~e~0_5530 v_main_~e~0_5490))) (or (and .cse0 .cse1 (= v_main_~b~0_349 v_main_~b~0_351) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (= v_main_~b~0_351 v_main_~b~0_349) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) InVars {main_~e~0=v_main_~e~0_5530, main_#t~pre7=|v_main_#t~pre7_1408|, main_~c~0=v_main_~c~0_456, main_#t~pre8=|v_main_#t~pre8_3413|, main_~d~0=v_main_~d~0_1780, main_~b~0=v_main_~b~0_351, main_#t~pre4=|v_main_#t~pre4_214|, main_#t~pre5=|v_main_#t~pre5_256|, main_~a~0=v_main_~a~0_262, main_#t~pre6=|v_main_#t~pre6_316|} OutVars{main_~e~0=v_main_~e~0_5490, main_#t~pre7=|v_main_#t~pre7_1402|, main_~c~0=v_main_~c~0_454, main_#t~pre8=|v_main_#t~pre8_3379|, main_~d~0=v_main_~d~0_1773, main_~b~0=v_main_~b~0_349, main_#t~pre4=|v_main_#t~pre4_213|, main_#t~pre5=|v_main_#t~pre5_255|, main_~a~0=v_main_~a~0_261, main_#t~pre6=|v_main_#t~pre6_315|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {24015#(= main_~a~0 0)} is VALID [2022-04-28 04:16:29,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {24015#(= main_~a~0 0)} [167] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {24011#false} is VALID [2022-04-28 04:16:29,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {24011#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {24011#false} is VALID [2022-04-28 04:16:29,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {24011#false} assume !false; {24011#false} is VALID [2022-04-28 04:16:29,490 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 04:16:29,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:16:29,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915270530] [2022-04-28 04:16:29,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915270530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:29,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:29,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:16:30,917 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:16:30,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [347230523] [2022-04-28 04:16:30,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [347230523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:30,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:30,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 04:16:30,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075228938] [2022-04-28 04:16:30,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:16:30,918 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 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 104 [2022-04-28 04:16:30,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:16:30,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 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 04:16:30,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:30,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 04:16:30,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:30,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 04:16:30,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2027, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 04:16:30,987 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 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 04:16:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:36,051 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2022-04-28 04:16:36,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 04:16:36,051 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 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 104 [2022-04-28 04:16:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:16:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 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 04:16:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 160 transitions. [2022-04-28 04:16:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 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 04:16:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 160 transitions. [2022-04-28 04:16:36,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 160 transitions. [2022-04-28 04:16:36,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:36,163 INFO L225 Difference]: With dead ends: 142 [2022-04-28 04:16:36,163 INFO L226 Difference]: Without dead ends: 129 [2022-04-28 04:16:36,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 41 SyntacticMatches, 18 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1513 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=681, Invalid=7875, Unknown=0, NotChecked=0, Total=8556 [2022-04-28 04:16:36,164 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 179 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3335 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 3438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:16:36,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 24 Invalid, 3438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3335 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 04:16:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-28 04:16:36,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 107. [2022-04-28 04:16:36,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:16:36,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 107 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 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 04:16:36,230 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 107 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 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 04:16:36,230 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 107 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 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 04:16:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:36,231 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2022-04-28 04:16:36,231 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2022-04-28 04:16:36,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:36,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:36,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 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 129 states. [2022-04-28 04:16:36,232 INFO L87 Difference]: Start difference. First operand has 107 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 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 129 states. [2022-04-28 04:16:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:36,233 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2022-04-28 04:16:36,233 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2022-04-28 04:16:36,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:36,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:36,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:16:36,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:16:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 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 04:16:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2022-04-28 04:16:36,234 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 104 [2022-04-28 04:16:36,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:16:36,234 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2022-04-28 04:16:36,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 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 04:16:36,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 111 transitions. [2022-04-28 04:16:36,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-04-28 04:16:36,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 04:16:36,511 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:16:36,511 INFO L195 NwaCegarLoop]: trace histogram [35, 35, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:16:36,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-28 04:16:36,512 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:16:36,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:16:36,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1831857936, now seen corresponding path program 40 times [2022-04-28 04:16:36,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:36,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [665142226] [2022-04-28 04:16:36,771 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:36,859 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:36,966 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:37,048 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:37,148 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:37,228 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:37,329 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:37,411 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:37,627 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:37,628 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:16:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1788378487, now seen corresponding path program 1 times [2022-04-28 04:16:37,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:16:37,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640885160] [2022-04-28 04:16:37,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:16:37,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:16:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:37,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:16:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:37,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {24915#(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); {24909#true} is VALID [2022-04-28 04:16:37,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {24909#true} assume true; {24909#true} is VALID [2022-04-28 04:16:37,649 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24909#true} {24909#true} #80#return; {24909#true} is VALID [2022-04-28 04:16:37,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {24909#true} call ULTIMATE.init(); {24915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:16:37,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {24915#(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); {24909#true} is VALID [2022-04-28 04:16:37,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {24909#true} assume true; {24909#true} is VALID [2022-04-28 04:16:37,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24909#true} {24909#true} #80#return; {24909#true} is VALID [2022-04-28 04:16:37,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {24909#true} call #t~ret9 := main(); {24909#true} is VALID [2022-04-28 04:16:37,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {24909#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {24914#(= main_~a~0 0)} is VALID [2022-04-28 04:16:37,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {24914#(= main_~a~0 0)} [170] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre8_3556| |v_main_#t~pre8_3521|)) (.cse1 (= v_main_~e~0_5758 v_main_~e~0_5717)) (.cse2 (= |v_main_#t~pre4_219| |v_main_#t~pre4_218|)) (.cse3 (= v_main_~a~0_268 v_main_~a~0_267)) (.cse4 (= |v_main_#t~pre5_262| |v_main_#t~pre5_261|)) (.cse5 (= v_main_~b~0_359 v_main_~b~0_357)) (.cse6 (= v_main_~c~0_466 v_main_~c~0_464)) (.cse7 (= |v_main_#t~pre6_323| |v_main_#t~pre6_322|))) (or (and .cse0 (= |v_main_#t~pre7_1448| |v_main_#t~pre7_1454|) .cse1 .cse2 .cse3 (= v_main_~d~0_1831 v_main_~d~0_1838) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre7_1454| |v_main_#t~pre7_1448|) .cse5 (= v_main_~d~0_1838 v_main_~d~0_1831) .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_5758, main_#t~pre7=|v_main_#t~pre7_1454|, main_~c~0=v_main_~c~0_466, main_#t~pre8=|v_main_#t~pre8_3556|, main_~d~0=v_main_~d~0_1838, main_~b~0=v_main_~b~0_359, main_#t~pre4=|v_main_#t~pre4_219|, main_#t~pre5=|v_main_#t~pre5_262|, main_~a~0=v_main_~a~0_268, main_#t~pre6=|v_main_#t~pre6_323|} OutVars{main_~e~0=v_main_~e~0_5717, main_#t~pre7=|v_main_#t~pre7_1448|, main_~c~0=v_main_~c~0_464, main_#t~pre8=|v_main_#t~pre8_3521|, main_~d~0=v_main_~d~0_1831, main_~b~0=v_main_~b~0_357, main_#t~pre4=|v_main_#t~pre4_218|, main_#t~pre5=|v_main_#t~pre5_261|, main_~a~0=v_main_~a~0_267, main_#t~pre6=|v_main_#t~pre6_322|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {24914#(= main_~a~0 0)} is VALID [2022-04-28 04:16:37,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {24914#(= main_~a~0 0)} [169] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {24910#false} is VALID [2022-04-28 04:16:37,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {24910#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {24910#false} is VALID [2022-04-28 04:16:37,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {24910#false} assume !false; {24910#false} is VALID [2022-04-28 04:16:37,651 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 04:16:37,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:16:37,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640885160] [2022-04-28 04:16:37,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640885160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:37,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:37,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:16:39,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:16:39,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [665142226] [2022-04-28 04:16:39,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [665142226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:39,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:39,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 04:16:39,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351829867] [2022-04-28 04:16:39,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:16:39,224 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 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 106 [2022-04-28 04:16:39,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:16:39,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 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 04:16:39,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:39,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 04:16:39,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:39,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 04:16:39,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2118, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 04:16:39,291 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 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 04:16:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:44,924 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2022-04-28 04:16:44,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 04:16:44,924 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 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 106 [2022-04-28 04:16:44,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:16:44,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 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 04:16:44,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 165 transitions. [2022-04-28 04:16:44,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 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 04:16:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 165 transitions. [2022-04-28 04:16:44,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 165 transitions. [2022-04-28 04:16:45,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:45,038 INFO L225 Difference]: With dead ends: 146 [2022-04-28 04:16:45,038 INFO L226 Difference]: Without dead ends: 133 [2022-04-28 04:16:45,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 43 SyntacticMatches, 17 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1578 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=696, Invalid=8234, Unknown=0, NotChecked=0, Total=8930 [2022-04-28 04:16:45,039 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 173 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3795 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 3795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:16:45,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 99 Invalid, 3903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 3795 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 04:16:45,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-28 04:16:45,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2022-04-28 04:16:45,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:16:45,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 111 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 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 04:16:45,107 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 111 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 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 04:16:45,107 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 111 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 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 04:16:45,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:45,108 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2022-04-28 04:16:45,108 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2022-04-28 04:16:45,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:45,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:45,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 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 133 states. [2022-04-28 04:16:45,109 INFO L87 Difference]: Start difference. First operand has 111 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 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 133 states. [2022-04-28 04:16:45,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:45,110 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2022-04-28 04:16:45,110 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2022-04-28 04:16:45,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:45,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:45,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:16:45,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:16:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 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 04:16:45,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2022-04-28 04:16:45,111 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 106 [2022-04-28 04:16:45,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:16:45,111 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2022-04-28 04:16:45,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 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 04:16:45,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 115 transitions. [2022-04-28 04:16:45,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-04-28 04:16:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 04:16:45,418 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:16:45,418 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:16:45,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-04-28 04:16:45,418 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:16:45,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:16:45,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1454982990, now seen corresponding path program 41 times [2022-04-28 04:16:45,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:45,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [930015950] [2022-04-28 04:16:46,184 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:46,264 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:46,361 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:46,441 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:46,538 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:46,619 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:46,718 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:46,797 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:46,971 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:46,972 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:16:46,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1788439991, now seen corresponding path program 1 times [2022-04-28 04:16:46,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:16:46,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283866672] [2022-04-28 04:16:46,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:16:46,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:16:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:46,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:16:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:47,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {25841#(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); {25835#true} is VALID [2022-04-28 04:16:47,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {25835#true} assume true; {25835#true} is VALID [2022-04-28 04:16:47,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25835#true} {25835#true} #80#return; {25835#true} is VALID [2022-04-28 04:16:47,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {25835#true} call ULTIMATE.init(); {25841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:16:47,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {25841#(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); {25835#true} is VALID [2022-04-28 04:16:47,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {25835#true} assume true; {25835#true} is VALID [2022-04-28 04:16:47,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25835#true} {25835#true} #80#return; {25835#true} is VALID [2022-04-28 04:16:47,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {25835#true} call #t~ret9 := main(); {25835#true} is VALID [2022-04-28 04:16:47,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {25835#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {25840#(= main_~a~0 0)} is VALID [2022-04-28 04:16:47,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {25840#(= main_~a~0 0)} [172] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_476 v_main_~c~0_474)) (.cse1 (= |v_main_#t~pre5_268| |v_main_#t~pre5_267|)) (.cse2 (= |v_main_#t~pre6_330| |v_main_#t~pre6_329|)) (.cse3 (= v_main_~a~0_274 v_main_~a~0_273)) (.cse4 (= |v_main_#t~pre8_3697| |v_main_#t~pre8_3661|)) (.cse5 (= |v_main_#t~pre7_1499| |v_main_#t~pre7_1493|)) (.cse6 (= v_main_~b~0_367 v_main_~b~0_365)) (.cse7 (= |v_main_#t~pre4_224| |v_main_#t~pre4_223|)) (.cse8 (= v_main_~e~0_5984 v_main_~e~0_5942))) (or (and .cse0 .cse1 .cse2 (= v_main_~d~0_1894 v_main_~d~0_1887) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= v_main_~d~0_1887 v_main_~d~0_1894)))) InVars {main_~e~0=v_main_~e~0_5984, main_#t~pre7=|v_main_#t~pre7_1499|, main_~c~0=v_main_~c~0_476, main_#t~pre8=|v_main_#t~pre8_3697|, main_~d~0=v_main_~d~0_1894, main_~b~0=v_main_~b~0_367, main_#t~pre4=|v_main_#t~pre4_224|, main_#t~pre5=|v_main_#t~pre5_268|, main_~a~0=v_main_~a~0_274, main_#t~pre6=|v_main_#t~pre6_330|} OutVars{main_~e~0=v_main_~e~0_5942, main_#t~pre7=|v_main_#t~pre7_1493|, main_~c~0=v_main_~c~0_474, main_#t~pre8=|v_main_#t~pre8_3661|, main_~d~0=v_main_~d~0_1887, main_~b~0=v_main_~b~0_365, main_#t~pre4=|v_main_#t~pre4_223|, main_#t~pre5=|v_main_#t~pre5_267|, main_~a~0=v_main_~a~0_273, main_#t~pre6=|v_main_#t~pre6_329|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {25840#(= main_~a~0 0)} is VALID [2022-04-28 04:16:47,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {25840#(= main_~a~0 0)} [171] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {25836#false} is VALID [2022-04-28 04:16:47,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {25836#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {25836#false} is VALID [2022-04-28 04:16:47,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {25836#false} assume !false; {25836#false} is VALID [2022-04-28 04:16:47,002 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 04:16:47,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:16:47,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283866672] [2022-04-28 04:16:47,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283866672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:47,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:47,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:16:48,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:16:48,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [930015950] [2022-04-28 04:16:48,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [930015950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:48,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:48,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 04:16:48,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433802427] [2022-04-28 04:16:48,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:16:48,810 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 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 108 [2022-04-28 04:16:48,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:16:48,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 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 04:16:48,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:48,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 04:16:48,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:48,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 04:16:48,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2307, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 04:16:48,880 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 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 04:16:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:55,064 INFO L93 Difference]: Finished difference Result 144 states and 161 transitions. [2022-04-28 04:16:55,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 04:16:55,064 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 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 108 [2022-04-28 04:16:55,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:16:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 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 04:16:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 161 transitions. [2022-04-28 04:16:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 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 04:16:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 161 transitions. [2022-04-28 04:16:55,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 161 transitions. [2022-04-28 04:16:55,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:55,178 INFO L225 Difference]: With dead ends: 144 [2022-04-28 04:16:55,178 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 04:16:55,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 36 SyntacticMatches, 24 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1827 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=723, Invalid=8979, Unknown=0, NotChecked=0, Total=9702 [2022-04-28 04:16:55,179 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 162 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4257 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 4366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 4257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:16:55,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 38 Invalid, 4366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 4257 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 04:16:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 04:16:55,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 115. [2022-04-28 04:16:55,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:16:55,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 115 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 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 04:16:55,250 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 115 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 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 04:16:55,250 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 115 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 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 04:16:55,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:55,251 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2022-04-28 04:16:55,252 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2022-04-28 04:16:55,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:55,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:55,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 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 131 states. [2022-04-28 04:16:55,252 INFO L87 Difference]: Start difference. First operand has 115 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 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 131 states. [2022-04-28 04:16:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:16:55,253 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2022-04-28 04:16:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2022-04-28 04:16:55,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:16:55,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:16:55,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:16:55,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:16:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 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 04:16:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2022-04-28 04:16:55,254 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 108 [2022-04-28 04:16:55,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:16:55,254 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2022-04-28 04:16:55,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 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 04:16:55,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 119 transitions. [2022-04-28 04:16:55,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:55,593 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2022-04-28 04:16:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 04:16:55,594 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:16:55,594 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:16:55,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-04-28 04:16:55,594 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:16:55,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:16:55,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1616358397, now seen corresponding path program 42 times [2022-04-28 04:16:55,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:55,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1089151125] [2022-04-28 04:16:56,453 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:56,532 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:56,637 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:56,717 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:56,819 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:56,901 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:57,016 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:57,099 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:57,310 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:16:57,310 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:16:57,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1788501495, now seen corresponding path program 1 times [2022-04-28 04:16:57,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:16:57,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396349283] [2022-04-28 04:16:57,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:16:57,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:16:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:57,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:16:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:16:57,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {26773#(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); {26767#true} is VALID [2022-04-28 04:16:57,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {26767#true} assume true; {26767#true} is VALID [2022-04-28 04:16:57,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26767#true} {26767#true} #80#return; {26767#true} is VALID [2022-04-28 04:16:57,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {26767#true} call ULTIMATE.init(); {26773#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:16:57,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {26773#(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); {26767#true} is VALID [2022-04-28 04:16:57,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {26767#true} assume true; {26767#true} is VALID [2022-04-28 04:16:57,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26767#true} {26767#true} #80#return; {26767#true} is VALID [2022-04-28 04:16:57,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {26767#true} call #t~ret9 := main(); {26767#true} is VALID [2022-04-28 04:16:57,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {26767#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {26772#(= main_~a~0 0)} is VALID [2022-04-28 04:16:57,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {26772#(= main_~a~0 0)} [174] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre8_3838| |v_main_#t~pre8_3802|)) (.cse1 (= v_main_~b~0_375 v_main_~b~0_373)) (.cse2 (= |v_main_#t~pre5_274| |v_main_#t~pre5_273|)) (.cse3 (= v_main_~e~0_6211 v_main_~e~0_6169)) (.cse4 (= v_main_~c~0_493 v_main_~c~0_490)) (.cse5 (= |v_main_#t~pre4_229| |v_main_#t~pre4_228|))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_279 v_main_~a~0_280) .cse4 (= v_main_~d~0_1948 v_main_~d~0_1956) (= |v_main_#t~pre7_1538| |v_main_#t~pre7_1544|) (= |v_main_#t~pre6_339| |v_main_#t~pre6_341|) .cse5) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~d~0_1956 v_main_~d~0_1948) (= v_main_~a~0_280 v_main_~a~0_279) .cse4 (= |v_main_#t~pre6_341| |v_main_#t~pre6_339|) .cse5 (= |v_main_#t~pre7_1544| |v_main_#t~pre7_1538|)))) InVars {main_~e~0=v_main_~e~0_6211, main_#t~pre7=|v_main_#t~pre7_1544|, main_~c~0=v_main_~c~0_493, main_#t~pre8=|v_main_#t~pre8_3838|, main_~d~0=v_main_~d~0_1956, main_~b~0=v_main_~b~0_375, main_#t~pre4=|v_main_#t~pre4_229|, main_#t~pre5=|v_main_#t~pre5_274|, main_~a~0=v_main_~a~0_280, main_#t~pre6=|v_main_#t~pre6_341|} OutVars{main_~e~0=v_main_~e~0_6169, main_#t~pre7=|v_main_#t~pre7_1538|, main_~c~0=v_main_~c~0_490, main_#t~pre8=|v_main_#t~pre8_3802|, main_~d~0=v_main_~d~0_1948, main_~b~0=v_main_~b~0_373, main_#t~pre4=|v_main_#t~pre4_228|, main_#t~pre5=|v_main_#t~pre5_273|, main_~a~0=v_main_~a~0_279, main_#t~pre6=|v_main_#t~pre6_339|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {26772#(= main_~a~0 0)} is VALID [2022-04-28 04:16:57,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {26772#(= main_~a~0 0)} [173] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {26768#false} is VALID [2022-04-28 04:16:57,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {26768#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {26768#false} is VALID [2022-04-28 04:16:57,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {26768#false} assume !false; {26768#false} is VALID [2022-04-28 04:16:57,349 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 04:16:57,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:16:57,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396349283] [2022-04-28 04:16:57,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396349283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:57,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:57,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:16:59,192 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:16:59,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1089151125] [2022-04-28 04:16:59,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1089151125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:16:59,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:16:59,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 04:16:59,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479296148] [2022-04-28 04:16:59,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:16:59,196 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 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 111 [2022-04-28 04:16:59,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:16:59,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 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 04:16:59,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:16:59,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 04:16:59,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:16:59,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 04:16:59,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=2405, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 04:16:59,268 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 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 04:17:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:05,578 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2022-04-28 04:17:05,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 04:17:05,578 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 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 111 [2022-04-28 04:17:05,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:17:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 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 04:17:05,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 161 transitions. [2022-04-28 04:17:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 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 04:17:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 161 transitions. [2022-04-28 04:17:05,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 161 transitions. [2022-04-28 04:17:05,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:05,693 INFO L225 Difference]: With dead ends: 145 [2022-04-28 04:17:05,693 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 04:17:05,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 36 SyntacticMatches, 26 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1969 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=735, Invalid=9365, Unknown=0, NotChecked=0, Total=10100 [2022-04-28 04:17:05,694 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 209 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4320 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 4474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 4320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:17:05,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 33 Invalid, 4474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 4320 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 04:17:05,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 04:17:05,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 116. [2022-04-28 04:17:05,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:17:05,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 116 states, 112 states have (on average 1.0446428571428572) internal successors, (117), 112 states have internal predecessors, (117), 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 04:17:05,767 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 116 states, 112 states have (on average 1.0446428571428572) internal successors, (117), 112 states have internal predecessors, (117), 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 04:17:05,767 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 116 states, 112 states have (on average 1.0446428571428572) internal successors, (117), 112 states have internal predecessors, (117), 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 04:17:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:05,768 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2022-04-28 04:17:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-04-28 04:17:05,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:05,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:05,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 112 states have (on average 1.0446428571428572) internal successors, (117), 112 states have internal predecessors, (117), 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 132 states. [2022-04-28 04:17:05,769 INFO L87 Difference]: Start difference. First operand has 116 states, 112 states have (on average 1.0446428571428572) internal successors, (117), 112 states have internal predecessors, (117), 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 132 states. [2022-04-28 04:17:05,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:05,770 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2022-04-28 04:17:05,770 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-04-28 04:17:05,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:05,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:05,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:17:05,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:17:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 112 states have (on average 1.0446428571428572) internal successors, (117), 112 states have internal predecessors, (117), 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 04:17:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2022-04-28 04:17:05,771 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 111 [2022-04-28 04:17:05,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:17:05,771 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2022-04-28 04:17:05,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 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 04:17:05,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 120 transitions. [2022-04-28 04:17:06,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2022-04-28 04:17:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-28 04:17:06,105 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:17:06,105 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:17:06,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-04-28 04:17:06,106 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:17:06,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:17:06,106 INFO L85 PathProgramCache]: Analyzing trace with hash 354070922, now seen corresponding path program 43 times [2022-04-28 04:17:06,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:06,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [980733070] [2022-04-28 04:17:06,984 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:07,073 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:07,109 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:07,191 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:07,291 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:07,389 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:07,489 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:07,594 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:07,694 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:07,901 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:07,902 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:17:07,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1788562999, now seen corresponding path program 1 times [2022-04-28 04:17:07,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:17:07,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793953799] [2022-04-28 04:17:07,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:17:07,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:17:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:07,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:17:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:07,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {27714#(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); {27708#true} is VALID [2022-04-28 04:17:07,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {27708#true} assume true; {27708#true} is VALID [2022-04-28 04:17:07,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27708#true} {27708#true} #80#return; {27708#true} is VALID [2022-04-28 04:17:07,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {27708#true} call ULTIMATE.init(); {27714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:17:07,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {27714#(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); {27708#true} is VALID [2022-04-28 04:17:07,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {27708#true} assume true; {27708#true} is VALID [2022-04-28 04:17:07,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27708#true} {27708#true} #80#return; {27708#true} is VALID [2022-04-28 04:17:07,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {27708#true} call #t~ret9 := main(); {27708#true} is VALID [2022-04-28 04:17:07,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {27708#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {27713#(= main_~a~0 0)} is VALID [2022-04-28 04:17:07,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {27713#(= main_~a~0 0)} [176] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_234| |v_main_#t~pre4_233|)) (.cse1 (= v_main_~a~0_286 v_main_~a~0_285)) (.cse2 (= v_main_~b~0_383 v_main_~b~0_381)) (.cse3 (= |v_main_#t~pre6_368| |v_main_#t~pre6_366|)) (.cse4 (= |v_main_#t~pre8_3974| |v_main_#t~pre8_3938|)) (.cse5 (= v_main_~e~0_6444 v_main_~e~0_6401)) (.cse6 (= v_main_~c~0_527 v_main_~c~0_524))) (or (and .cse0 .cse1 (= v_main_~d~0_2042 v_main_~d~0_2033) .cse2 (= |v_main_#t~pre7_1604| |v_main_#t~pre7_1597|) .cse3 (= |v_main_#t~pre5_280| |v_main_#t~pre5_279|) .cse4 .cse5 .cse6) (and .cse0 (= v_main_~d~0_2033 v_main_~d~0_2042) .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre5_279| |v_main_#t~pre5_280|) (= |v_main_#t~pre7_1597| |v_main_#t~pre7_1604|) .cse6))) InVars {main_~e~0=v_main_~e~0_6444, main_#t~pre7=|v_main_#t~pre7_1604|, main_~c~0=v_main_~c~0_527, main_#t~pre8=|v_main_#t~pre8_3974|, main_~d~0=v_main_~d~0_2042, main_~b~0=v_main_~b~0_383, main_#t~pre4=|v_main_#t~pre4_234|, main_#t~pre5=|v_main_#t~pre5_280|, main_~a~0=v_main_~a~0_286, main_#t~pre6=|v_main_#t~pre6_368|} OutVars{main_~e~0=v_main_~e~0_6401, main_#t~pre7=|v_main_#t~pre7_1597|, main_~c~0=v_main_~c~0_524, main_#t~pre8=|v_main_#t~pre8_3938|, main_~d~0=v_main_~d~0_2033, main_~b~0=v_main_~b~0_381, main_#t~pre4=|v_main_#t~pre4_233|, main_#t~pre5=|v_main_#t~pre5_279|, main_~a~0=v_main_~a~0_285, main_#t~pre6=|v_main_#t~pre6_366|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {27713#(= main_~a~0 0)} is VALID [2022-04-28 04:17:07,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {27713#(= main_~a~0 0)} [175] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {27709#false} is VALID [2022-04-28 04:17:07,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {27709#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {27709#false} is VALID [2022-04-28 04:17:07,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {27709#false} assume !false; {27709#false} is VALID [2022-04-28 04:17:07,935 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 04:17:07,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:17:07,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793953799] [2022-04-28 04:17:07,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793953799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:07,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:07,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:17:09,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:17:09,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [980733070] [2022-04-28 04:17:09,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [980733070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:09,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:09,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 04:17:09,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988473361] [2022-04-28 04:17:09,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:17:09,539 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 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 114 [2022-04-28 04:17:09,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:17:09,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 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 04:17:09,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:09,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 04:17:09,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:09,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 04:17:09,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2505, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 04:17:09,610 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 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 04:17:16,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:16,181 INFO L93 Difference]: Finished difference Result 147 states and 163 transitions. [2022-04-28 04:17:16,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-28 04:17:16,182 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 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 114 [2022-04-28 04:17:16,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:17:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 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 04:17:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 163 transitions. [2022-04-28 04:17:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 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 04:17:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 163 transitions. [2022-04-28 04:17:16,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 163 transitions. [2022-04-28 04:17:16,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:16,301 INFO L225 Difference]: With dead ends: 147 [2022-04-28 04:17:16,301 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 04:17:16,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 49 SyntacticMatches, 15 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2042 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=747, Invalid=9759, Unknown=0, NotChecked=0, Total=10506 [2022-04-28 04:17:16,307 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 209 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4505 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 4664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 4505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:17:16,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 78 Invalid, 4664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 4505 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-28 04:17:16,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 04:17:16,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 117. [2022-04-28 04:17:16,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:17:16,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 117 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 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 04:17:16,384 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 117 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 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 04:17:16,384 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 117 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 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 04:17:16,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:16,385 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-04-28 04:17:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2022-04-28 04:17:16,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:16,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:16,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 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 134 states. [2022-04-28 04:17:16,386 INFO L87 Difference]: Start difference. First operand has 117 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 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 134 states. [2022-04-28 04:17:16,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:16,387 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-04-28 04:17:16,387 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2022-04-28 04:17:16,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:16,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:16,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:17:16,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:17:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 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 04:17:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2022-04-28 04:17:16,388 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 114 [2022-04-28 04:17:16,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:17:16,388 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2022-04-28 04:17:16,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 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 04:17:16,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 121 transitions. [2022-04-28 04:17:16,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2022-04-28 04:17:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 04:17:16,704 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:17:16,704 INFO L195 NwaCegarLoop]: trace histogram [37, 37, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:17:16,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-04-28 04:17:16,705 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:17:16,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:17:16,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1893607784, now seen corresponding path program 44 times [2022-04-28 04:17:16,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:16,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [8830250] [2022-04-28 04:17:17,620 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:17,737 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:17,851 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:17,971 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:18,075 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:18,178 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:18,293 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:18,398 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:18,502 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:18,698 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:18,699 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:17:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1788624503, now seen corresponding path program 1 times [2022-04-28 04:17:18,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:17:18,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706125070] [2022-04-28 04:17:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:17:18,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:17:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:18,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:17:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:18,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {28668#(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); {28662#true} is VALID [2022-04-28 04:17:18,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {28662#true} assume true; {28662#true} is VALID [2022-04-28 04:17:18,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28662#true} {28662#true} #80#return; {28662#true} is VALID [2022-04-28 04:17:18,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {28662#true} call ULTIMATE.init(); {28668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:17:18,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {28668#(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); {28662#true} is VALID [2022-04-28 04:17:18,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {28662#true} assume true; {28662#true} is VALID [2022-04-28 04:17:18,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28662#true} {28662#true} #80#return; {28662#true} is VALID [2022-04-28 04:17:18,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {28662#true} call #t~ret9 := main(); {28662#true} is VALID [2022-04-28 04:17:18,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {28662#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {28667#(= main_~a~0 0)} is VALID [2022-04-28 04:17:18,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {28667#(= main_~a~0 0)} [178] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre8_4115| |v_main_#t~pre8_4078|)) (.cse1 (= v_main_~c~0_563 v_main_~c~0_560)) (.cse2 (= v_main_~a~0_292 v_main_~a~0_291)) (.cse3 (= v_main_~e~0_6690 v_main_~e~0_6646)) (.cse4 (= |v_main_#t~pre6_396| |v_main_#t~pre6_394|)) (.cse5 (= |v_main_#t~pre5_286| |v_main_#t~pre5_285|)) (.cse6 (= |v_main_#t~pre4_239| |v_main_#t~pre4_238|))) (or (and .cse0 .cse1 (= v_main_~b~0_389 v_main_~b~0_391) .cse2 .cse3 (= |v_main_#t~pre7_1658| |v_main_#t~pre7_1665|) .cse4 .cse5 (= v_main_~d~0_2117 v_main_~d~0_2126) .cse6) (and .cse0 (= v_main_~d~0_2126 v_main_~d~0_2117) .cse1 .cse2 .cse3 (= |v_main_#t~pre7_1665| |v_main_#t~pre7_1658|) .cse4 (= v_main_~b~0_391 v_main_~b~0_389) .cse5 .cse6))) InVars {main_~e~0=v_main_~e~0_6690, main_#t~pre7=|v_main_#t~pre7_1665|, main_~c~0=v_main_~c~0_563, main_#t~pre8=|v_main_#t~pre8_4115|, main_~d~0=v_main_~d~0_2126, main_~b~0=v_main_~b~0_391, main_#t~pre4=|v_main_#t~pre4_239|, main_#t~pre5=|v_main_#t~pre5_286|, main_~a~0=v_main_~a~0_292, main_#t~pre6=|v_main_#t~pre6_396|} OutVars{main_~e~0=v_main_~e~0_6646, main_#t~pre7=|v_main_#t~pre7_1658|, main_~c~0=v_main_~c~0_560, main_#t~pre8=|v_main_#t~pre8_4078|, main_~d~0=v_main_~d~0_2117, main_~b~0=v_main_~b~0_389, main_#t~pre4=|v_main_#t~pre4_238|, main_#t~pre5=|v_main_#t~pre5_285|, main_~a~0=v_main_~a~0_291, main_#t~pre6=|v_main_#t~pre6_394|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {28667#(= main_~a~0 0)} is VALID [2022-04-28 04:17:18,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {28667#(= main_~a~0 0)} [177] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {28663#false} is VALID [2022-04-28 04:17:18,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {28663#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {28663#false} is VALID [2022-04-28 04:17:18,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {28663#false} assume !false; {28663#false} is VALID [2022-04-28 04:17:18,743 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 04:17:18,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:17:18,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706125070] [2022-04-28 04:17:18,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706125070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:18,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:18,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:17:20,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:17:20,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [8830250] [2022-04-28 04:17:20,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [8830250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:20,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:20,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-28 04:17:20,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032106149] [2022-04-28 04:17:20,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:17:20,485 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 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 116 [2022-04-28 04:17:20,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:17:20,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 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 04:17:20,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:20,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-28 04:17:20,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:20,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-28 04:17:20,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2607, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 04:17:20,559 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 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 04:17:27,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:27,239 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2022-04-28 04:17:27,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-28 04:17:27,240 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 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 116 [2022-04-28 04:17:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:17:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 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 04:17:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 165 transitions. [2022-04-28 04:17:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 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 04:17:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 165 transitions. [2022-04-28 04:17:27,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 165 transitions. [2022-04-28 04:17:27,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:27,359 INFO L225 Difference]: With dead ends: 149 [2022-04-28 04:17:27,359 INFO L226 Difference]: Without dead ends: 136 [2022-04-28 04:17:27,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 47 SyntacticMatches, 18 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2193 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=759, Invalid=10161, Unknown=0, NotChecked=0, Total=10920 [2022-04-28 04:17:27,360 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 261 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4604 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 4811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 4604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:17:27,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 28 Invalid, 4811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 4604 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-28 04:17:27,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-28 04:17:27,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 119. [2022-04-28 04:17:27,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:17:27,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 119 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 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 04:17:27,436 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 119 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 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 04:17:27,436 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 119 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 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 04:17:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:27,437 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-04-28 04:17:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-04-28 04:17:27,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:27,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:27,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 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 136 states. [2022-04-28 04:17:27,437 INFO L87 Difference]: Start difference. First operand has 119 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 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 136 states. [2022-04-28 04:17:27,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:27,438 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-04-28 04:17:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-04-28 04:17:27,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:27,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:27,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:17:27,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:17:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 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 04:17:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2022-04-28 04:17:27,440 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 116 [2022-04-28 04:17:27,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:17:27,440 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2022-04-28 04:17:27,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 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 04:17:27,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 123 transitions. [2022-04-28 04:17:27,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2022-04-28 04:17:27,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 04:17:27,770 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:17:27,770 INFO L195 NwaCegarLoop]: trace histogram [38, 38, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:17:27,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-04-28 04:17:27,770 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:17:27,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:17:27,770 INFO L85 PathProgramCache]: Analyzing trace with hash -375184954, now seen corresponding path program 45 times [2022-04-28 04:17:27,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:27,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [854370192] [2022-04-28 04:17:32,607 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:32,647 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:32,750 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:32,849 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:36,926 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:36,966 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:37,072 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:37,173 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:41,249 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:17:41,290 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:41,400 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:41,503 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:41,690 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:41,691 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:17:41,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1788686007, now seen corresponding path program 1 times [2022-04-28 04:17:41,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:17:41,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635283884] [2022-04-28 04:17:41,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:17:41,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:17:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:41,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:17:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:41,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {29637#(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); {29631#true} is VALID [2022-04-28 04:17:41,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {29631#true} assume true; {29631#true} is VALID [2022-04-28 04:17:41,710 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29631#true} {29631#true} #80#return; {29631#true} is VALID [2022-04-28 04:17:41,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {29631#true} call ULTIMATE.init(); {29637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:17:41,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {29637#(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); {29631#true} is VALID [2022-04-28 04:17:41,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {29631#true} assume true; {29631#true} is VALID [2022-04-28 04:17:41,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29631#true} {29631#true} #80#return; {29631#true} is VALID [2022-04-28 04:17:41,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {29631#true} call #t~ret9 := main(); {29631#true} is VALID [2022-04-28 04:17:41,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {29631#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {29636#(= main_~a~0 0)} is VALID [2022-04-28 04:17:41,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {29636#(= main_~a~0 0)} [180] L23-3-->L23-4_primed: Formula: (and (= v_main_~c~0_599 v_main_~c~0_596) (= |v_main_#t~pre4_244| |v_main_#t~pre4_243|) (= v_main_~b~0_399 v_main_~b~0_397) (= v_main_~a~0_298 v_main_~a~0_297) (= v_main_~e~0_6941 v_main_~e~0_6896) (= |v_main_#t~pre5_292| |v_main_#t~pre5_291|) (= |v_main_#t~pre8_4260| |v_main_#t~pre8_4222|) (= |v_main_#t~pre7_1726| |v_main_#t~pre7_1719|) (= v_main_~d~0_2210 v_main_~d~0_2201) (= |v_main_#t~pre6_424| |v_main_#t~pre6_422|)) InVars {main_~e~0=v_main_~e~0_6941, main_#t~pre7=|v_main_#t~pre7_1726|, main_~c~0=v_main_~c~0_599, main_#t~pre8=|v_main_#t~pre8_4260|, main_~d~0=v_main_~d~0_2210, main_~b~0=v_main_~b~0_399, main_#t~pre4=|v_main_#t~pre4_244|, main_#t~pre5=|v_main_#t~pre5_292|, main_~a~0=v_main_~a~0_298, main_#t~pre6=|v_main_#t~pre6_424|} OutVars{main_~e~0=v_main_~e~0_6896, main_#t~pre7=|v_main_#t~pre7_1719|, main_~c~0=v_main_~c~0_596, main_#t~pre8=|v_main_#t~pre8_4222|, main_~d~0=v_main_~d~0_2201, main_~b~0=v_main_~b~0_397, main_#t~pre4=|v_main_#t~pre4_243|, main_#t~pre5=|v_main_#t~pre5_291|, main_~a~0=v_main_~a~0_297, main_#t~pre6=|v_main_#t~pre6_422|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {29636#(= main_~a~0 0)} is VALID [2022-04-28 04:17:41,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {29636#(= main_~a~0 0)} [179] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {29632#false} is VALID [2022-04-28 04:17:41,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {29632#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {29632#false} is VALID [2022-04-28 04:17:41,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {29632#false} assume !false; {29632#false} is VALID [2022-04-28 04:17:41,712 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 04:17:41,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:17:41,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635283884] [2022-04-28 04:17:41,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635283884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:41,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:41,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:17:43,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:17:43,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [854370192] [2022-04-28 04:17:43,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [854370192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:43,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:43,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 04:17:43,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809428047] [2022-04-28 04:17:43,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:17:43,511 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 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 118 [2022-04-28 04:17:43,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:17:43,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 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 04:17:43,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:43,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 04:17:43,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:43,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 04:17:43,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2711, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 04:17:43,586 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 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 04:17:49,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:49,905 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2022-04-28 04:17:49,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-28 04:17:49,905 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 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 118 [2022-04-28 04:17:49,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:17:49,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 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 04:17:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 167 transitions. [2022-04-28 04:17:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 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 04:17:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 167 transitions. [2022-04-28 04:17:49,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 167 transitions. [2022-04-28 04:17:50,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:50,021 INFO L225 Difference]: With dead ends: 151 [2022-04-28 04:17:50,021 INFO L226 Difference]: Without dead ends: 138 [2022-04-28 04:17:50,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 41 SyntacticMatches, 25 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2403 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=771, Invalid=10571, Unknown=0, NotChecked=0, Total=11342 [2022-04-28 04:17:50,022 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 180 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4312 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 4434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 4312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:17:50,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 88 Invalid, 4434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 4312 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 04:17:50,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-28 04:17:50,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 121. [2022-04-28 04:17:50,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:17:50,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 121 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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 04:17:50,104 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 121 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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 04:17:50,104 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 121 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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 04:17:50,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:50,106 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2022-04-28 04:17:50,106 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2022-04-28 04:17:50,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:50,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:50,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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 138 states. [2022-04-28 04:17:50,106 INFO L87 Difference]: Start difference. First operand has 121 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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 138 states. [2022-04-28 04:17:50,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:17:50,107 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2022-04-28 04:17:50,107 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2022-04-28 04:17:50,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:17:50,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:17:50,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:17:50,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:17:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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 04:17:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2022-04-28 04:17:50,108 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 118 [2022-04-28 04:17:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:17:50,108 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2022-04-28 04:17:50,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 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 04:17:50,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 125 transitions. [2022-04-28 04:17:50,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-04-28 04:17:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-04-28 04:17:50,456 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:17:50,456 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:17:50,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-04-28 04:17:50,456 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:17:50,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:17:50,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1158380196, now seen corresponding path program 46 times [2022-04-28 04:17:50,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:50,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1186822060] [2022-04-28 04:17:51,371 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:51,470 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:51,570 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:51,682 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:51,782 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:51,882 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:51,994 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:52,118 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:52,218 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:52,410 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:17:52,411 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:17:52,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1788747511, now seen corresponding path program 1 times [2022-04-28 04:17:52,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:17:52,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267214864] [2022-04-28 04:17:52,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:17:52,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:17:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:52,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:17:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:17:52,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {30621#(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); {30615#true} is VALID [2022-04-28 04:17:52,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {30615#true} assume true; {30615#true} is VALID [2022-04-28 04:17:52,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30615#true} {30615#true} #80#return; {30615#true} is VALID [2022-04-28 04:17:52,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {30615#true} call ULTIMATE.init(); {30621#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:17:52,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {30621#(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); {30615#true} is VALID [2022-04-28 04:17:52,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {30615#true} assume true; {30615#true} is VALID [2022-04-28 04:17:52,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30615#true} {30615#true} #80#return; {30615#true} is VALID [2022-04-28 04:17:52,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {30615#true} call #t~ret9 := main(); {30615#true} is VALID [2022-04-28 04:17:52,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {30615#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {30620#(= main_~a~0 0)} is VALID [2022-04-28 04:17:52,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {30620#(= main_~a~0 0)} [182] L23-3-->L23-4_primed: Formula: (and (= v_main_~a~0_304 v_main_~a~0_303) (= v_main_~c~0_635 v_main_~c~0_632) (= v_main_~e~0_7197 v_main_~e~0_7151) (= |v_main_#t~pre4_249| |v_main_#t~pre4_248|) (= |v_main_#t~pre7_1787| |v_main_#t~pre7_1780|) (= v_main_~b~0_407 v_main_~b~0_405) (= v_main_~d~0_2294 v_main_~d~0_2285) (= |v_main_#t~pre8_4409| |v_main_#t~pre8_4370|) (= |v_main_#t~pre5_298| |v_main_#t~pre5_297|) (= |v_main_#t~pre6_452| |v_main_#t~pre6_450|)) InVars {main_~e~0=v_main_~e~0_7197, main_#t~pre7=|v_main_#t~pre7_1787|, main_~c~0=v_main_~c~0_635, main_#t~pre8=|v_main_#t~pre8_4409|, main_~d~0=v_main_~d~0_2294, main_~b~0=v_main_~b~0_407, main_#t~pre4=|v_main_#t~pre4_249|, main_#t~pre5=|v_main_#t~pre5_298|, main_~a~0=v_main_~a~0_304, main_#t~pre6=|v_main_#t~pre6_452|} OutVars{main_~e~0=v_main_~e~0_7151, main_#t~pre7=|v_main_#t~pre7_1780|, main_~c~0=v_main_~c~0_632, main_#t~pre8=|v_main_#t~pre8_4370|, main_~d~0=v_main_~d~0_2285, main_~b~0=v_main_~b~0_405, main_#t~pre4=|v_main_#t~pre4_248|, main_#t~pre5=|v_main_#t~pre5_297|, main_~a~0=v_main_~a~0_303, main_#t~pre6=|v_main_#t~pre6_450|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {30620#(= main_~a~0 0)} is VALID [2022-04-28 04:17:52,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {30620#(= main_~a~0 0)} [181] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {30616#false} is VALID [2022-04-28 04:17:52,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {30616#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {30616#false} is VALID [2022-04-28 04:17:52,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {30616#false} assume !false; {30616#false} is VALID [2022-04-28 04:17:52,431 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 04:17:52,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:17:52,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267214864] [2022-04-28 04:17:52,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267214864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:52,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:52,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:17:54,344 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:17:54,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1186822060] [2022-04-28 04:17:54,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1186822060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:17:54,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:17:54,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-28 04:17:54,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263641115] [2022-04-28 04:17:54,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:17:54,345 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 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 120 [2022-04-28 04:17:54,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:17:54,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 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 04:17:54,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:17:54,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-28 04:17:54,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:17:54,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-28 04:17:54,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2817, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 04:17:54,421 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 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 04:18:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:01,515 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2022-04-28 04:18:01,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-28 04:18:01,516 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 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 120 [2022-04-28 04:18:01,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:18:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 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 04:18:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 169 transitions. [2022-04-28 04:18:01,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 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 04:18:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 169 transitions. [2022-04-28 04:18:01,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 169 transitions. [2022-04-28 04:18:01,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:01,633 INFO L225 Difference]: With dead ends: 153 [2022-04-28 04:18:01,633 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 04:18:01,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 41 SyntacticMatches, 26 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2542 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=783, Invalid=10989, Unknown=0, NotChecked=0, Total=11772 [2022-04-28 04:18:01,634 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 170 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 4961 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 5079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 4961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:18:01,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 148 Invalid, 5079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 4961 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 04:18:01,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 04:18:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 123. [2022-04-28 04:18:01,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:18:01,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 123 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 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 04:18:01,715 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 123 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 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 04:18:01,716 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 123 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 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 04:18:01,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:01,717 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-04-28 04:18:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2022-04-28 04:18:01,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:01,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:01,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 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 140 states. [2022-04-28 04:18:01,717 INFO L87 Difference]: Start difference. First operand has 123 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 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 140 states. [2022-04-28 04:18:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:01,718 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-04-28 04:18:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2022-04-28 04:18:01,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:01,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:01,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:18:01,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:18:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 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 04:18:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2022-04-28 04:18:01,719 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 120 [2022-04-28 04:18:01,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:18:01,720 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2022-04-28 04:18:01,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 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 04:18:01,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 127 transitions. [2022-04-28 04:18:02,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2022-04-28 04:18:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 04:18:02,071 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:18:02,071 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:18:02,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-04-28 04:18:02,071 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:18:02,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:18:02,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1740706818, now seen corresponding path program 47 times [2022-04-28 04:18:02,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:02,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [849917463] [2022-04-28 04:18:02,985 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:03,083 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:03,179 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:03,289 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:03,388 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:03,490 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:03,615 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:03,716 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:03,811 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:03,993 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:03,993 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:18:03,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1788809015, now seen corresponding path program 1 times [2022-04-28 04:18:03,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:18:03,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057542274] [2022-04-28 04:18:03,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:18:03,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:18:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:04,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:18:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:04,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {31620#(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); {31614#true} is VALID [2022-04-28 04:18:04,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {31614#true} assume true; {31614#true} is VALID [2022-04-28 04:18:04,018 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31614#true} {31614#true} #80#return; {31614#true} is VALID [2022-04-28 04:18:04,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {31614#true} call ULTIMATE.init(); {31620#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:18:04,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {31620#(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); {31614#true} is VALID [2022-04-28 04:18:04,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {31614#true} assume true; {31614#true} is VALID [2022-04-28 04:18:04,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31614#true} {31614#true} #80#return; {31614#true} is VALID [2022-04-28 04:18:04,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {31614#true} call #t~ret9 := main(); {31614#true} is VALID [2022-04-28 04:18:04,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {31614#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {31619#(= main_~a~0 0)} is VALID [2022-04-28 04:18:04,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {31619#(= main_~a~0 0)} [184] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_1848| |v_main_#t~pre7_1841|)) (.cse1 (= |v_main_#t~pre5_304| |v_main_#t~pre5_303|)) (.cse2 (= |v_main_#t~pre4_254| |v_main_#t~pre4_253|)) (.cse3 (= v_main_~e~0_7458 v_main_~e~0_7411)) (.cse4 (= |v_main_#t~pre8_4562| |v_main_#t~pre8_4522|)) (.cse5 (= v_main_~d~0_2378 v_main_~d~0_2369)) (.cse6 (= v_main_~b~0_415 v_main_~b~0_413))) (or (and .cse0 .cse1 .cse2 (= v_main_~a~0_309 v_main_~a~0_310) .cse3 (= |v_main_#t~pre6_478| |v_main_#t~pre6_480|) .cse4 .cse5 (= v_main_~c~0_668 v_main_~c~0_671) .cse6) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~c~0_671 v_main_~c~0_668) .cse4 .cse5 (= |v_main_#t~pre6_480| |v_main_#t~pre6_478|) (= v_main_~a~0_310 v_main_~a~0_309) .cse6))) InVars {main_~e~0=v_main_~e~0_7458, main_#t~pre7=|v_main_#t~pre7_1848|, main_~c~0=v_main_~c~0_671, main_#t~pre8=|v_main_#t~pre8_4562|, main_~d~0=v_main_~d~0_2378, main_~b~0=v_main_~b~0_415, main_#t~pre4=|v_main_#t~pre4_254|, main_#t~pre5=|v_main_#t~pre5_304|, main_~a~0=v_main_~a~0_310, main_#t~pre6=|v_main_#t~pre6_480|} OutVars{main_~e~0=v_main_~e~0_7411, main_#t~pre7=|v_main_#t~pre7_1841|, main_~c~0=v_main_~c~0_668, main_#t~pre8=|v_main_#t~pre8_4522|, main_~d~0=v_main_~d~0_2369, main_~b~0=v_main_~b~0_413, main_#t~pre4=|v_main_#t~pre4_253|, main_#t~pre5=|v_main_#t~pre5_303|, main_~a~0=v_main_~a~0_309, main_#t~pre6=|v_main_#t~pre6_478|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {31619#(= main_~a~0 0)} is VALID [2022-04-28 04:18:04,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {31619#(= main_~a~0 0)} [183] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {31615#false} is VALID [2022-04-28 04:18:04,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {31615#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {31615#false} is VALID [2022-04-28 04:18:04,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {31615#false} assume !false; {31615#false} is VALID [2022-04-28 04:18:04,020 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 04:18:04,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:18:04,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057542274] [2022-04-28 04:18:04,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057542274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:04,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:04,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:18:05,998 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:18:05,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [849917463] [2022-04-28 04:18:05,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [849917463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:05,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:05,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-28 04:18:05,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459716500] [2022-04-28 04:18:05,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:18:05,998 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 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 122 [2022-04-28 04:18:05,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:18:05,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 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 04:18:06,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:06,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-28 04:18:06,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:06,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-28 04:18:06,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2925, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 04:18:06,076 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 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 04:18:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:13,125 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2022-04-28 04:18:13,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-28 04:18:13,125 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 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 122 [2022-04-28 04:18:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:18:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 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 04:18:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 171 transitions. [2022-04-28 04:18:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 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 04:18:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 171 transitions. [2022-04-28 04:18:13,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 171 transitions. [2022-04-28 04:18:13,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:13,248 INFO L225 Difference]: With dead ends: 155 [2022-04-28 04:18:13,248 INFO L226 Difference]: Without dead ends: 142 [2022-04-28 04:18:13,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 43 SyntacticMatches, 25 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2763 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=795, Invalid=11415, Unknown=0, NotChecked=0, Total=12210 [2022-04-28 04:18:13,249 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 186 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4840 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 4840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:18:13,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 83 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 4840 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 04:18:13,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-28 04:18:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 125. [2022-04-28 04:18:13,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:18:13,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 125 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 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 04:18:13,342 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 125 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 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 04:18:13,342 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 125 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 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 04:18:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:13,343 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2022-04-28 04:18:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2022-04-28 04:18:13,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:13,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:13,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 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 142 states. [2022-04-28 04:18:13,344 INFO L87 Difference]: Start difference. First operand has 125 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 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 142 states. [2022-04-28 04:18:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:13,345 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2022-04-28 04:18:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2022-04-28 04:18:13,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:13,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:13,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:18:13,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:18:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 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 04:18:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2022-04-28 04:18:13,346 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 122 [2022-04-28 04:18:13,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:18:13,347 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2022-04-28 04:18:13,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 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 04:18:13,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 129 transitions. [2022-04-28 04:18:13,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2022-04-28 04:18:13,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-28 04:18:13,723 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:18:13,723 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:18:13,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-04-28 04:18:13,723 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:18:13,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:18:13,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1284125216, now seen corresponding path program 48 times [2022-04-28 04:18:13,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:13,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [952708581] [2022-04-28 04:18:18,639 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:18,679 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:18,784 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:18,882 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:22,957 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:22,996 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:23,098 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:23,207 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:27,282 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:18:27,321 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:27,420 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:27,519 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:27,729 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:27,729 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:18:27,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1788870519, now seen corresponding path program 1 times [2022-04-28 04:18:27,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:18:27,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641330909] [2022-04-28 04:18:27,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:18:27,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:18:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:27,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:18:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:27,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {32634#(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); {32628#true} is VALID [2022-04-28 04:18:27,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {32628#true} assume true; {32628#true} is VALID [2022-04-28 04:18:27,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32628#true} {32628#true} #80#return; {32628#true} is VALID [2022-04-28 04:18:27,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {32628#true} call ULTIMATE.init(); {32634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:18:27,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {32634#(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); {32628#true} is VALID [2022-04-28 04:18:27,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {32628#true} assume true; {32628#true} is VALID [2022-04-28 04:18:27,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32628#true} {32628#true} #80#return; {32628#true} is VALID [2022-04-28 04:18:27,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {32628#true} call #t~ret9 := main(); {32628#true} is VALID [2022-04-28 04:18:27,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {32628#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {32633#(= main_~a~0 0)} is VALID [2022-04-28 04:18:27,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {32633#(= main_~a~0 0)} [186] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_316 v_main_~a~0_315)) (.cse1 (= v_main_~e~0_7724 v_main_~e~0_7676)) (.cse2 (= |v_main_#t~pre8_4719| |v_main_#t~pre8_4678|)) (.cse3 (= |v_main_#t~pre6_508| |v_main_#t~pre6_506|)) (.cse4 (= |v_main_#t~pre7_1909| |v_main_#t~pre7_1902|)) (.cse5 (= |v_main_#t~pre5_310| |v_main_#t~pre5_309|)) (.cse6 (= v_main_~b~0_423 v_main_~b~0_421)) (.cse7 (= |v_main_#t~pre4_259| |v_main_#t~pre4_258|)) (.cse8 (= v_main_~c~0_707 v_main_~c~0_704))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~d~0_2462 v_main_~d~0_2453) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~d~0_2453 v_main_~d~0_2462) .cse4 .cse5 .cse6 .cse7 .cse8))) InVars {main_~e~0=v_main_~e~0_7724, main_#t~pre7=|v_main_#t~pre7_1909|, main_~c~0=v_main_~c~0_707, main_#t~pre8=|v_main_#t~pre8_4719|, main_~d~0=v_main_~d~0_2462, main_~b~0=v_main_~b~0_423, main_#t~pre4=|v_main_#t~pre4_259|, main_#t~pre5=|v_main_#t~pre5_310|, main_~a~0=v_main_~a~0_316, main_#t~pre6=|v_main_#t~pre6_508|} OutVars{main_~e~0=v_main_~e~0_7676, main_#t~pre7=|v_main_#t~pre7_1902|, main_~c~0=v_main_~c~0_704, main_#t~pre8=|v_main_#t~pre8_4678|, main_~d~0=v_main_~d~0_2453, main_~b~0=v_main_~b~0_421, main_#t~pre4=|v_main_#t~pre4_258|, main_#t~pre5=|v_main_#t~pre5_309|, main_~a~0=v_main_~a~0_315, main_#t~pre6=|v_main_#t~pre6_506|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {32633#(= main_~a~0 0)} is VALID [2022-04-28 04:18:27,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {32633#(= main_~a~0 0)} [185] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {32629#false} is VALID [2022-04-28 04:18:27,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {32629#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {32629#false} is VALID [2022-04-28 04:18:27,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {32629#false} assume !false; {32629#false} is VALID [2022-04-28 04:18:27,764 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 04:18:27,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:18:27,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641330909] [2022-04-28 04:18:27,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641330909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:27,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:27,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:18:29,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:18:29,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [952708581] [2022-04-28 04:18:29,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [952708581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:29,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:29,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-28 04:18:29,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76530378] [2022-04-28 04:18:29,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:18:29,773 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 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 124 [2022-04-28 04:18:29,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:18:29,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 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 04:18:29,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:29,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-28 04:18:29,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:29,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-28 04:18:29,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=3035, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 04:18:29,850 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 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 04:18:36,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:36,890 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2022-04-28 04:18:36,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-28 04:18:36,890 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 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 124 [2022-04-28 04:18:36,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:18:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 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 04:18:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 176 transitions. [2022-04-28 04:18:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 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 04:18:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 176 transitions. [2022-04-28 04:18:36,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 176 transitions. [2022-04-28 04:18:37,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:37,010 INFO L225 Difference]: With dead ends: 159 [2022-04-28 04:18:37,010 INFO L226 Difference]: Without dead ends: 146 [2022-04-28 04:18:37,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 43 SyntacticMatches, 26 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2874 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=807, Invalid=11849, Unknown=0, NotChecked=0, Total=12656 [2022-04-28 04:18:37,011 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 193 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4912 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 5047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 4912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:18:37,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 33 Invalid, 5047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 4912 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 04:18:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-28 04:18:37,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 129. [2022-04-28 04:18:37,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:18:37,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 129 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 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 04:18:37,104 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 129 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 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 04:18:37,104 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 129 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 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 04:18:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:37,105 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-04-28 04:18:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2022-04-28 04:18:37,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:37,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:37,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 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 146 states. [2022-04-28 04:18:37,106 INFO L87 Difference]: Start difference. First operand has 129 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 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 146 states. [2022-04-28 04:18:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:37,107 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-04-28 04:18:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2022-04-28 04:18:37,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:37,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:37,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:18:37,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:18:37,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 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 04:18:37,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2022-04-28 04:18:37,108 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 124 [2022-04-28 04:18:37,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:18:37,108 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2022-04-28 04:18:37,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 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 04:18:37,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 133 transitions. [2022-04-28 04:18:37,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2022-04-28 04:18:37,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-28 04:18:37,494 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:18:37,494 INFO L195 NwaCegarLoop]: trace histogram [42, 42, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:18:37,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-04-28 04:18:37,494 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:18:37,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:18:37,494 INFO L85 PathProgramCache]: Analyzing trace with hash -454850498, now seen corresponding path program 49 times [2022-04-28 04:18:37,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:37,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1139868801] [2022-04-28 04:18:38,358 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:38,463 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:38,563 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:38,673 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:38,777 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:38,876 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:38,979 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:39,080 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:39,177 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:39,375 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:39,375 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:18:39,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1788932023, now seen corresponding path program 1 times [2022-04-28 04:18:39,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:18:39,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720696639] [2022-04-28 04:18:39,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:18:39,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:18:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:39,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:18:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:39,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {33675#(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); {33669#true} is VALID [2022-04-28 04:18:39,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {33669#true} assume true; {33669#true} is VALID [2022-04-28 04:18:39,405 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33669#true} {33669#true} #80#return; {33669#true} is VALID [2022-04-28 04:18:39,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {33669#true} call ULTIMATE.init(); {33675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:18:39,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {33675#(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); {33669#true} is VALID [2022-04-28 04:18:39,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {33669#true} assume true; {33669#true} is VALID [2022-04-28 04:18:39,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33669#true} {33669#true} #80#return; {33669#true} is VALID [2022-04-28 04:18:39,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {33669#true} call #t~ret9 := main(); {33669#true} is VALID [2022-04-28 04:18:39,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {33669#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {33674#(= main_~a~0 0)} is VALID [2022-04-28 04:18:39,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {33674#(= main_~a~0 0)} [188] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_316| |v_main_#t~pre5_315|)) (.cse1 (= |v_main_#t~pre7_1969| |v_main_#t~pre7_1962|)) (.cse2 (= v_main_~a~0_322 v_main_~a~0_321)) (.cse3 (= |v_main_#t~pre8_4874| |v_main_#t~pre8_4832|)) (.cse4 (= v_main_~c~0_743 v_main_~c~0_740)) (.cse5 (= v_main_~e~0_7988 v_main_~e~0_7939)) (.cse6 (= |v_main_#t~pre4_264| |v_main_#t~pre4_263|)) (.cse7 (= |v_main_#t~pre6_536| |v_main_#t~pre6_534|))) (or (and (= v_main_~d~0_2544 v_main_~d~0_2535) .cse0 .cse1 (= v_main_~b~0_431 v_main_~b~0_429) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= v_main_~d~0_2535 v_main_~d~0_2544) .cse2 .cse3 (= v_main_~b~0_429 v_main_~b~0_431) .cse4 .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_7988, main_#t~pre7=|v_main_#t~pre7_1969|, main_~c~0=v_main_~c~0_743, main_#t~pre8=|v_main_#t~pre8_4874|, main_~d~0=v_main_~d~0_2544, main_~b~0=v_main_~b~0_431, main_#t~pre4=|v_main_#t~pre4_264|, main_#t~pre5=|v_main_#t~pre5_316|, main_~a~0=v_main_~a~0_322, main_#t~pre6=|v_main_#t~pre6_536|} OutVars{main_~e~0=v_main_~e~0_7939, main_#t~pre7=|v_main_#t~pre7_1962|, main_~c~0=v_main_~c~0_740, main_#t~pre8=|v_main_#t~pre8_4832|, main_~d~0=v_main_~d~0_2535, main_~b~0=v_main_~b~0_429, main_#t~pre4=|v_main_#t~pre4_263|, main_#t~pre5=|v_main_#t~pre5_315|, main_~a~0=v_main_~a~0_321, main_#t~pre6=|v_main_#t~pre6_534|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {33674#(= main_~a~0 0)} is VALID [2022-04-28 04:18:39,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {33674#(= main_~a~0 0)} [187] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {33670#false} is VALID [2022-04-28 04:18:39,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {33670#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {33670#false} is VALID [2022-04-28 04:18:39,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {33670#false} assume !false; {33670#false} is VALID [2022-04-28 04:18:39,407 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 04:18:39,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:18:39,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720696639] [2022-04-28 04:18:39,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720696639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:39,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:39,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:18:41,578 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:18:41,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1139868801] [2022-04-28 04:18:41,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1139868801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:41,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:41,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-28 04:18:41,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971315777] [2022-04-28 04:18:41,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:18:41,579 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 126 [2022-04-28 04:18:41,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:18:41,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 04:18:41,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:41,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-28 04:18:41,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:41,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-28 04:18:41,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=3147, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 04:18:41,658 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 04:18:49,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:49,888 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2022-04-28 04:18:49,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-28 04:18:49,888 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 126 [2022-04-28 04:18:49,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:18:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 04:18:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 176 transitions. [2022-04-28 04:18:49,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 04:18:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 176 transitions. [2022-04-28 04:18:49,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 176 transitions. [2022-04-28 04:18:50,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:50,013 INFO L225 Difference]: With dead ends: 160 [2022-04-28 04:18:50,013 INFO L226 Difference]: Without dead ends: 147 [2022-04-28 04:18:50,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 35 SyntacticMatches, 35 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3146 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=819, Invalid=12291, Unknown=0, NotChecked=0, Total=13110 [2022-04-28 04:18:50,014 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 275 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5749 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 5974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 5749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:18:50,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 38 Invalid, 5974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 5749 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-28 04:18:50,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-28 04:18:50,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2022-04-28 04:18:50,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:18:50,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 131 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 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 04:18:50,111 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 131 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 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 04:18:50,112 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 131 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 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 04:18:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:50,113 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2022-04-28 04:18:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2022-04-28 04:18:50,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:50,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:50,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 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 147 states. [2022-04-28 04:18:50,113 INFO L87 Difference]: Start difference. First operand has 131 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 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 147 states. [2022-04-28 04:18:50,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:18:50,114 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2022-04-28 04:18:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2022-04-28 04:18:50,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:18:50,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:18:50,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:18:50,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:18:50,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 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 04:18:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2022-04-28 04:18:50,116 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 126 [2022-04-28 04:18:50,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:18:50,116 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2022-04-28 04:18:50,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 04:18:50,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 135 transitions. [2022-04-28 04:18:50,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:50,538 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2022-04-28 04:18:50,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-28 04:18:50,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:18:50,538 INFO L195 NwaCegarLoop]: trace histogram [42, 42, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:18:50,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-04-28 04:18:50,538 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:18:50,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:18:50,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1715613841, now seen corresponding path program 50 times [2022-04-28 04:18:50,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:50,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2060281122] [2022-04-28 04:18:51,471 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:51,579 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:51,692 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:51,820 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:51,925 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:52,023 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:52,136 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:52,269 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:52,372 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:52,569 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:18:52,569 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:18:52,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1788993527, now seen corresponding path program 1 times [2022-04-28 04:18:52,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:18:52,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679889546] [2022-04-28 04:18:52,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:18:52,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:18:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:52,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:18:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:18:52,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {34727#(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); {34721#true} is VALID [2022-04-28 04:18:52,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {34721#true} assume true; {34721#true} is VALID [2022-04-28 04:18:52,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34721#true} {34721#true} #80#return; {34721#true} is VALID [2022-04-28 04:18:52,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {34721#true} call ULTIMATE.init(); {34727#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:18:52,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {34727#(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); {34721#true} is VALID [2022-04-28 04:18:52,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {34721#true} assume true; {34721#true} is VALID [2022-04-28 04:18:52,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34721#true} {34721#true} #80#return; {34721#true} is VALID [2022-04-28 04:18:52,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {34721#true} call #t~ret9 := main(); {34721#true} is VALID [2022-04-28 04:18:52,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {34721#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {34726#(= main_~a~0 0)} is VALID [2022-04-28 04:18:52,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {34726#(= main_~a~0 0)} [190] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_322| |v_main_#t~pre5_321|)) (.cse1 (= v_main_~c~0_779 v_main_~c~0_776)) (.cse2 (= v_main_~a~0_328 v_main_~a~0_327)) (.cse3 (= v_main_~e~0_8257 v_main_~e~0_8207)) (.cse4 (= |v_main_#t~pre4_269| |v_main_#t~pre4_268|)) (.cse5 (= |v_main_#t~pre6_564| |v_main_#t~pre6_562|)) (.cse6 (= v_main_~d~0_2632 v_main_~d~0_2622)) (.cse7 (= v_main_~b~0_439 v_main_~b~0_437))) (or (and (= |v_main_#t~pre7_2025| |v_main_#t~pre7_2033|) .cse0 .cse1 .cse2 (= |v_main_#t~pre8_4987| |v_main_#t~pre8_5029|) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= |v_main_#t~pre8_5029| |v_main_#t~pre8_4987|) .cse2 (= |v_main_#t~pre7_2033| |v_main_#t~pre7_2025|) .cse3 .cse4 .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_8257, main_#t~pre7=|v_main_#t~pre7_2033|, main_~c~0=v_main_~c~0_779, main_#t~pre8=|v_main_#t~pre8_5029|, main_~d~0=v_main_~d~0_2632, main_~b~0=v_main_~b~0_439, main_#t~pre4=|v_main_#t~pre4_269|, main_#t~pre5=|v_main_#t~pre5_322|, main_~a~0=v_main_~a~0_328, main_#t~pre6=|v_main_#t~pre6_564|} OutVars{main_~e~0=v_main_~e~0_8207, main_#t~pre7=|v_main_#t~pre7_2025|, main_~c~0=v_main_~c~0_776, main_#t~pre8=|v_main_#t~pre8_4987|, main_~d~0=v_main_~d~0_2622, main_~b~0=v_main_~b~0_437, main_#t~pre4=|v_main_#t~pre4_268|, main_#t~pre5=|v_main_#t~pre5_321|, main_~a~0=v_main_~a~0_327, main_#t~pre6=|v_main_#t~pre6_562|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {34726#(= main_~a~0 0)} is VALID [2022-04-28 04:18:52,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {34726#(= main_~a~0 0)} [189] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {34722#false} is VALID [2022-04-28 04:18:52,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {34722#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {34722#false} is VALID [2022-04-28 04:18:52,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {34722#false} assume !false; {34722#false} is VALID [2022-04-28 04:18:52,592 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 04:18:52,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:18:52,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679889546] [2022-04-28 04:18:52,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679889546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:52,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:52,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:18:54,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:18:54,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2060281122] [2022-04-28 04:18:54,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2060281122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:18:54,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:18:54,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-28 04:18:54,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115733667] [2022-04-28 04:18:54,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:18:54,747 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.1) internal successors, (126), 59 states have internal predecessors, (126), 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 129 [2022-04-28 04:18:54,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:18:54,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 2.1) internal successors, (126), 59 states have internal predecessors, (126), 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 04:18:54,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:18:54,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-28 04:18:54,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:18:54,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-28 04:18:54,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=3261, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 04:18:54,828 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand has 60 states, 60 states have (on average 2.1) internal successors, (126), 59 states have internal predecessors, (126), 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 04:19:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:02,753 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2022-04-28 04:19:02,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-28 04:19:02,753 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.1) internal successors, (126), 59 states have internal predecessors, (126), 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 129 [2022-04-28 04:19:02,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:19:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.1) internal successors, (126), 59 states have internal predecessors, (126), 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 04:19:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 178 transitions. [2022-04-28 04:19:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.1) internal successors, (126), 59 states have internal predecessors, (126), 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 04:19:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 178 transitions. [2022-04-28 04:19:02,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 178 transitions. [2022-04-28 04:19:02,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:02,875 INFO L225 Difference]: With dead ends: 162 [2022-04-28 04:19:02,875 INFO L226 Difference]: Without dead ends: 149 [2022-04-28 04:19:02,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 45 SyntacticMatches, 27 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3196 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=831, Invalid=12741, Unknown=0, NotChecked=0, Total=13572 [2022-04-28 04:19:02,876 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 224 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 5542 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 5717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 5542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:19:02,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 108 Invalid, 5717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 5542 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 04:19:02,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-28 04:19:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 132. [2022-04-28 04:19:02,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:19:02,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 132 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 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 04:19:02,969 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 132 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 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 04:19:02,969 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 132 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 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 04:19:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:02,970 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-04-28 04:19:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2022-04-28 04:19:02,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:02,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:02,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 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 149 states. [2022-04-28 04:19:02,971 INFO L87 Difference]: Start difference. First operand has 132 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 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 149 states. [2022-04-28 04:19:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:02,972 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-04-28 04:19:02,972 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2022-04-28 04:19:02,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:02,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:02,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:19:02,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:19:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 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 04:19:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2022-04-28 04:19:02,973 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 129 [2022-04-28 04:19:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:19:02,973 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2022-04-28 04:19:02,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.1) internal successors, (126), 59 states have internal predecessors, (126), 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 04:19:02,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 136 transitions. [2022-04-28 04:19:03,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2022-04-28 04:19:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 04:19:03,368 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:19:03,368 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:19:03,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-04-28 04:19:03,369 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:19:03,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:19:03,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1496408589, now seen corresponding path program 51 times [2022-04-28 04:19:03,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:03,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1534857118] [2022-04-28 04:19:07,151 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:07,198 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:07,299 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:07,398 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:11,480 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:11,526 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:11,634 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:11,732 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:13,865 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:13,965 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:14,065 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:14,264 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:14,264 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:19:14,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1789055031, now seen corresponding path program 1 times [2022-04-28 04:19:14,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:19:14,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971388074] [2022-04-28 04:19:14,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:19:14,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:19:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:14,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:19:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:14,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {35792#(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); {35786#true} is VALID [2022-04-28 04:19:14,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {35786#true} assume true; {35786#true} is VALID [2022-04-28 04:19:14,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35786#true} {35786#true} #80#return; {35786#true} is VALID [2022-04-28 04:19:14,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {35786#true} call ULTIMATE.init(); {35792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:19:14,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {35792#(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); {35786#true} is VALID [2022-04-28 04:19:14,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {35786#true} assume true; {35786#true} is VALID [2022-04-28 04:19:14,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35786#true} {35786#true} #80#return; {35786#true} is VALID [2022-04-28 04:19:14,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {35786#true} call #t~ret9 := main(); {35786#true} is VALID [2022-04-28 04:19:14,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {35786#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {35791#(= main_~a~0 0)} is VALID [2022-04-28 04:19:14,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {35791#(= main_~a~0 0)} [192] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_328| |v_main_#t~pre5_327|)) (.cse1 (= |v_main_#t~pre4_274| |v_main_#t~pre4_273|)) (.cse2 (= v_main_~e~0_8531 v_main_~e~0_8480)) (.cse3 (= |v_main_#t~pre6_592| |v_main_#t~pre6_590|)) (.cse4 (= |v_main_#t~pre8_5188| |v_main_#t~pre8_5145|)) (.cse5 (= v_main_~b~0_447 v_main_~b~0_445)) (.cse6 (= v_main_~a~0_334 v_main_~a~0_333))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~pre7_2097| |v_main_#t~pre7_2089|) .cse3 (= v_main_~c~0_815 v_main_~c~0_812) .cse4 .cse5 .cse6 (= v_main_~d~0_2720 v_main_~d~0_2710)) (and (= v_main_~d~0_2710 v_main_~d~0_2720) .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre7_2089| |v_main_#t~pre7_2097|) .cse4 (= v_main_~c~0_812 v_main_~c~0_815) .cse5 .cse6))) InVars {main_~e~0=v_main_~e~0_8531, main_#t~pre7=|v_main_#t~pre7_2097|, main_~c~0=v_main_~c~0_815, main_#t~pre8=|v_main_#t~pre8_5188|, main_~d~0=v_main_~d~0_2720, main_~b~0=v_main_~b~0_447, main_#t~pre4=|v_main_#t~pre4_274|, main_#t~pre5=|v_main_#t~pre5_328|, main_~a~0=v_main_~a~0_334, main_#t~pre6=|v_main_#t~pre6_592|} OutVars{main_~e~0=v_main_~e~0_8480, main_#t~pre7=|v_main_#t~pre7_2089|, main_~c~0=v_main_~c~0_812, main_#t~pre8=|v_main_#t~pre8_5145|, main_~d~0=v_main_~d~0_2710, main_~b~0=v_main_~b~0_445, main_#t~pre4=|v_main_#t~pre4_273|, main_#t~pre5=|v_main_#t~pre5_327|, main_~a~0=v_main_~a~0_333, main_#t~pre6=|v_main_#t~pre6_590|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {35791#(= main_~a~0 0)} is VALID [2022-04-28 04:19:14,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {35791#(= main_~a~0 0)} [191] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {35787#false} is VALID [2022-04-28 04:19:14,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {35787#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {35787#false} is VALID [2022-04-28 04:19:14,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {35787#false} assume !false; {35787#false} is VALID [2022-04-28 04:19:14,286 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 04:19:14,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:19:14,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971388074] [2022-04-28 04:19:14,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971388074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:14,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:14,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:19:16,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:19:16,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1534857118] [2022-04-28 04:19:16,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1534857118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:16,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:16,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-28 04:19:16,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704985558] [2022-04-28 04:19:16,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:19:16,444 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.098360655737705) internal successors, (128), 60 states have internal predecessors, (128), 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 131 [2022-04-28 04:19:16,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:19:16,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 2.098360655737705) internal successors, (128), 60 states have internal predecessors, (128), 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 04:19:16,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:16,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-28 04:19:16,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:16,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-28 04:19:16,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=3377, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 04:19:16,526 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand has 61 states, 61 states have (on average 2.098360655737705) internal successors, (128), 60 states have internal predecessors, (128), 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 04:19:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:23,884 INFO L93 Difference]: Finished difference Result 164 states and 180 transitions. [2022-04-28 04:19:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-28 04:19:23,884 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.098360655737705) internal successors, (128), 60 states have internal predecessors, (128), 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 131 [2022-04-28 04:19:23,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:19:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.098360655737705) internal successors, (128), 60 states have internal predecessors, (128), 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 04:19:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 180 transitions. [2022-04-28 04:19:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.098360655737705) internal successors, (128), 60 states have internal predecessors, (128), 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 04:19:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 180 transitions. [2022-04-28 04:19:23,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 180 transitions. [2022-04-28 04:19:24,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:24,009 INFO L225 Difference]: With dead ends: 164 [2022-04-28 04:19:24,009 INFO L226 Difference]: Without dead ends: 151 [2022-04-28 04:19:24,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 50 SyntacticMatches, 23 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3407 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=843, Invalid=13199, Unknown=0, NotChecked=0, Total=14042 [2022-04-28 04:19:24,010 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 181 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4986 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 5116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 4986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:19:24,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 38 Invalid, 5116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 4986 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 04:19:24,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-28 04:19:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 134. [2022-04-28 04:19:24,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:19:24,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 134 states, 130 states have (on average 1.0384615384615385) internal successors, (135), 130 states have internal predecessors, (135), 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 04:19:24,110 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 134 states, 130 states have (on average 1.0384615384615385) internal successors, (135), 130 states have internal predecessors, (135), 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 04:19:24,110 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 134 states, 130 states have (on average 1.0384615384615385) internal successors, (135), 130 states have internal predecessors, (135), 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 04:19:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:24,112 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2022-04-28 04:19:24,112 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2022-04-28 04:19:24,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:24,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:24,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 130 states have (on average 1.0384615384615385) internal successors, (135), 130 states have internal predecessors, (135), 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 151 states. [2022-04-28 04:19:24,112 INFO L87 Difference]: Start difference. First operand has 134 states, 130 states have (on average 1.0384615384615385) internal successors, (135), 130 states have internal predecessors, (135), 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 151 states. [2022-04-28 04:19:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:24,113 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2022-04-28 04:19:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2022-04-28 04:19:24,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:24,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:24,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:19:24,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:19:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 130 states have (on average 1.0384615384615385) internal successors, (135), 130 states have internal predecessors, (135), 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 04:19:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2022-04-28 04:19:24,115 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 131 [2022-04-28 04:19:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:19:24,115 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2022-04-28 04:19:24,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.098360655737705) internal successors, (128), 60 states have internal predecessors, (128), 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 04:19:24,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 138 transitions. [2022-04-28 04:19:24,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2022-04-28 04:19:24,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 04:19:24,525 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:19:24,525 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:19:24,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-04-28 04:19:24,525 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:19:24,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:19:24,525 INFO L85 PathProgramCache]: Analyzing trace with hash 168477995, now seen corresponding path program 52 times [2022-04-28 04:19:24,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:24,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1174965293] [2022-04-28 04:19:25,403 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:25,507 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:25,603 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:25,713 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:25,813 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:25,915 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:26,028 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:26,153 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:26,254 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:26,459 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:26,459 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:19:26,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1789116535, now seen corresponding path program 1 times [2022-04-28 04:19:26,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:19:26,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559094408] [2022-04-28 04:19:26,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:19:26,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:19:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:26,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:19:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:26,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {36872#(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); {36866#true} is VALID [2022-04-28 04:19:26,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {36866#true} assume true; {36866#true} is VALID [2022-04-28 04:19:26,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36866#true} {36866#true} #80#return; {36866#true} is VALID [2022-04-28 04:19:26,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {36866#true} call ULTIMATE.init(); {36872#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:19:26,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {36872#(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); {36866#true} is VALID [2022-04-28 04:19:26,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {36866#true} assume true; {36866#true} is VALID [2022-04-28 04:19:26,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36866#true} {36866#true} #80#return; {36866#true} is VALID [2022-04-28 04:19:26,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {36866#true} call #t~ret9 := main(); {36866#true} is VALID [2022-04-28 04:19:26,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {36866#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {36871#(= main_~a~0 0)} is VALID [2022-04-28 04:19:26,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {36871#(= main_~a~0 0)} [194] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_334| |v_main_#t~pre5_333|)) (.cse1 (= v_main_~b~0_455 v_main_~b~0_453)) (.cse2 (= v_main_~d~0_2808 v_main_~d~0_2798)) (.cse3 (= v_main_~e~0_8810 v_main_~e~0_8758)) (.cse4 (= v_main_~a~0_340 v_main_~a~0_339)) (.cse5 (= |v_main_#t~pre4_279| |v_main_#t~pre4_278|)) (.cse6 (= |v_main_#t~pre8_5351| |v_main_#t~pre8_5307|)) (.cse7 (= |v_main_#t~pre7_2161| |v_main_#t~pre7_2153|))) (or (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre6_618| |v_main_#t~pre6_620|) .cse4 .cse5 .cse6 (= v_main_~c~0_848 v_main_~c~0_851) .cse7) (and .cse0 .cse1 .cse2 (= v_main_~c~0_851 v_main_~c~0_848) .cse3 .cse4 .cse5 .cse6 (= |v_main_#t~pre6_620| |v_main_#t~pre6_618|) .cse7))) InVars {main_~e~0=v_main_~e~0_8810, main_#t~pre7=|v_main_#t~pre7_2161|, main_~c~0=v_main_~c~0_851, main_#t~pre8=|v_main_#t~pre8_5351|, main_~d~0=v_main_~d~0_2808, main_~b~0=v_main_~b~0_455, main_#t~pre4=|v_main_#t~pre4_279|, main_#t~pre5=|v_main_#t~pre5_334|, main_~a~0=v_main_~a~0_340, main_#t~pre6=|v_main_#t~pre6_620|} OutVars{main_~e~0=v_main_~e~0_8758, main_#t~pre7=|v_main_#t~pre7_2153|, main_~c~0=v_main_~c~0_848, main_#t~pre8=|v_main_#t~pre8_5307|, main_~d~0=v_main_~d~0_2798, main_~b~0=v_main_~b~0_453, main_#t~pre4=|v_main_#t~pre4_278|, main_#t~pre5=|v_main_#t~pre5_333|, main_~a~0=v_main_~a~0_339, main_#t~pre6=|v_main_#t~pre6_618|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {36871#(= main_~a~0 0)} is VALID [2022-04-28 04:19:26,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {36871#(= main_~a~0 0)} [193] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {36867#false} is VALID [2022-04-28 04:19:26,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {36867#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {36867#false} is VALID [2022-04-28 04:19:26,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {36867#false} assume !false; {36867#false} is VALID [2022-04-28 04:19:26,509 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 04:19:26,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:19:26,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559094408] [2022-04-28 04:19:26,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559094408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:26,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:26,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:19:28,677 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:19:28,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1174965293] [2022-04-28 04:19:28,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1174965293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:28,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:28,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-28 04:19:28,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737627710] [2022-04-28 04:19:28,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:19:28,679 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.096774193548387) internal successors, (130), 61 states have internal predecessors, (130), 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 133 [2022-04-28 04:19:28,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:19:28,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 2.096774193548387) internal successors, (130), 61 states have internal predecessors, (130), 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 04:19:28,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:28,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-28 04:19:28,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:28,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-28 04:19:28,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=3495, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 04:19:28,762 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand has 62 states, 62 states have (on average 2.096774193548387) internal successors, (130), 61 states have internal predecessors, (130), 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 04:19:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:36,764 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2022-04-28 04:19:36,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-28 04:19:36,764 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.096774193548387) internal successors, (130), 61 states have internal predecessors, (130), 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 133 [2022-04-28 04:19:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:19:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.096774193548387) internal successors, (130), 61 states have internal predecessors, (130), 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 04:19:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 182 transitions. [2022-04-28 04:19:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.096774193548387) internal successors, (130), 61 states have internal predecessors, (130), 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 04:19:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 182 transitions. [2022-04-28 04:19:36,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 182 transitions. [2022-04-28 04:19:36,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:36,892 INFO L225 Difference]: With dead ends: 166 [2022-04-28 04:19:36,892 INFO L226 Difference]: Without dead ends: 153 [2022-04-28 04:19:36,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 46 SyntacticMatches, 28 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3573 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=855, Invalid=13665, Unknown=0, NotChecked=0, Total=14520 [2022-04-28 04:19:36,893 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 228 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5468 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 5647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 5468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:19:36,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 58 Invalid, 5647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 5468 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 04:19:36,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-28 04:19:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 136. [2022-04-28 04:19:36,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:19:36,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 136 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 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 04:19:36,996 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 136 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 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 04:19:36,997 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 136 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 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 04:19:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:36,998 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-04-28 04:19:36,998 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-04-28 04:19:36,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:36,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:36,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 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 153 states. [2022-04-28 04:19:36,998 INFO L87 Difference]: Start difference. First operand has 136 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 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 153 states. [2022-04-28 04:19:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:37,000 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-04-28 04:19:37,000 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-04-28 04:19:37,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:37,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:37,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:19:37,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:19:37,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 132 states have internal predecessors, (137), 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 04:19:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2022-04-28 04:19:37,001 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 133 [2022-04-28 04:19:37,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:19:37,001 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2022-04-28 04:19:37,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.096774193548387) internal successors, (130), 61 states have internal predecessors, (130), 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 04:19:37,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 140 transitions. [2022-04-28 04:19:37,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:37,450 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2022-04-28 04:19:37,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 04:19:37,450 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:19:37,450 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:19:37,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-04-28 04:19:37,450 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:19:37,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:19:37,451 INFO L85 PathProgramCache]: Analyzing trace with hash -367535927, now seen corresponding path program 53 times [2022-04-28 04:19:37,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:37,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [777340022] [2022-04-28 04:19:42,314 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:42,353 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:42,453 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:42,552 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:46,629 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:46,668 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:46,768 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:46,867 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:48,548 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:19:48,586 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:48,687 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:48,784 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:49,012 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:19:49,012 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:19:49,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1789178039, now seen corresponding path program 1 times [2022-04-28 04:19:49,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:19:49,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019626290] [2022-04-28 04:19:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:19:49,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:19:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:49,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:19:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:19:49,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {37967#(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); {37961#true} is VALID [2022-04-28 04:19:49,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {37961#true} assume true; {37961#true} is VALID [2022-04-28 04:19:49,039 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37961#true} {37961#true} #80#return; {37961#true} is VALID [2022-04-28 04:19:49,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {37961#true} call ULTIMATE.init(); {37967#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:19:49,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {37967#(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); {37961#true} is VALID [2022-04-28 04:19:49,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {37961#true} assume true; {37961#true} is VALID [2022-04-28 04:19:49,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37961#true} {37961#true} #80#return; {37961#true} is VALID [2022-04-28 04:19:49,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {37961#true} call #t~ret9 := main(); {37961#true} is VALID [2022-04-28 04:19:49,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {37961#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {37966#(= main_~a~0 0)} is VALID [2022-04-28 04:19:49,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {37966#(= main_~a~0 0)} [196] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_887 v_main_~c~0_884)) (.cse1 (= |v_main_#t~pre6_648| |v_main_#t~pre6_646|)) (.cse2 (= v_main_~d~0_2896 v_main_~d~0_2886)) (.cse3 (= v_main_~a~0_346 v_main_~a~0_345)) (.cse4 (= v_main_~b~0_463 v_main_~b~0_461)) (.cse5 (= v_main_~e~0_9094 v_main_~e~0_9041)) (.cse6 (= |v_main_#t~pre8_5518| |v_main_#t~pre8_5473|))) (or (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre4_284| |v_main_#t~pre4_283|) (= |v_main_#t~pre7_2225| |v_main_#t~pre7_2217|) .cse4 .cse5 .cse6 (= |v_main_#t~pre5_340| |v_main_#t~pre5_339|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre4_283| |v_main_#t~pre4_284|) .cse6 (= |v_main_#t~pre5_339| |v_main_#t~pre5_340|) (= |v_main_#t~pre7_2217| |v_main_#t~pre7_2225|)))) InVars {main_~e~0=v_main_~e~0_9094, main_#t~pre7=|v_main_#t~pre7_2225|, main_~c~0=v_main_~c~0_887, main_#t~pre8=|v_main_#t~pre8_5518|, main_~d~0=v_main_~d~0_2896, main_~b~0=v_main_~b~0_463, main_#t~pre4=|v_main_#t~pre4_284|, main_#t~pre5=|v_main_#t~pre5_340|, main_~a~0=v_main_~a~0_346, main_#t~pre6=|v_main_#t~pre6_648|} OutVars{main_~e~0=v_main_~e~0_9041, main_#t~pre7=|v_main_#t~pre7_2217|, main_~c~0=v_main_~c~0_884, main_#t~pre8=|v_main_#t~pre8_5473|, main_~d~0=v_main_~d~0_2886, main_~b~0=v_main_~b~0_461, main_#t~pre4=|v_main_#t~pre4_283|, main_#t~pre5=|v_main_#t~pre5_339|, main_~a~0=v_main_~a~0_345, main_#t~pre6=|v_main_#t~pre6_646|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {37966#(= main_~a~0 0)} is VALID [2022-04-28 04:19:49,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {37966#(= main_~a~0 0)} [195] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {37962#false} is VALID [2022-04-28 04:19:49,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {37962#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {37962#false} is VALID [2022-04-28 04:19:49,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {37962#false} assume !false; {37962#false} is VALID [2022-04-28 04:19:49,056 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 04:19:49,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:19:49,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019626290] [2022-04-28 04:19:49,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019626290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:49,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:49,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:19:51,173 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:19:51,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [777340022] [2022-04-28 04:19:51,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [777340022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:19:51,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:19:51,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-28 04:19:51,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978124244] [2022-04-28 04:19:51,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:19:51,174 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0952380952380953) internal successors, (132), 62 states have internal predecessors, (132), 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 135 [2022-04-28 04:19:51,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:19:51,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 63 states have (on average 2.0952380952380953) internal successors, (132), 62 states have internal predecessors, (132), 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 04:19:51,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:51,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-28 04:19:51,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:19:51,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-28 04:19:51,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=3615, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 04:19:51,259 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand has 63 states, 63 states have (on average 2.0952380952380953) internal successors, (132), 62 states have internal predecessors, (132), 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 04:19:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:59,401 INFO L93 Difference]: Finished difference Result 168 states and 184 transitions. [2022-04-28 04:19:59,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-28 04:19:59,401 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0952380952380953) internal successors, (132), 62 states have internal predecessors, (132), 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 135 [2022-04-28 04:19:59,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:19:59,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0952380952380953) internal successors, (132), 62 states have internal predecessors, (132), 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 04:19:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 184 transitions. [2022-04-28 04:19:59,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0952380952380953) internal successors, (132), 62 states have internal predecessors, (132), 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 04:19:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 184 transitions. [2022-04-28 04:19:59,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 184 transitions. [2022-04-28 04:19:59,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:19:59,533 INFO L225 Difference]: With dead ends: 168 [2022-04-28 04:19:59,533 INFO L226 Difference]: Without dead ends: 155 [2022-04-28 04:19:59,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 51 SyntacticMatches, 24 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3661 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=867, Invalid=14139, Unknown=0, NotChecked=0, Total=15006 [2022-04-28 04:19:59,534 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 251 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5587 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 5783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 5587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:19:59,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 48 Invalid, 5783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 5587 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 04:19:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-28 04:19:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 138. [2022-04-28 04:19:59,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:19:59,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 138 states, 134 states have (on average 1.037313432835821) internal successors, (139), 134 states have internal predecessors, (139), 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 04:19:59,642 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 138 states, 134 states have (on average 1.037313432835821) internal successors, (139), 134 states have internal predecessors, (139), 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 04:19:59,642 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 138 states, 134 states have (on average 1.037313432835821) internal successors, (139), 134 states have internal predecessors, (139), 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 04:19:59,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:59,643 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2022-04-28 04:19:59,643 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2022-04-28 04:19:59,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:59,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:59,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 134 states have (on average 1.037313432835821) internal successors, (139), 134 states have internal predecessors, (139), 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 155 states. [2022-04-28 04:19:59,644 INFO L87 Difference]: Start difference. First operand has 138 states, 134 states have (on average 1.037313432835821) internal successors, (139), 134 states have internal predecessors, (139), 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 155 states. [2022-04-28 04:19:59,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:19:59,645 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2022-04-28 04:19:59,645 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2022-04-28 04:19:59,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:19:59,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:19:59,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:19:59,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:19:59,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 134 states have (on average 1.037313432835821) internal successors, (139), 134 states have internal predecessors, (139), 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 04:19:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 142 transitions. [2022-04-28 04:19:59,647 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 142 transitions. Word has length 135 [2022-04-28 04:19:59,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:19:59,647 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 142 transitions. [2022-04-28 04:19:59,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.0952380952380953) internal successors, (132), 62 states have internal predecessors, (132), 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 04:19:59,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 142 transitions. [2022-04-28 04:20:00,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2022-04-28 04:20:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-28 04:20:00,100 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:20:00,100 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:20:00,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-04-28 04:20:00,100 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:20:00,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:20:00,100 INFO L85 PathProgramCache]: Analyzing trace with hash -80839449, now seen corresponding path program 54 times [2022-04-28 04:20:00,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:00,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [17206046] [2022-04-28 04:20:01,079 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:01,182 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:01,282 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:01,379 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:01,478 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:01,581 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:01,687 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:01,795 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:01,899 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:02,130 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:02,130 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:20:02,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1789239543, now seen corresponding path program 1 times [2022-04-28 04:20:02,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:20:02,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870260212] [2022-04-28 04:20:02,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:20:02,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:20:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:02,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:20:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:02,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {39077#(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); {39071#true} is VALID [2022-04-28 04:20:02,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {39071#true} assume true; {39071#true} is VALID [2022-04-28 04:20:02,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39071#true} {39071#true} #80#return; {39071#true} is VALID [2022-04-28 04:20:02,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {39071#true} call ULTIMATE.init(); {39077#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:20:02,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {39077#(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); {39071#true} is VALID [2022-04-28 04:20:02,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {39071#true} assume true; {39071#true} is VALID [2022-04-28 04:20:02,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39071#true} {39071#true} #80#return; {39071#true} is VALID [2022-04-28 04:20:02,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {39071#true} call #t~ret9 := main(); {39071#true} is VALID [2022-04-28 04:20:02,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {39071#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {39076#(= main_~a~0 0)} is VALID [2022-04-28 04:20:02,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {39076#(= main_~a~0 0)} [198] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_676| |v_main_#t~pre6_674|)) (.cse1 (= v_main_~c~0_923 v_main_~c~0_920)) (.cse2 (= |v_main_#t~pre4_289| |v_main_#t~pre4_288|)) (.cse3 (= v_main_~e~0_9383 v_main_~e~0_9329)) (.cse4 (= |v_main_#t~pre5_346| |v_main_#t~pre5_345|)) (.cse5 (= |v_main_#t~pre7_2289| |v_main_#t~pre7_2281|)) (.cse6 (= |v_main_#t~pre8_5689| |v_main_#t~pre8_5643|)) (.cse7 (= v_main_~a~0_352 v_main_~a~0_351))) (or (and (= v_main_~b~0_471 v_main_~b~0_469) .cse0 .cse1 .cse2 (= v_main_~d~0_2984 v_main_~d~0_2974) .cse3 .cse4 .cse5 .cse6 .cse7) (and (= v_main_~b~0_469 v_main_~b~0_471) .cse0 (= v_main_~d~0_2974 v_main_~d~0_2984) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_9383, main_#t~pre7=|v_main_#t~pre7_2289|, main_~c~0=v_main_~c~0_923, main_#t~pre8=|v_main_#t~pre8_5689|, main_~d~0=v_main_~d~0_2984, main_~b~0=v_main_~b~0_471, main_#t~pre4=|v_main_#t~pre4_289|, main_#t~pre5=|v_main_#t~pre5_346|, main_~a~0=v_main_~a~0_352, main_#t~pre6=|v_main_#t~pre6_676|} OutVars{main_~e~0=v_main_~e~0_9329, main_#t~pre7=|v_main_#t~pre7_2281|, main_~c~0=v_main_~c~0_920, main_#t~pre8=|v_main_#t~pre8_5643|, main_~d~0=v_main_~d~0_2974, main_~b~0=v_main_~b~0_469, main_#t~pre4=|v_main_#t~pre4_288|, main_#t~pre5=|v_main_#t~pre5_345|, main_~a~0=v_main_~a~0_351, main_#t~pre6=|v_main_#t~pre6_674|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {39076#(= main_~a~0 0)} is VALID [2022-04-28 04:20:02,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {39076#(= main_~a~0 0)} [197] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {39072#false} is VALID [2022-04-28 04:20:02,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {39072#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {39072#false} is VALID [2022-04-28 04:20:02,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {39072#false} assume !false; {39072#false} is VALID [2022-04-28 04:20:02,170 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 04:20:02,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:20:02,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870260212] [2022-04-28 04:20:02,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870260212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:02,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:02,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:20:04,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:20:04,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [17206046] [2022-04-28 04:20:04,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [17206046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:04,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:04,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-28 04:20:04,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428496534] [2022-04-28 04:20:04,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:20:04,530 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.09375) internal successors, (134), 63 states have internal predecessors, (134), 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 137 [2022-04-28 04:20:04,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:20:04,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 2.09375) internal successors, (134), 63 states have internal predecessors, (134), 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 04:20:04,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:04,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-28 04:20:04,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:04,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-28 04:20:04,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=3737, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 04:20:04,618 INFO L87 Difference]: Start difference. First operand 138 states and 142 transitions. Second operand has 64 states, 64 states have (on average 2.09375) internal successors, (134), 63 states have internal predecessors, (134), 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 04:20:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:14,204 INFO L93 Difference]: Finished difference Result 170 states and 186 transitions. [2022-04-28 04:20:14,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-28 04:20:14,205 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.09375) internal successors, (134), 63 states have internal predecessors, (134), 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 137 [2022-04-28 04:20:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:20:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.09375) internal successors, (134), 63 states have internal predecessors, (134), 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 04:20:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 186 transitions. [2022-04-28 04:20:14,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.09375) internal successors, (134), 63 states have internal predecessors, (134), 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 04:20:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 186 transitions. [2022-04-28 04:20:14,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 186 transitions. [2022-04-28 04:20:14,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:14,334 INFO L225 Difference]: With dead ends: 170 [2022-04-28 04:20:14,334 INFO L226 Difference]: Without dead ends: 157 [2022-04-28 04:20:14,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 47 SyntacticMatches, 29 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3836 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=879, Invalid=14621, Unknown=0, NotChecked=0, Total=15500 [2022-04-28 04:20:14,335 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 187 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 6851 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 6987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 6851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:20:14,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 198 Invalid, 6987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 6851 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-28 04:20:14,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-28 04:20:14,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2022-04-28 04:20:14,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:20:14,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 140 states, 136 states have (on average 1.036764705882353) internal successors, (141), 136 states have internal predecessors, (141), 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 04:20:14,443 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 140 states, 136 states have (on average 1.036764705882353) internal successors, (141), 136 states have internal predecessors, (141), 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 04:20:14,443 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 140 states, 136 states have (on average 1.036764705882353) internal successors, (141), 136 states have internal predecessors, (141), 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 04:20:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:14,444 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-04-28 04:20:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-04-28 04:20:14,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:14,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:14,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 136 states have (on average 1.036764705882353) internal successors, (141), 136 states have internal predecessors, (141), 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 157 states. [2022-04-28 04:20:14,444 INFO L87 Difference]: Start difference. First operand has 140 states, 136 states have (on average 1.036764705882353) internal successors, (141), 136 states have internal predecessors, (141), 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 157 states. [2022-04-28 04:20:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:14,446 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-04-28 04:20:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-04-28 04:20:14,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:14,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:14,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:20:14,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:20:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 136 states have (on average 1.036764705882353) internal successors, (141), 136 states have internal predecessors, (141), 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 04:20:14,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2022-04-28 04:20:14,447 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 137 [2022-04-28 04:20:14,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:20:14,447 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2022-04-28 04:20:14,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.09375) internal successors, (134), 63 states have internal predecessors, (134), 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 04:20:14,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 144 transitions. [2022-04-28 04:20:14,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2022-04-28 04:20:14,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-28 04:20:14,886 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:20:14,886 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:20:14,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-04-28 04:20:14,887 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:20:14,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:20:14,887 INFO L85 PathProgramCache]: Analyzing trace with hash 556568965, now seen corresponding path program 55 times [2022-04-28 04:20:14,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:14,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [158576521] [2022-04-28 04:20:19,750 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:20:19,795 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:19,902 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:19,997 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:24,081 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:20:24,126 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:24,226 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:24,323 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:26,752 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:26,855 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:26,955 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:27,177 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:27,177 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:20:27,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1789301047, now seen corresponding path program 1 times [2022-04-28 04:20:27,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:20:27,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603447417] [2022-04-28 04:20:27,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:20:27,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:20:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:27,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:20:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:27,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {40202#(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); {40196#true} is VALID [2022-04-28 04:20:27,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {40196#true} assume true; {40196#true} is VALID [2022-04-28 04:20:27,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40196#true} {40196#true} #80#return; {40196#true} is VALID [2022-04-28 04:20:27,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {40196#true} call ULTIMATE.init(); {40202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:20:27,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {40202#(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); {40196#true} is VALID [2022-04-28 04:20:27,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {40196#true} assume true; {40196#true} is VALID [2022-04-28 04:20:27,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40196#true} {40196#true} #80#return; {40196#true} is VALID [2022-04-28 04:20:27,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {40196#true} call #t~ret9 := main(); {40196#true} is VALID [2022-04-28 04:20:27,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {40196#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {40201#(= main_~a~0 0)} is VALID [2022-04-28 04:20:27,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {40201#(= main_~a~0 0)} [200] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre8_5864| |v_main_#t~pre8_5817|)) (.cse1 (= v_main_~b~0_479 v_main_~b~0_477)) (.cse2 (= v_main_~e~0_9677 v_main_~e~0_9622)) (.cse3 (= |v_main_#t~pre6_704| |v_main_#t~pre6_702|)) (.cse4 (= |v_main_#t~pre4_294| |v_main_#t~pre4_293|)) (.cse5 (= v_main_~a~0_358 v_main_~a~0_357)) (.cse6 (= |v_main_#t~pre5_352| |v_main_#t~pre5_351|))) (or (and .cse0 (= v_main_~c~0_959 v_main_~c~0_956) .cse1 .cse2 (= |v_main_#t~pre7_2353| |v_main_#t~pre7_2345|) (= v_main_~d~0_3072 v_main_~d~0_3062) .cse3 .cse4 .cse5 .cse6) (and .cse0 (= |v_main_#t~pre7_2345| |v_main_#t~pre7_2353|) .cse1 .cse2 (= v_main_~c~0_956 v_main_~c~0_959) .cse3 (= v_main_~d~0_3062 v_main_~d~0_3072) .cse4 .cse5 .cse6))) InVars {main_~e~0=v_main_~e~0_9677, main_#t~pre7=|v_main_#t~pre7_2353|, main_~c~0=v_main_~c~0_959, main_#t~pre8=|v_main_#t~pre8_5864|, main_~d~0=v_main_~d~0_3072, main_~b~0=v_main_~b~0_479, main_#t~pre4=|v_main_#t~pre4_294|, main_#t~pre5=|v_main_#t~pre5_352|, main_~a~0=v_main_~a~0_358, main_#t~pre6=|v_main_#t~pre6_704|} OutVars{main_~e~0=v_main_~e~0_9622, main_#t~pre7=|v_main_#t~pre7_2345|, main_~c~0=v_main_~c~0_956, main_#t~pre8=|v_main_#t~pre8_5817|, main_~d~0=v_main_~d~0_3062, main_~b~0=v_main_~b~0_477, main_#t~pre4=|v_main_#t~pre4_293|, main_#t~pre5=|v_main_#t~pre5_351|, main_~a~0=v_main_~a~0_357, main_#t~pre6=|v_main_#t~pre6_702|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {40201#(= main_~a~0 0)} is VALID [2022-04-28 04:20:27,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {40201#(= main_~a~0 0)} [199] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {40197#false} is VALID [2022-04-28 04:20:27,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {40197#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {40197#false} is VALID [2022-04-28 04:20:27,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {40197#false} assume !false; {40197#false} is VALID [2022-04-28 04:20:27,214 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 04:20:27,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:20:27,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603447417] [2022-04-28 04:20:27,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603447417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:27,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:27,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:20:29,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:20:29,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [158576521] [2022-04-28 04:20:29,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [158576521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:29,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:29,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-28 04:20:29,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087567150] [2022-04-28 04:20:29,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:20:29,763 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 64 states have internal predecessors, (136), 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 139 [2022-04-28 04:20:29,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:20:29,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 64 states have internal predecessors, (136), 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 04:20:29,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:29,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-28 04:20:29,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:29,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-28 04:20:29,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=3861, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 04:20:29,850 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand has 65 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 64 states have internal predecessors, (136), 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 04:20:38,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:38,932 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2022-04-28 04:20:38,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-28 04:20:38,933 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 64 states have internal predecessors, (136), 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 139 [2022-04-28 04:20:38,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:20:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 64 states have internal predecessors, (136), 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 04:20:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 191 transitions. [2022-04-28 04:20:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 64 states have internal predecessors, (136), 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 04:20:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 191 transitions. [2022-04-28 04:20:38,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 191 transitions. [2022-04-28 04:20:39,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:39,067 INFO L225 Difference]: With dead ends: 174 [2022-04-28 04:20:39,067 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 04:20:39,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 40 SyntacticMatches, 37 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4195 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=891, Invalid=15111, Unknown=0, NotChecked=0, Total=16002 [2022-04-28 04:20:39,068 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 182 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 6380 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 6515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 6380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:20:39,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 158 Invalid, 6515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 6380 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 04:20:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 04:20:39,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2022-04-28 04:20:39,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:20:39,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 144 states, 140 states have (on average 1.0357142857142858) internal successors, (145), 140 states have internal predecessors, (145), 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 04:20:39,189 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 144 states, 140 states have (on average 1.0357142857142858) internal successors, (145), 140 states have internal predecessors, (145), 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 04:20:39,190 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 144 states, 140 states have (on average 1.0357142857142858) internal successors, (145), 140 states have internal predecessors, (145), 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 04:20:39,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:39,191 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2022-04-28 04:20:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 172 transitions. [2022-04-28 04:20:39,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:39,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:39,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 140 states have (on average 1.0357142857142858) internal successors, (145), 140 states have internal predecessors, (145), 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 161 states. [2022-04-28 04:20:39,191 INFO L87 Difference]: Start difference. First operand has 144 states, 140 states have (on average 1.0357142857142858) internal successors, (145), 140 states have internal predecessors, (145), 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 161 states. [2022-04-28 04:20:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:39,193 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2022-04-28 04:20:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 172 transitions. [2022-04-28 04:20:39,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:39,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:39,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:20:39,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:20:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 140 states have (on average 1.0357142857142858) internal successors, (145), 140 states have internal predecessors, (145), 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 04:20:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2022-04-28 04:20:39,194 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 139 [2022-04-28 04:20:39,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:20:39,194 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2022-04-28 04:20:39,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 64 states have internal predecessors, (136), 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 04:20:39,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 148 transitions. [2022-04-28 04:20:39,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2022-04-28 04:20:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-04-28 04:20:39,655 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:20:39,655 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:20:39,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-04-28 04:20:39,655 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:20:39,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:20:39,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1074268509, now seen corresponding path program 56 times [2022-04-28 04:20:39,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:39,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1520511077] [2022-04-28 04:20:44,523 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:20:44,562 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:44,664 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:44,763 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:48,838 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:20:48,876 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:48,984 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:49,082 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:53,155 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:20:53,194 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:53,297 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:53,396 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:53,622 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:20:53,622 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:20:53,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1789362551, now seen corresponding path program 1 times [2022-04-28 04:20:53,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:20:53,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917357021] [2022-04-28 04:20:53,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:20:53,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:20:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:53,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:20:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:53,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {41354#(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); {41348#true} is VALID [2022-04-28 04:20:53,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {41348#true} assume true; {41348#true} is VALID [2022-04-28 04:20:53,642 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41348#true} {41348#true} #80#return; {41348#true} is VALID [2022-04-28 04:20:53,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {41348#true} call ULTIMATE.init(); {41354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:20:53,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {41354#(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); {41348#true} is VALID [2022-04-28 04:20:53,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {41348#true} assume true; {41348#true} is VALID [2022-04-28 04:20:53,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41348#true} {41348#true} #80#return; {41348#true} is VALID [2022-04-28 04:20:53,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {41348#true} call #t~ret9 := main(); {41348#true} is VALID [2022-04-28 04:20:53,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {41348#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {41353#(= main_~a~0 0)} is VALID [2022-04-28 04:20:53,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {41353#(= main_~a~0 0)} [202] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_487 v_main_~b~0_485)) (.cse1 (= |v_main_#t~pre7_2416| |v_main_#t~pre7_2408|)) (.cse2 (= v_main_~c~0_995 v_main_~c~0_992)) (.cse3 (= |v_main_#t~pre4_299| |v_main_#t~pre4_298|)) (.cse4 (= |v_main_#t~pre6_732| |v_main_#t~pre6_730|)) (.cse5 (= v_main_~a~0_364 v_main_~a~0_363)) (.cse6 (= v_main_~e~0_9969 v_main_~e~0_9913)) (.cse7 (= |v_main_#t~pre5_358| |v_main_#t~pre5_357|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~d~0_3148 v_main_~d~0_3158) (= |v_main_#t~pre8_5989| |v_main_#t~pre8_6037|) .cse7) (and .cse0 .cse1 .cse2 (= |v_main_#t~pre8_6037| |v_main_#t~pre8_5989|) (= v_main_~d~0_3158 v_main_~d~0_3148) .cse3 .cse4 .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_9969, main_#t~pre7=|v_main_#t~pre7_2416|, main_~c~0=v_main_~c~0_995, main_#t~pre8=|v_main_#t~pre8_6037|, main_~d~0=v_main_~d~0_3158, main_~b~0=v_main_~b~0_487, main_#t~pre4=|v_main_#t~pre4_299|, main_#t~pre5=|v_main_#t~pre5_358|, main_~a~0=v_main_~a~0_364, main_#t~pre6=|v_main_#t~pre6_732|} OutVars{main_~e~0=v_main_~e~0_9913, main_#t~pre7=|v_main_#t~pre7_2408|, main_~c~0=v_main_~c~0_992, main_#t~pre8=|v_main_#t~pre8_5989|, main_~d~0=v_main_~d~0_3148, main_~b~0=v_main_~b~0_485, main_#t~pre4=|v_main_#t~pre4_298|, main_#t~pre5=|v_main_#t~pre5_357|, main_~a~0=v_main_~a~0_363, main_#t~pre6=|v_main_#t~pre6_730|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {41353#(= main_~a~0 0)} is VALID [2022-04-28 04:20:53,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {41353#(= main_~a~0 0)} [201] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {41349#false} is VALID [2022-04-28 04:20:53,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {41349#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {41349#false} is VALID [2022-04-28 04:20:53,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {41349#false} assume !false; {41349#false} is VALID [2022-04-28 04:20:53,644 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 04:20:53,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:20:53,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917357021] [2022-04-28 04:20:53,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917357021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:53,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:53,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:20:56,244 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:20:56,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1520511077] [2022-04-28 04:20:56,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1520511077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:56,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:56,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-28 04:20:56,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996120653] [2022-04-28 04:20:56,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:20:56,245 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 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 141 [2022-04-28 04:20:56,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:20:56,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 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 04:20:56,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:56,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-28 04:20:56,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:56,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-28 04:20:56,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=3987, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 04:20:56,335 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 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 04:21:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:06,752 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2022-04-28 04:21:06,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-28 04:21:06,753 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 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 141 [2022-04-28 04:21:06,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:21:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 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 04:21:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 191 transitions. [2022-04-28 04:21:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 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 04:21:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 191 transitions. [2022-04-28 04:21:06,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 191 transitions. [2022-04-28 04:21:06,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:06,890 INFO L225 Difference]: With dead ends: 175 [2022-04-28 04:21:06,890 INFO L226 Difference]: Without dead ends: 162 [2022-04-28 04:21:06,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 42 SyntacticMatches, 36 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4330 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=903, Invalid=15609, Unknown=0, NotChecked=0, Total=16512 [2022-04-28 04:21:06,891 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 214 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 7421 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 7582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 7421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:21:06,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 208 Invalid, 7582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 7421 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 04:21:06,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-28 04:21:07,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2022-04-28 04:21:07,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:21:07,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 146 states, 142 states have (on average 1.0352112676056338) internal successors, (147), 142 states have internal predecessors, (147), 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 04:21:07,009 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 146 states, 142 states have (on average 1.0352112676056338) internal successors, (147), 142 states have internal predecessors, (147), 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 04:21:07,009 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 146 states, 142 states have (on average 1.0352112676056338) internal successors, (147), 142 states have internal predecessors, (147), 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 04:21:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:07,010 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2022-04-28 04:21:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2022-04-28 04:21:07,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:07,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:07,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 142 states have (on average 1.0352112676056338) internal successors, (147), 142 states have internal predecessors, (147), 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 162 states. [2022-04-28 04:21:07,011 INFO L87 Difference]: Start difference. First operand has 146 states, 142 states have (on average 1.0352112676056338) internal successors, (147), 142 states have internal predecessors, (147), 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 162 states. [2022-04-28 04:21:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:07,012 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2022-04-28 04:21:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2022-04-28 04:21:07,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:07,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:07,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:21:07,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:21:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 142 states have (on average 1.0352112676056338) internal successors, (147), 142 states have internal predecessors, (147), 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 04:21:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2022-04-28 04:21:07,014 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 141 [2022-04-28 04:21:07,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:21:07,014 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2022-04-28 04:21:07,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 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 04:21:07,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 150 transitions. [2022-04-28 04:21:07,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2022-04-28 04:21:07,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-28 04:21:07,485 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:21:07,485 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:21:07,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-04-28 04:21:07,485 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:21:07,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:21:07,486 INFO L85 PathProgramCache]: Analyzing trace with hash 676891370, now seen corresponding path program 57 times [2022-04-28 04:21:07,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:07,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1290349815] [2022-04-28 04:21:10,986 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:21:11,025 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:11,128 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:11,225 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:15,299 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:21:15,338 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:15,440 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:15,547 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:19,624 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:21:19,663 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:19,773 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:19,872 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:20,137 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:20,138 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:21:20,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1789424055, now seen corresponding path program 1 times [2022-04-28 04:21:20,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:21:20,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906362496] [2022-04-28 04:21:20,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:21:20,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:21:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:20,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:21:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:20,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {42517#(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); {42511#true} is VALID [2022-04-28 04:21:20,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {42511#true} assume true; {42511#true} is VALID [2022-04-28 04:21:20,167 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42511#true} {42511#true} #80#return; {42511#true} is VALID [2022-04-28 04:21:20,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {42511#true} call ULTIMATE.init(); {42517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:21:20,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {42517#(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); {42511#true} is VALID [2022-04-28 04:21:20,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {42511#true} assume true; {42511#true} is VALID [2022-04-28 04:21:20,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42511#true} {42511#true} #80#return; {42511#true} is VALID [2022-04-28 04:21:20,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {42511#true} call #t~ret9 := main(); {42511#true} is VALID [2022-04-28 04:21:20,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {42511#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {42516#(= main_~a~0 0)} is VALID [2022-04-28 04:21:20,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {42516#(= main_~a~0 0)} [204] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1031 v_main_~c~0_1028)) (.cse1 (= |v_main_#t~pre4_304| |v_main_#t~pre4_303|)) (.cse2 (= |v_main_#t~pre8_6210| |v_main_#t~pre8_6162|)) (.cse3 (= v_main_~b~0_495 v_main_~b~0_493)) (.cse4 (= v_main_~d~0_3250 v_main_~d~0_3239)) (.cse5 (= |v_main_#t~pre5_364| |v_main_#t~pre5_363|)) (.cse6 (= v_main_~e~0_10266 v_main_~e~0_10209)) (.cse7 (= |v_main_#t~pre7_2483| |v_main_#t~pre7_2474|))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_369 v_main_~a~0_370) .cse4 .cse5 .cse6 .cse7 (= |v_main_#t~pre6_758| |v_main_#t~pre6_760|)) (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre6_760| |v_main_#t~pre6_758|) .cse4 .cse5 .cse6 (= v_main_~a~0_370 v_main_~a~0_369) .cse7))) InVars {main_~e~0=v_main_~e~0_10266, main_#t~pre7=|v_main_#t~pre7_2483|, main_~c~0=v_main_~c~0_1031, main_#t~pre8=|v_main_#t~pre8_6210|, main_~d~0=v_main_~d~0_3250, main_~b~0=v_main_~b~0_495, main_#t~pre4=|v_main_#t~pre4_304|, main_#t~pre5=|v_main_#t~pre5_364|, main_~a~0=v_main_~a~0_370, main_#t~pre6=|v_main_#t~pre6_760|} OutVars{main_~e~0=v_main_~e~0_10209, main_#t~pre7=|v_main_#t~pre7_2474|, main_~c~0=v_main_~c~0_1028, main_#t~pre8=|v_main_#t~pre8_6162|, main_~d~0=v_main_~d~0_3239, main_~b~0=v_main_~b~0_493, main_#t~pre4=|v_main_#t~pre4_303|, main_#t~pre5=|v_main_#t~pre5_363|, main_~a~0=v_main_~a~0_369, main_#t~pre6=|v_main_#t~pre6_758|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {42516#(= main_~a~0 0)} is VALID [2022-04-28 04:21:20,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {42516#(= main_~a~0 0)} [203] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {42512#false} is VALID [2022-04-28 04:21:20,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {42512#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {42512#false} is VALID [2022-04-28 04:21:20,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {42512#false} assume !false; {42512#false} is VALID [2022-04-28 04:21:20,169 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 04:21:20,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:21:20,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906362496] [2022-04-28 04:21:20,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906362496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:20,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:20,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:21:22,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:21:22,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1290349815] [2022-04-28 04:21:22,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1290349815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:22,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:22,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-28 04:21:22,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761645565] [2022-04-28 04:21:22,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:21:22,724 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 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 144 [2022-04-28 04:21:22,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:21:22,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 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 04:21:22,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:22,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-28 04:21:22,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:22,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-28 04:21:22,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=4115, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 04:21:22,814 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand has 67 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 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 04:21:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:33,016 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2022-04-28 04:21:33,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-28 04:21:33,016 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 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 144 [2022-04-28 04:21:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:21:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 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 04:21:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 193 transitions. [2022-04-28 04:21:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 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 04:21:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 193 transitions. [2022-04-28 04:21:33,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 193 transitions. [2022-04-28 04:21:33,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:33,152 INFO L225 Difference]: With dead ends: 177 [2022-04-28 04:21:33,152 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 04:21:33,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 44 SyntacticMatches, 36 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4510 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=915, Invalid=16115, Unknown=0, NotChecked=0, Total=17030 [2022-04-28 04:21:33,153 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 261 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 7186 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 7397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 7186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:21:33,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 93 Invalid, 7397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 7186 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 04:21:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 04:21:33,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2022-04-28 04:21:33,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:21:33,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 147 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 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 04:21:33,271 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 147 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 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 04:21:33,271 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 147 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 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 04:21:33,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:33,273 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2022-04-28 04:21:33,273 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2022-04-28 04:21:33,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:33,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:33,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 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 164 states. [2022-04-28 04:21:33,273 INFO L87 Difference]: Start difference. First operand has 147 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 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 164 states. [2022-04-28 04:21:33,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:21:33,274 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2022-04-28 04:21:33,274 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2022-04-28 04:21:33,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:21:33,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:21:33,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:21:33,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:21:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 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 04:21:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2022-04-28 04:21:33,276 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 144 [2022-04-28 04:21:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:21:33,276 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2022-04-28 04:21:33,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 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 04:21:33,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 151 transitions. [2022-04-28 04:21:33,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:33,763 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2022-04-28 04:21:33,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-28 04:21:33,763 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:21:33,763 INFO L195 NwaCegarLoop]: trace histogram [49, 49, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:21:33,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-04-28 04:21:33,764 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:21:33,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:21:33,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1408554296, now seen corresponding path program 58 times [2022-04-28 04:21:33,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:33,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1717326856] [2022-04-28 04:21:34,654 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:34,753 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:34,852 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:34,963 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:35,061 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:35,159 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:35,270 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:35,368 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:35,469 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:35,737 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:21:35,737 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:21:35,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1789485559, now seen corresponding path program 1 times [2022-04-28 04:21:35,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:21:35,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814597066] [2022-04-28 04:21:35,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:21:35,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:21:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:35,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:21:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:21:35,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {43693#(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); {43687#true} is VALID [2022-04-28 04:21:35,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {43687#true} assume true; {43687#true} is VALID [2022-04-28 04:21:35,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43687#true} {43687#true} #80#return; {43687#true} is VALID [2022-04-28 04:21:35,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {43687#true} call ULTIMATE.init(); {43693#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:21:35,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {43693#(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); {43687#true} is VALID [2022-04-28 04:21:35,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {43687#true} assume true; {43687#true} is VALID [2022-04-28 04:21:35,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43687#true} {43687#true} #80#return; {43687#true} is VALID [2022-04-28 04:21:35,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {43687#true} call #t~ret9 := main(); {43687#true} is VALID [2022-04-28 04:21:35,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {43687#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~a~0 := 0; {43692#(= main_~a~0 0)} is VALID [2022-04-28 04:21:35,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {43692#(= main_~a~0 0)} [206] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_3342 v_main_~d~0_3331)) (.cse1 (= |v_main_#t~pre5_370| |v_main_#t~pre5_369|)) (.cse2 (= v_main_~a~0_376 v_main_~a~0_375)) (.cse3 (= v_main_~c~0_1067 v_main_~c~0_1064)) (.cse4 (= v_main_~e~0_10568 v_main_~e~0_10510)) (.cse5 (= |v_main_#t~pre6_788| |v_main_#t~pre6_786|)) (.cse6 (= v_main_~b~0_503 v_main_~b~0_501)) (.cse7 (= |v_main_#t~pre4_309| |v_main_#t~pre4_308|)) (.cse8 (= |v_main_#t~pre8_6387| |v_main_#t~pre8_6338|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre7_2550| |v_main_#t~pre7_2541|) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre7_2541| |v_main_#t~pre7_2550|) .cse5 .cse6 .cse7 .cse8))) InVars {main_~e~0=v_main_~e~0_10568, main_#t~pre7=|v_main_#t~pre7_2550|, main_~c~0=v_main_~c~0_1067, main_#t~pre8=|v_main_#t~pre8_6387|, main_~d~0=v_main_~d~0_3342, main_~b~0=v_main_~b~0_503, main_#t~pre4=|v_main_#t~pre4_309|, main_#t~pre5=|v_main_#t~pre5_370|, main_~a~0=v_main_~a~0_376, main_#t~pre6=|v_main_#t~pre6_788|} OutVars{main_~e~0=v_main_~e~0_10510, main_#t~pre7=|v_main_#t~pre7_2541|, main_~c~0=v_main_~c~0_1064, main_#t~pre8=|v_main_#t~pre8_6338|, main_~d~0=v_main_~d~0_3331, main_~b~0=v_main_~b~0_501, main_#t~pre4=|v_main_#t~pre4_308|, main_#t~pre5=|v_main_#t~pre5_369|, main_~a~0=v_main_~a~0_375, main_#t~pre6=|v_main_#t~pre6_786|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {43692#(= main_~a~0 0)} is VALID [2022-04-28 04:21:35,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {43692#(= main_~a~0 0)} [205] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {43688#false} is VALID [2022-04-28 04:21:35,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {43688#false} assume !((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0); {43688#false} is VALID [2022-04-28 04:21:35,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {43688#false} assume !false; {43688#false} is VALID [2022-04-28 04:21:35,761 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 04:21:35,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:21:35,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814597066] [2022-04-28 04:21:35,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814597066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:35,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:35,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:21:38,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:21:38,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1717326856] [2022-04-28 04:21:38,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1717326856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:21:38,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:21:38,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-28 04:21:38,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105664538] [2022-04-28 04:21:38,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:21:38,236 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.1029411764705883) internal successors, (143), 67 states have internal predecessors, (143), 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 146 [2022-04-28 04:21:38,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:21:38,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 68 states have (on average 2.1029411764705883) internal successors, (143), 67 states have internal predecessors, (143), 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 04:21:38,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:21:38,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-28 04:21:38,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:21:38,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-28 04:21:38,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=4245, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 04:21:38,328 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand has 68 states, 68 states have (on average 2.1029411764705883) internal successors, (143), 67 states have internal predecessors, (143), 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)